Three effective metaheuristics to solve the multi-depot multi-trip heterogeneous dial-a-ride problem |
| |
| Institution: | 1. Laboratory of Modeling and Optimization for Decisional, Industrial and Logistic Systems (MODILS), Faculty of Economics and Management Sciences, University of Sfax, Tunisia;2. Computer Science Department, College of Computer and Information Sciences (CCIS), King Saud University (KSU), Riyadh, Saudi Arabia;3. Research Group Logistics, Hasselt University, Campus Diepenbeek, Agoralaan Gebouw D, 3590 Diepenbeek, Belgium;4. Research Foundation Flanders (FWO), Egmontstraat 5, 1000 Brussels, Belgium;1. Industrial and System Engineering, Khalifa University, P.O. Box 127788, Abu Dhabi, United Arab Emirates;2. Defense Resources Management Institute, Naval Postgraduate School, Monterey, CA 93943, USA;3. School of Computer Science, University of Oklahoma, Norman, OK 73019, USA;4. School of Industrial Engineering, University of Oklahoma, Norman, OK 73019, USA;1. Department of Civil and Environmental Engineering, University of Maryland, College Park, USA;2. IBM Research, Dublin, Ireland;3. IT Curves, Gaithersburg, USA;1. Department of Industrial Engineering and Innovation Sciences, Eindhoven University of Technology, Eindhoven, The Netherlands;2. Department of Computer Science, VU University Amsterdam, Amsterdam, The Netherlands;3. Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands;1. Hasselt University, RG Logistics, Agoralaan Gebouw D, BE-3590 Diepenbeek, Belgium;2. Research Foundation Flanders (FWO), Egmontstraat 5, BE-1000 Brussels, Belgium;3. KU Leuven, Department of Computer Science, CODeS & iMinds-ITEC, Gebroeders De Smetstraat 1, BE-9000 Ghent, Belgium;1. Department of Management Sciences, City University of Hong Kong, Tat Chee Ave, Kowloon Tong, Hong Kong;2. School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore 637371, Singapore;1. International Center of Management Science and Engineering, School of Management and Engineering, Nanjing University, Nanjing 210093, PR China;2. Department of Management Sciences, City University of Hong Kong, Tat Chee Ave, Kowloon Tong, Hong Kong;3. School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore 637371, Singapore |
| |
| Abstract: | The Heterogeneous Dial-a-Ride Problem (HDARP) is an important problem in reduced mobility transportation. Recently, several extensions have been proposed towards more realistic applications of the problem. In this paper, a new variant called the Multi-Depot Multi-Trip Heterogeneous Dial-a-Ride Problem (MD-MT-HDARP) is considered. A mathematical programming formulation and three metaheuristics are proposed: an improved Adaptive Large Neighborhood Search (ALNS), Hybrid Bees Algorithm with Simulated Annealing (BA-SA), and Hybrid Bees Algorithm with Deterministic Annealing (BA-DA). Extensive experiments show the effectiveness of the proposed algorithms for solving the underlying problem. In addition, they are competitive to the current state-of-the-art algorithm on the MD-HDARP. |
| |
| Keywords: | Vehicle Routing Problem (VRP) Dial-a-Ride Problem (DARP) Metaheuristic Optimization Bees Algorithm (BA) |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
