Approximative solutions to the bicriterion Vehicle Routing Problem with Time Windows

European Journal of Operational Research

Volumn 202, Issue 1, 2010, Pages 223-231

  Müller, Juliane ^a  

^a TAMPERE UNIVERSITY OF TECHNOLOGY   (Finland)

Author keywords

Bicriterion optimization; Heuristics; Logistics; Vehicle Routing with Soft Time Windows

Indexed keywords

BICRITERION OPTIMIZATION; COMBINATORIAL OPTIMIZATION PROBLEMS; HEURISTICS; MINIMIZATION PROBLEMS; PARETO OPTIMAL SOLUTIONS; ROUTE PLANNING; TIME WINDOWS; TOTAL COSTS; USED VEHICLES; VEHICLE ROUTING PROBLEM WITH TIME WINDOWS;

COMBINATORIAL OPTIMIZATION; CUSTOMER SATISFACTION; DISTRIBUTION OF GOODS; FLEET OPERATIONS; HEURISTIC METHODS; NETWORK ROUTING; ROUTING ALGORITHMS; SALES; VEHICLES; WINDOWS;

VEHICLE ROUTING;

EID: 70349729937     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2009.04.029     Document Type: Article

References (25)

1. Arbelaitz, O., Rodriguez, C., Zamakola, I., 2001. Low cost parallel solutions for the VRPTW optimization problem. In: International Conference on Parallel Processing Workshops.
2. Barán, B., Schaerer, M., 2003. A multiobjective ant colony system for vehicle routing problem with time windows. In: Proceedings of the 21st IASTED International Conference.
3. Bullnheimer B., Hartl R.F., and Strauss C. An improved ant system algorithm for the vehicle routing problem. Annals of Operations Research 89 (1999) 319-328
4. Clarke G., and Wright J.W. Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 12 (1964) 568-581
5. Coello Coello C.A., Van Veldhuizen D.A., and Lamont G.B. Evolutionary Algorithms for Solving Multi-Objective Problems (2002), Kluwer Academic Publishers
6. Colorni, A., Dorigo, M., Maniezzo, V., 1991. Distributed optimization by ant colonies. In: Proceedings of the European Conference on Artificial Life, pp. 134-142.
7. Czech, Z.J., Czarnas, P., 2002. Parallel simulated annealing for the vehicle routing problem with time windows. In: Proceedings of 10th Euromicto Workshop on Parallel Distributed and Network-Based Processing, Canary Islands, Spain, pp. 376-383.
8. Dantzig G.B., and Ramser J.H. The truck dispatching problem. Management Science 6 (1959) 80-91
9. Desrochers M., Desrosiers J., and Solomon M.M. A new optimization algorithm for the vehicle routing problem with time windows. Operations Research 40 (1992) 342-354
10. Gendreau M., Hertz A., and Laporte G. A tabu search heuristic for the vehicle routing problem. Management Science 40 (1994) 1276-1290
11. Goldberg D.E., and Holland J.H. Genetic algorithms and machine learning. Machine Learning 3 (1988) 95-99
12. Holland J.H. Adaption in Natural and Artificial Systems (1975), The University of Michigan Press
13. Jong, K.A.D., 1975. An Analysis of the Behavior of a Class of Genetic Adaptive Systems. Ph.D. Thesis, University of Michigan.
14. Kohl N., and Madsen O.B.G. An optimization algorithm for the vehicle routing problem with time windows based on Lagrangian relaxation. Operations Research 45 (1997) 395-406
15. Kohl N., Desrosiers J., Madsen O.B.G., Solomon M.M., and Soumis F. 2-path cuts for the vehicle routing problem with time windows. Transportation Science 33 (1999) 101-116
16. Kolen A.W.J., Kan A.H.G.R., and Trienekens H.W.J.M. Vehicle routing with time windows. Operations Research 35 (1987) 266-273
17. Miettinen K.M. Nonlinear Multiobjective Optimization (1999), Kluwer Academic Publishers
18. de Oliveira, H.C.B., Vasconcelos, G.C., Alvarenga, G.B., 2006. A multi-start simulated annealing algorithm for the vehicle routing problem with time windows. In: Proceedings of the Ninth Brazilian Symposium on Neural Networks.
19. Or, I., 1976. Traveling Salesman-Type Combinatorial Problems and their Relation to the Logistics of Regional Blood Banking. Ph.D. Thesis, Northwestern University, Evanston, III.
20. Osman I.H. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research 41 (1993) 421-451
21. Potvin J.-Y., and Rousseau J.-M. An exchange heuristic for routeing problems with time windows. Journal of the Operational Research Society 46 (1995) 1433-1446
22. Solomon M.M. Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research 35 (1987) 254-265
23. Taillard E., Badeau P., Gendreau M., Guertin F., and Potvin J.-Y. A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation Science C (1997) 109-122
24. Toth, P., Vigo, D., 1998. The Granular Tabu Search (and its Application to the Vehicle Routing Problem).
25. Zhong, Y., Pan, X., 2007. A Hybrid Optimization Solution to VRPTW Based on Simulated Annealing.