Quang Ngoc Nguyen
ABSTRACT
This paper introduces an adaptive large neighborhood search metaheuristic to solve the multi-trip multi-traffic pickup and delivery problem with time windows and synchronization (MTT-PDTWS). With adaptive destroy and repair operators, it learns over time which destroy and repair operators are the most effective and governs the operator selection biased toward highly effective one. The computational experiments display the impacts of these operators on the solution quality and the performance of the ALNS in comparison to the only existing tabu search methodology addressing the MTT-PDTWS.
- Ravindra K. Ahuja, Özlem Ergun, James B. Orlin, and Abraham P. Punnen. 2002. A Survey of Very Large-scale Neighborhood Search Techniques. Discrete Appl. Math. 123, 1--3 (Nov. 2002), 75--102. Google Scholar
Digital Library
- A.M. Benjamin and J.E. Beasley. 2010. Metaheuristics for the waste collection vehicle routing problem with time windows, driver rest period and multiple disposal facilities. Computers & Operations Research 37, 12 (2010), 2270--2280. Google ScholarDigital Library
- B. Crevier and J.F. Cordeau, and G. Laporte. 2007. The multi-depot vehicle routing problem with inter-depot routes. European Journal of Operational Research 176, 2 (2007), 756--773.Google ScholarCross Ref
- B.I. Kim and S. Kim, and S. Sahoo. 2006. Waste collection vehicle routing problem with time windows. Computer & Operations Research 33, 12 (2006), 3624--3642. Google ScholarDigital Library
- B.M. Ombuki-Berman and A. Runka, and F.T. Hanshar. 2007. Waste collection vehicle routing problem with time windows using multi-objective genetic algorithms. Proceedings of the Third IASTED International Conference on Computational Intelligence (2007), 91--97. Google ScholarDigital Library
- CD. Tarantilisa and E.E. Zachriadis, and C.T. Kiranoudis. 2008. A hybrid guided local search for the vehicle-routing problem with intermediat replenishment facilities. INFORMS Journal on Computing 20, 1 (2008), 591--613. Google ScholarDigital Library
- T.G. Crainic, F. Errico, W. Rei, and N. Ricciardi. 2012. Integrating c2e and c2c Traffic into City Logistics Planning. Procedia - Social and Behavioral Sciences 39 (2012), 47--60. Seventh International Conference on City Logistics which was held on June 7-9, 2011, Mallorca, Spain.Google Scholar
- T.G. Crainic, P.K. Nguyen, and Michel Toulouse. 2016. Synchronized Multi-trip Multi-traffic Pickup & Delivery in City Logistics. Transportation Research Procedia 12 (2016), 26--39. Tenth International Conference on City Logistics 17-19 June 2015, Tenerife, Spain.Google Scholar
- T.G. Crainic, N. Ricciardi, and G. Storchi. 2009. Models for Evaluating and Planning City Logistics Systems. Transportation Science 43, 4 (2009), 432--454. Google ScholarDigital Library
- E.D. Taillard and G. Laporte, and M. Gendreau. 1995. Vehicle routing with multiple use of vehicles. The journal of the Operational Research Society 47, 8 (1995), 1065--1070.Google ScholarCross Ref
- G.B. Dantzig and J.H. Ramser. 1959. The Truck Dispatching Problem. Management Science 6, 1 (1959), 80--91. Google ScholarDigital Library
- J. Branda o and A. Mercer. 1998. The multi-trip vehcile routing problem. The journal of the Operational Research Society 49, 8 (1998), 799--805.Google ScholarCross Ref
- P.K. Nguyen, T.G. Crainic, and M. Toulouse. 2013. A tabu search for Time-dependent Multi-zone Multi-trip Vehicle Problem with Time Windows. European Journal of Operational Research 231, 1 (2013), 43--56.Google ScholarCross Ref
- P.K. Nguyen, T.G. Crainic, and M. Toulouse. 2017. Multi-trip pickup and delivery problem with time windows and synchronization. Annals of Operations Research 253, 2 (2017), 899--934.Google ScholarCross Ref
- I.H. Osman. 1993. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research 41, 4 (1993), 421--451. Google ScholarDigital Library
- R.J. Petch and S. Salhi. 2003. A multi-phase constructive heuristic for the vehicle routing problem with multiple trips. Discrete Applied Mathematics 133 (2003), 69--92. Google ScholarDigital Library
- S. Ropke and D. Pisinger. 2006. An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows. Transportation Science 40, 4 (2006), 455--472.Google ScholarDigital Library
- S. Salhi and R. Petch. 2007. A GA based heuristic for the vehicle routing problem with multiple trips. Journal of Mathematical Modelling and Algorithms 6 (2007), 591--613.Google ScholarCross Ref
- Paul Shaw. 1998. Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems. Springer Berlin Heidelberg, Berlin, Heidelberg, 417--431.Google Scholar
- E. Taillard, P. Badeau, M. Gendreau, F. Guertin, and J.Y. Potvin. 1997. A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation science 31, 2 (1997), 170--186. Google ScholarDigital Library
- T.G. Crainic and M. Gendreau, and Y. Gajpal. 2012. Multi-zone Multi-trip Vehicle Routing Problem with Time Windows. Technical Report CIRRELT (2012).Google Scholar
Index Terms
- An Adaptive Large Neighborhood Search for Multi-trip Multi-traffic Pickup and Delivery problem with Time Windows and Synchronization
Recommendations
An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows
The pickup and delivery problem with time windows is the problem of serving a number of transportation requests using a limited amount of vehicles. Each request involves moving a number of goods from a pickup location to a delivery location. Our task is ...
Adaptive large neighborhood search heuristic for pollution-routing problem with simultaneous pickup and delivery
This paper deals with the pollution-routing problem with simultaneous pickup and delivery, where the goal is to minimize fuel consumption and emissions by scheduling and routing customers. A nonlinear mix integer programing model is presented for this ...
The multi-vehicle profitable pickup and delivery problem
The transportation industry expanded rapidly in a highly competitive environment. Logistics companies with insufficient volume of transport capacities are forced to make a selection of customers that they can integrate efficiently into their tours. This ...
Comments