Optimizing vehicle routes in a bakery company allowing flexibility in delivery dates

Journal of the Operational Research Society

Volumn 63, Issue 5, 2012, Pages 569-581

  Pacheco, J ^a   Alvarez, A ^b   Garcia I ^b,c   Angel Bello, F ^d  

^a UNIVERSITY OF BURGOS   (Spain)

^b Ciudad Universitaria   (Mexico)

^c UNIVERSIDAD AUTÓNOMA DE COAHUILA   (Mexico)

^d SCHOOL OF ENGINEERING AND SCIENCES   (Mexico)

Author keywords

GRASP; metaheuristics; path relinking; VRP with flexibility in delivery

Indexed keywords

OPERATIONS RESEARCH;

COMPUTATIONAL EXPERIMENT; GRASP; HIGH-QUALITY SOLUTIONS; META HEURISTICS; METAHEURISTIC STRATEGY; MIXED INTEGER LINEAR; PATH RELINKING; VRP WITH FLEXIBILITY IN DELIVERIES;

RESEARCH;

EID: 84859949808     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.2011.51     Document Type: Article

References (56)

1. Ahuja R, Magnanti T and Orlin J (1993). Network Flows: Theory, Algorithms and Applications. Prentice Hall: Englewood Cliffs, NJ.
2. Alegre J, Laguna M and Pacheco J (2007). Optimizing the periodic pick-up of raw materials for a manufacturer of auto parts. Eur J Opl Res 179: 736-746. (Pubitemid 46038586)
3. Beasley J (1983). Route-first cluster-second methods for vehicle routing. Omega 11: 403-408.
4. Bentley J (1992). Fast algorithms for geometric traveling salesman problems. ORSA J Comput 4: 387-411. (Pubitemid 23583062)
5. Bolduc M, Renaud J, Boctor F and Laporte G (2008). A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers. J Opns Res Soc 59(6): 776-787. (Pubitemid 351641210)
6. Brandao J (2009). A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem. Eur J Opl Res 195(3): 716-728.
7. Braysy O (2003). A reactive variable neighborhood search algorithm for the vehicle routing problem with time windows. INFORMS J Comput 15(4): 347-368. (Pubitemid 39042714)
8. Braysy O and Gendreau M (2005). Vehicle routing problem with time windows, part I: Route construction and local search algorithms. Transport Sci 39(1): 104-118. (Pubitemid 40466664)
9. Christofides N and Beasley J (1984). The period routing problem. Networks 14: 237-256.
10. Clarke G and Wright J (1964). Scheduling of vehicles from a central depot to a number of delivery points. Opns Res 12(4): 568-581.
11. Cordeau J, Gendreau M and Laporte G (1997). A tabu search heuristic for periodic and multidepot vehicle routing problems. Networks 30: 105-119. (Pubitemid 127360996)
12. Cordeau J, Laporte G and Mercier A (2001). A unified tabu search heuristic for vehicle routing problems with time windows. J Opl Res Soc 52: 928-936. (Pubitemid 32720268)
13. Cordeau J, Laporte G, Savelsbergh P and Vigo D (2007). Vehicle routing. In: Barnhart C and Laporte G (eds). Transportation, Handbooks in Operations Research and Management Science. Elsevier: Amsterdam, pp 367-428.
14. Dijkstra E (1959). A note on two problems in connexion with graphs. Numer Math 1: 269-271.
15. Dullaert W, Janssens G, Sorensen K and Vernimmen B (2002). New heuristics for the fleet size and mix vehicle routing problem with time windows. J Opl Res Soc 53: 1232-1238. (Pubitemid 35354425)
16. Feo T and Resende M (1989). A probabilistic heuristic for a computationally difficult set covering problem. Opns Res Lett 8: 67-71.
17. Feo T and Resende M (1995). Greedy randomized adaptive search procedures. J Global Optim 6: 109-133.
18. Fisher M (1994). Optimal solution of vehicle routing problems using minimum K-trees. Opns Res 42: 626-642.
19. Fisher M and Jaikumar R (1981). A generalized assignment heuristic for vehicle routing. Networks 11: 109-124. (Pubitemid 13506979)
20. Flisberg P, Bertil Liden B and Ronnqvist M (2009). A hybrid method based on linear programming and tabu search for routing of logging trucks. Comput Opns Res 36: 1122-1144.
21. Francis P, Smilowitz K and Tzur M (2008). The period vehicle routing problem and its extensions. In: Golden B, Raghavan S and Wasil E (eds). The Vehicle Routing Problem Latest Advances and New Challenges. Springer: New York, pp 73-102.
22. Gajpal Y and Abad P (2010). Saving-based algorithms for vehicle routing problem with simultaneous pickup and delivery. J Opl Res Soc 61: 1498-1509.
23. Gambardella L, Taillard E and Agazzi G (1999). MACS-VRPTW: A multiple ant colony system for vehicle routing problems with time windows. In: Corne D, Dorigo M and Glover F (eds). New Ideas in Optimization. McGraw-Hill: New York.
24. Gendreau M, Hertz A and Laporte G (1992). New insertion and postoptimization procedures for the traveling salesman problem. Opns Res 40: 1086-1094.
25. Gendreau M, Hertz A and Laporte G (1994). A tabu search heuristic for the vehicle routing problem. Mngt Sci 40: 1276-1290.
26. Gillet B and Miller L (1974). A heuristic algorithm for the vehicle-dispatch problem. Opns Res 22: 340-349.
27. Glover F, Laguna M and Marti R (2000). Fundamentals of scatter search and path relinking. Control Cybern 39: 653-684.
28. Goel A and Gruhn V (2008). A general vehicle routing problem. Eur J Opl Res 191(3): 650-660. (Pubitemid 351778609)
29. Haghani A and Jung S (2005). A dynamic vehicle routing problem with time-dependent travel times. Comput Opns Res 32(11): 2959-2986. (Pubitemid 40244557)
30. Hemmelmayr VC, Doerner KF and Hartl RF (2009). A variable neighbourhood search heuristic for periodic routing problems. Eur J Opl Res 195: 791-802.
31. Imram A, Said Salhi S and Wassan N (2009). A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem. Eur J Opl Res 197(2): 509-518.
32. Jozefowiez N, Glover F and Laguna M (2008). Multi-objective meta-heuristics for the traveling salesman problem with profits. J Math Model Algor 7: 177-195.
33. Kontoravdis G and Bard J (1995). A GRASP for the vehicle routing problem with time windows. ORSA J Comput 7: 10-23.
34. Li FY, Golden B and Wasil E (2007). The open vehicle routing problem: Algorithms, large-scale test problems, and computational results. Comput Opns Res 34(10): 2918-2930. (Pubitemid 46356729)
35. Marinakis Y, Migdalas A and Pardalos P (2007). A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm. J Global Optim 38(4): 555-580. (Pubitemid 46976745)
36. Martello S and Toth P (1990). Knapsack Problems Algorithms and Computer Implementations. John Wiley & Sons: New York.
37. Mester D and Braysy O (2005). Active guided evolution strategies for large-scale vehicle routing problems with time windows. Comput Opns Res 32(6): 1593-1614.
38. Or I (1976). Traveling Salesman Type Combinatorial Problems and Their Relations to the Logistics of Blood Banking. Dissertation, Northwestern University.
39. Osman I (1993). Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann Opl Res 41: 421-451.
40. Pisinger D and Ropke S (2007). A general heuristic for vehicle routing problems. Comput Opns Res 34(8): 2403-2435. (Pubitemid 46073431)
41. Pitsoulis L and Resende M (2002). Greedy randomized adaptive search procedures. In: Pardalos P and Resende M (eds). Handbook of Applied Optimization. Oxford University Press: Oxford, pp 168-183.
42. Potvin J and Bengio S (1994). A genetic approach to the vehicle routing problem with time windows. Technical Report CRT-953, Centre de Recherche sur les Transports, Universite de Montreal.
43. Potvin J and Naud M (2011). Tabu search with ejection chains for the vehicle routing problem with private fleet and common carrier. J Opl Res Soc 62(2): 326-336.
44. Prins C (2004). A simple and effective evolutionary algorithm for the vehicle routing problem. Comput Opns Res 31: 1985-2002. (Pubitemid 38728564)
45. Prins C and Prodhon C (2007). Solving the capacitated location-routing problem by a cooperative Lagrangean relaxation-granular tabu search heuristic. Transport Sci 41: 470-483.
46. Rochat Y and Taillard E (1995). Probabilistic diversification and intensification in local search for vehicle routing. J Heuristic 40: 147-167.
47. Ropke S and Pisinger D (2006). A unified heuristic for a large class of vehicle routing problems with backhauls. Eur J Opl Res 171(3): 750-775. (Pubitemid 43132944)
48. Simchi-Levi D, Chen X and Bramel J (2005). The Logic of Logistics. Theory, Algorithms and Applications for Logistics and Supply Chain Management. Springer: Berlin.
49. Taillard E, Badeau P, Gendreau M and Potvin J (1997). A tabu search heuristic for the vehicle routing problem with soft time windows. Transport Sci 31: 170-186. (Pubitemid 127597092)
50. Tan KC, Chew YH and Lee LH (2006). A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems. Eur J Opl Res 172(3): 855-885.
51. Tarantilis C and Kiranoudis C (2007). A flexible adaptive memory-based algorithm for real-life transportation operations: Two case studies from dairy and construction sector. Eur J Opl Res 179(3): 806-822. (Pubitemid 46043519)
52. Thangiah S, Osman I and Sun T (1994). Hybrid genetic algorithm simulated annealing and tabu search methods for vehicle routing problem with time windows. Technical Report 27, Computer Science Department, Slippery Rock University.
53. Toth P and Vigo D (eds) (2002). Monographs on discrete mathematics and applications. Vehicle Routing Probl. SIAM: Philadelphia, PA.
54. Vondouris C and Tsang E (1999). Guided local search and its application to the travelling salesman problem. Eur J Opns Res 113: 469-499.
55. Zachariadis E, Tarantilis C and Kiranoudis C (2009a). A guided tabu search for the vehicle routing problem with two-dimensional loading constraints. Eur J Opl Res 195(3): 729-743.
56. Zachariadis E, Tarantilis C and Kiranoudis C (2009b). A hybrid metaheuristic algorithm for the vehicle routing problem with simultaneous delivery and pick-up service. Expert Syst Appl 36(2): 1070-1081.