An evolutionary hybrid metaheuristic for solving the vehicle routing problem with heterogeneous fleet

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1391, Issue , 1998, Pages 187-195

  Ochi, Luiz S ^a   Vianna, Dalessandro S ^a   Drummond, Lúcia M A ^a   Victor, André O ^a  

^a FLUMINENSE FEDERAL UNIVERSITY   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FLEET OPERATIONS; GENETIC ALGORITHMS; GENETIC PROGRAMMING; NETWORK ROUTING; ROUTING ALGORITHMS; VEHICLES;

HETEROGENEOUS FLEET; HYBRID META-HEURISTIC; NP COMPLETE; SCATTER SEARCH; VEHICLE ROUTING AND SCHEDULING; VEHICLE ROUTING PROBLEMS;

HYBRID VEHICLES;

EID: 71949125260     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0055938     Document Type: Conference Paper

References (19)

1. BALL, M.O.; MAGNANTI, T.L.; MONNA, C.L. and NENHAUSER, G.L., 1995, Network Routing, Handbook in Op. Res. and Manag. Science, Vol 8, Elsevier Science.
2. BODIN, L.D. and GOLDEN, L., 1981, Classification in Vehicle Routing and Scheduling, NETWORKS, Vol 11, 97-108.
3. BODIN, L.D., 1990, Twenty Years of Routing and Scheduling, Oper. Research, Vol 38(4), 571-579.
4. BODIN, L.D.; GOLDEN, L.; ASSAD, A.A. and BALL, M., 1993, Routing and Scheduling of Vehicles and Crews, The State of the Art, Comp, and Op. Res., Vol 10, 63-211.
5. DANTZIG, G.B. and RANSER, J.H., 1959, The truck dispatching problem, Management Science, Vol 6, 80-91.
6. FOSTER, B.A. and RYAN, D.M., 1976, An Integer Programming Approach to the Vehicle Scheduling Problem, Op. Res. Quarterly. 27, 367-384.
7. GENDRAU, M.; HERTZ, A. and LAPORTE, G., 1992, New Insertion PostOptimization Procedures for the Traveling Salesman Problem, Oper. Res. 40, 1086-1094.
8. GLOVER, F., 1995, Scatter Search and Star-Paths: Beyond the Genetic Metaphor, OR SPECTRUM, Vol 17, Issue 2/3.
9. GLOVER, F., 1997, Tabu Search and Adaptive Memory Programming: Advances, Applications and Challenges. In Interfaces in Computer Science and Operations Research, 1-76, Kluwer Academic Publishers.
10. GOLDEN, B.L., 1993, Special Issue on Vehicle Routing 2000: Advances in Time-Windows, Optimality, Fast Bounds and Mult-Depot Routing, Am. J. Mgmnt. Sci., Vol 13.
11. GOLDEN, B.; ASSAD, A.; LEVY, L. and GHEYSENS, F.G., 1984, The Fleet Size and Mix Vehicle Routing Problem, Computers and Operations Research, Vol 11, 49-66.
12. HOLLAND, J.H., 1976, Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor.
13. OCHI, L.S.; DRUMMOND, L.M.A. and FIGUEIREDO, R.M., 1997, Design and Implementation of a Parallel Genetic Algorithm for the Traveling Purchaser Problem, ACM Symposium on Applied Computing, San Jose-California, 257-263.
14. OCHI, L.S.; RABELO, P.G. and MACULAN, N., 1997, A New Genetic Metaheuristic for the Clustered Traveling Salesman Problem, In Proceedings of the II Metaheuristic International Conference (II MIC’97), Sophia-France, 59-64.
15. REEVES, R., 1993, Modern Heuristic Technics for Combinatorial Problems, Blackwell Scientific Publications.
16. ROCHAT, Y. and TAILLARD, E.D., 1995, Probabilistic Diversification and Intensification on Local Search for Vehicle Routing, Journal of Heuristics, 147-167.
17. RYAN, D.M.; HJORRING and GLOVER, F., 1993, Extensions of the Petal Method for Vehicle Routing, J.Op.Res., Vol 44(3), 289-296.
18. TAILLARD, E.D., 1996, A Heuristic Column Generation Method for the Heterogeneous Fleet, Publication CRT-03-96, Centre de Recherche sur les transports, Universite de Montreal.
19. WHITLEY, D.; STARKWEATHER, T. and SHANER, D., 1991, The traveling Salesman and Sequence Scheduling: Quality Solutions Using Genetic Edge Recombination, Handbook of Genetic Algorithms, Van Nostrand Reinhold, NY.