Solving the vehicle routing problem with multiple trips by adaptive memory programming

International Journal of Logistics Systems and Management

Volumn 3, Issue 4, 2007, Pages 440-450

  Olivera, Alfredo ^a   Viera, Omar ^a  

^a UNIVERSIDAD DE LA REPÚBLICA   (Uruguay)

Author keywords

Adaptive memory; Multiple trips; Vehicle routing

Indexed keywords

EID: 34848871583     PISSN: 17427967     EISSN: 17427975     Source Type: Journal    
DOI: 10.1504/IJLSM.2007.013213     Document Type: Article

References (17)

1. Battiti, R. and Tecchiolli, G. (1994) 'The reactive tabu search', ORSA Journal on Computing, Vol. 6, pp.126-140.
2. Brandão, J. and Mercer, A. (1998) 'The multi-trip vehicle routing problem', Journal of the Operational Research Society, Vol. 49, pp.799-805.
3. Christofides, N., Mingozzi, A. and Toth, P. (1979) 'Combinatorial optimization', The Vehicle Routing Problem, Chichester: Wiley, pp.315-338.
4. Cordeau, J-F. and Laporte, G. (2002) 'Tabu search heuristics for the vehicle routing problem', Technical Report Cahiers du GERAD G-2002-15, École des Hautes Études Commerciales de Montréal.
5. Fisher, M. (1994) 'Optimal solution of vehicle routing problems using minimum k-trees', Operations Research, Vol. 42, pp.626-642.
6. Fleischmann, B. (1990) 'The vehicle routing problem with multiple use of vehicles', Working Paper, Fachbereich Wirtschaftswissenschaften, Universität Hamburg.
7. Gendreau, M., Hertz, A. and Laporte, G. (1992) 'New insertion and post optimization procedures for the traveling salesman problem', Operations Research, Vol. 40, pp. 1086-1094.
8. Gendreau, M., Hertz, A. and Laporte, G. (1994) 'A tabu search heuristic for the vehicle routing problem', Management Science, Vol. 40, pp. 1276-1290.
9. Gillett, B. and Miller, L. (1974) 'A heuristic algorithm for the vehicle-dispatch problem', Operations Research, Vol. 22, pp.340-349.
10. Lenstra, J. and Rinnooy Kan, A. (1981) 'Complexity of vehicle routing and scheduling problems', Networks, Vol. 11, pp.221-227.
11. Martello, S. and Toth, P. (1990) Knapsack Problems, Chichester: Wiley.
12. Olivera, A. and Viera, O. (2005) 'Adaptive memory programming for the vehicle routing problem with multiple trips', Computers and Operations Research, in press.
13. Petch, R. and Salhi, S. (2004) 'A multi-phase constructive heuristic for the vehicle routing problem with multiple trips', Discrete Applied Mathematics, Vol. 133, pp.69-92.
14. Rochat, Y. and Taillard, E. (1995) 'Probabilistic diversification and intensification in local search for vehicle routing', Journal of Heuristics, Vol. 1, pp.147-167.
15. Taillard, E., Laporte, G. and Gendreau, M. (1996) 'The vehicle routing problem with multiple use of vehicles, Journal of the Operational Research Society, Vol. 47, pp. 1065-1070.
16. Toth, P. and Vigo, D. (2002) 'The vehicle routing problem', SlAM Monographs on Discrete Mathematics and Applications.
17. Toth, P. and Vigo, D. (2003) 'The granular Tabu Search and its application to the vehicle routing problem, INFORMS Journal on Computing, Vol. 15, pp.333-346.