Combining biased randomization with iterated local search for solving the multidepot vehicle routing problem

International Transactions in Operational Research

Volumn 22, Issue 4, 2015, Pages 647-667

  Juan, Angel A ^a   Pascual, Iñaki ^a   Guimarans, Daniel ^b   Barrios, Barry ^a  

^a UNIVERSITAT OBERTA DE CATALUNYA   (Spain)

^b CSIRO   (Australia)

Author keywords

Biased randomization; Iterated local search; Metaheuristics; Multidepot vehicle routing problem; Parallelization of heuristics; Randomized algorithms

Indexed keywords

COMPUTATIONAL EFFICIENCY; LOCAL SEARCH (OPTIMIZATION); RANDOM PROCESSES; VEHICLE ROUTING; VEHICLES;

BIASED RANDOMIZATION; ITERATED LOCAL SEARCH; META HEURISTICS; MULTI-DEPOT VEHICLE ROUTING PROBLEMS; PARALLELIZATIONS; RANDOMIZED ALGORITHMS;

PROBABILITY DISTRIBUTIONS;

EID: 84930539681     PISSN: 09696016     EISSN: 14753995     Source Type: Journal    
DOI: 10.1111/itor.12101     Document Type: Article

References (36)

1. Bettinelli, A., Ceselli, A., Righini, G., 2011. A branch-and-cut-and-price algorithm for the multi-depot heterogeneous vehicle routing problem with time windows. Transportation Research Part C: Emerging Technologies 19, 723-740.
2. Ceselli, A., Righini, G., Salani, M., 2009. A column generation algorithm for a rich vehicle-routing problem. Transport Science 43, 1, 56-69.
3. Chan, Y., Carter, W.B., Burnes, M.D., 2001. A multiple-depot, multiple-vehicle, location-routing with stochastically processed demands. Computers & Operations Research 28, 803-826.
4. Chao, I.M., Golden, B.L., Wasil, E., 1993. A new heuristic for the multi-depot vehicle routing problem that improves upon best-known solution. American Journal of Mathematical and Management Sciences 13, 371-406.
5. Clarke, G., Wright, J., 1964. Scheduling of vehicles from a central depot to a number of delivering points. Operations Research 12, 568-581.
6. Cordeau, J.F., Gendreau, M., Laporte, G., 1997. A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30, 105-119.
7. Cordeau, J.F., Maischberger, M., 2012. A parallel iterated tabu search heuristic for vehicle routing problems. Computers & Operations Research 39, 2033-2050.
8. Crevier, B., Cordeau, J.F., Laporte, G., 2007. The multi-depot vehicle routing problem with inter-depot routes. European Journal of Operational Research 176, 756-773.
9. Dominguez, O., Juan, A., Faulin, J., 2014. A biased-randomized algorithm for the two-dimensional vehicle routing problem with and without item rotations. International Transactions in Operational Research 21, 3, 375-398.
10. Dondo, R., Cerdá, J., 2007. A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows. European Journal of Operational Research 176, 1478-1507.
11. Dondo, R., Cerdá, J., 2009. A hybrid local improvement algorithm for large-scale multi-depot vehicle routing problems with time windows. Computers & Chemical Engineering 33, 513-530.
12. Gillett, B.E., Johnson, J.G., 1976. Multi-terminal vehicle-dispatch algorithm. Omega 4, 711-718.
13. Golden, B.L., Magnanti, T.L., Nguyen, H.Q., 1977. Implementing vehicle routing algorithms. Networks 7, 2, 113-148.
14. Golden, B., Raghavan, S., Wasil, E., 2008. The Vehicle Routing Problem: Latest Advances and New Challenges. Springer, Heidelberg.
15. Guimarans, D., Herrero, R., Riera, D., Juan, A.A., Ramos, J.J., 2011. Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem. Annals of Mathematics and Artificial Intelligence 62, 3, 299-315.
16. Ho, W., Ho, G.T.S., Ji, P., Lau, H.C.W., 2008. A hybrid genetic algorithm for the multi-depot vehicle routing problem. Engineering Applications of Artificial Intelligence 21, 548-557.
17. Juan, A., Faulin, J., Grasman, S., Riera, D., Marull, J., Mendez, C., 2011a. Using safety stocks and simulation to solve the vehicle routing problem with stochastic demands. Transportation Research Part C: Emerging Technologies 19, 751-765.
18. Juan, A., Faulin, J., Jorba, J., Caceres, J., Marques, J., 2013. Using parallel & distributed computing for solving real-time vehicle routing problems with stochastic demands. Annals of Operations Research 207, 43-65.
19. Juan, A., Faulin, J., Jorba, J., Riera, D., Masip, D., Barrios, B., 2011b. On the use of Monte Carlo simulation, cache and splitting techniques to improve the Clarke and Wright savings heuristic. Journal of the Operational Research Society 62, 1085-1097.
20. Juan, A., Faulin, J., Ruiz, R., Barrios, B., Gilibert, M., Vilajosana, X., 2009. Using oriented random search to provide a set of alternative solutions to the capacitated vehicle routing problem. In Chinneck, J.W., Kristjansson, B., Saltzman, M.J. (eds) Operations Research and Cyber-Infrastructure. Springer, New York, pp. 331-346.
21. Juan, A., Lourenço, H., Mateo, M., Luo, R., Castella, Q., 2014. Using iterated local search for solving the flow-shop problem: parametrization, randomization and parallelization issues. International Transactions in Operational Research 21, 1, 103-126.
22. Laporte, G., 2007. What you should know about the vehicle routing problem. Naval Research Logistics 54, 8, 811-819.
23. Laporte, G., Nobert, Y., Arpin, D., 1984. Optimal solutions to capacitated multidepot vehicle routing problems. Congressus Numerantium 44, 283-292.
24. Lin, S., 1965. Computer solutions of the traveling salesman problem. AT&T Technical Journal 44, 2245-2269.
25. Lourenço, H.R., Martin, O., Stützle, T., 2010. Iterated local search: framework and applications. In Gendreau, M., Potvin, J.-Y. (eds) Handbook of Metaheuristics. Springer, New York, pp. 363-397.
26. Mirabi, M., Fatemi-Ghomi, S.M.T., Jolai, F., 2010. Efficient stochastic hybrid heuristics for the multi-depot vehicle routing problem. Robotics and Computer-Integrated Manufacturing 26, 564-569.
27. Pisinger, D., Ropke, S., 2007. A general heuristic for vehicle routing problems. Computers & Operations Research 34, 2403-2435.
28. Prins, C., 2004. A simple and effective evolutionary algorithm for the vehicle routing problem. Computers & Operations Research 31, 12, 1985-2002.
29. Raft, O.M., 1982. A modular algorithm for an extended vehicle scheduling problem. European Journal of Operational Research 11, 67-76.
30. Renaud, J., Laporte, G., Boctor, F.F., 1996. A tabu search heuristic for the multi-depot vehicle routing problem. Computers & Operations Research 23, 3, 229-235.
31. Talbi, E., 2009. Metaheuristics: From Design to Implementation. John Wiley & Sons, New York.
32. Thangiah, S.R., Salhi, S., 2001. Genetic clustering: an adaptive heuristic for the multi-depot vehicle routing problem. Applied Artificial Intelligence 15, 361-383.
33. Tillman, F.A., Cain, T.M., 1972. An upperbound algorithm for the single and multiple terminal delivery problem. Management Science 18, 664-682.
34. Toth, P., Vigo, D., 2002. The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications SIAM (Society for Industrial and Applied Mathematics), Philadelphia, PA.
35. Vidal, T., Crainic, T.G., Gendreau, M., Lahrichi, N., Rei, W., 2012. A hybrid genetic algorithm for multi-depot and periodic vehicle routing problems. Operations Research 60, 3, 611-624.
36. Wren, A., Holliday, A., 1972. Computer scheduling of vehicles from one or more depots to a number of delivery points. Operational Research Quarterly 23, 333-344.