A multi-space sampling heuristic for the vehicle routing problem with stochastic demands

Optimization Letters

Volumn 7, Issue 7, 2013, Pages 1503-1516

  Mendoza, Jorge E ^a   Villegas, Juan G ^b  

^a UNIVERSITÉ CATHOLIQUE DE L'OUEST   (France)

^b UNIVERSIDAD DE ANTIOQUIA   (Colombia)

Author keywords

Heuristics; Logistics; Sampling; Stochastic demands; Vehicle routing

Indexed keywords

COMPUTATIONAL EXPERIMENT; HEURISTIC APPROACH; HEURISTICS; HIGH-QUALITY SOLUTIONS; RANDOMIZED HEURISTICS; STATE-OF-THE-ART ALGORITHMS; STOCHASTIC DEMAND; VEHICLE ROUTING PROBLEMS;

BENCHMARKING; CUSTOMER SATISFACTION; EXPERIMENTS; HEURISTIC METHODS; LOGISTICS; NETWORK ROUTING; PROBABILITY DISTRIBUTIONS; ROUTING ALGORITHMS; SAMPLING; TRAVELING SALESMAN PROBLEM; VEHICLE ROUTING;

COMPUTATIONAL EFFICIENCY;

EID: 84884675164     PISSN: 18624472     EISSN: 18624480     Source Type: Journal    
DOI: 10.1007/s11590-012-0555-8     Document Type: Article

References (27)

1. Ak, A., Erera, A.: A paired-vehicle recourse strategy for the vehicle-routing problem with stochastic demands. Transp. Sci. 41(2), 222-237 (2007).
2. Beasley, J. E.: Route-first cluster-second methods for vehicle routing. Omega 11, 403-408 (1983).
3. Bentley, J. B.: Fast algorithms for geometric traveling salesman problems. INFORMS J. Comput. 4, 387-411 (1992).
4. Bertsimas, D.: A vehicle routing problem with stochastic demand. Oper. Res. 40(3), 574-585 (1992).
5. Boctor, F. F., Renaud, J.: The column-circular, subsets-selection problem: Complexity and solutions. Comput. Oper. Res. 27(4), 383-398 (2000).
6. Christiansen, C., Lysgaard, J.: A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands. Oper. Res. Lett. 35(6), 773-781 (2007).
7. Cordeau, J. F., Gendreau, M., Laporte, G., Potvin, J. Y., Semet, F.: A guide to vehicle routing heuristics. J. Oper. Res. Soc. 53(5), 512-522 (2002).
8. Duhamel, C., Lacomme, P., Prodhon, C.: Efficient frameworks for greedy split and new depth first search split procedures for routing problems. Comput. Oper. Res. 38(4), 723-739 (2011).
9. Erera, A., Savelsbergh, M., Uyar, E.: Fixed routes with backup vehicles for stochastic vehicle routing problems with time constraints. Networks 54(4), 270-283 (2009).
10. Foster, B. A., Ryan, D. M.: An integer programming approach to the vehicle scheduling problem. Oper. Res. Q. 27(2), 367-384 (1976).
11. Gendreau, M., Laporte, G., Séguin, R.: A tabu search heuristic for the vehicle routing problem with stochastic demands and customers. Oper. Res. 44(3), 469-477 (1996).
12. Gillett, B. E., Miller, L. R.: A heuristic algorithm for the vehicle dispatch problem. Oper. Res. 22(2), 340-349 (1974).
13. Goodson, J. C., Ohlmann, J. W., Thomas, B. W.: Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand. Euro. J. Oper. Res. 217(2), 312-323 (2012).
14. Kelly, J. P., Xu, J.: A set-partitioning-based heuristic for the vehicle routing problem. INFORMS J. Comput. 11(2), 161-172 (1999).
15. Laporte, G., Louveaux, F., van Hamme, L.: An integer L-shaped algorithm for the capacitated vehicle routing problem with stochastic demands. Oper. Res. 50(3), 415-423 (2002).
16. Mendoza, J. E., Castanier, B., Guéret, C., Medaglia, A. L., Velasco, N.: A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands. Comput. Oper. Res. 37(11), 1886-1898 (2010).
17. Mendoza, J. E., Castanier, B., Guéret, C., Medaglia, A. L., Velasco, N.: Constructive heuristics for the multicompartment vehicle routing problem with stochastic demands. Transp. Sci. 45(3), 335-345 (2011).
18. Prins, C.: A simple and effective evolutionary algorithm for the vehicle routing problem. Comput. Oper. Res. 31(12), 1985-2002 (2004).
19. Reinelt, G.: Construction heuristics. In: The traveling salesman, lecture notes in computer science, vol. 840, pp. 73-99. Springer, Berlin (1994).
20. Rochat, Y., Taillard, E. D.: Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics 1, 147-167 (1995).
21. Ryan, D. M., Hjorring, C., Glover, F.: Extensions of the petal method for vehicle routeing. J. Oper. Res. Soc. 44(3), 289-296 (1993).
22. Secomandi, N.: A rollout policy for the vehicle routing problem with stochastic demands. Oper. Res. 49(5), 796-804 (2001).
23. Secomandi, N.: Analysis of a rollout approach to sequencing problems with stochastic routing applications. J. Heuristics 9(4), 321-352 (2003).
24. Secomandi, N., Margot, F.: Reoptimization approaches for the vehicle-routing problem with stochastic demands. Oper. Res. 57(1), 214-230 (2009).
25. Teodorović, D., Pavković, G.: A simulated annealing technique approach to the vehicle routing problem in the case of stochastic demands. Transp. Plan. Technol. 16(4), 261-273 (1992).
26. Villegas, J. G., Prins, C., Prodhon, C., Medaglia, A. L., Velasco, N.: A matheuristic for the truck and trailer routing problem. Department of Industrial Engineering, Universidad de Antioquia, Technical report (2011).
27. Yang, W. H., Mathur, K., Ballou, R.: Stochastic vehicle routing with restocking. Transp. Sci. 34(1), 99-112 (2000).