Artificial intelligence heuristics in solving vehicle routing problems with time window constraints
- 31 December 2001
- journal article
- Published by Elsevier BV in Engineering Applications of Artificial Intelligence
- Vol. 14 (6), 825-837
- https://doi.org/10.1016/s0952-1976(02)00011-8
Abstract
No abstract availableKeywords
This publication has 35 references indexed in Scilit:
- A parallel implementation of the Tabu search heuristic for vehicle routing problems with time window constraintsComputers & Operations Research, 1994
- Capacitated clustering problems by hybrid simulated annealing and tabu searchInternational Transactions in Operational Research, 1994
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problemAnnals of Operations Research, 1993
- The vehicle routing problem: An overview of exact and approximate algorithmsEuropean Journal of Operational Research, 1992
- Routing and scheduling of vehicles and crews: The state of the artComputers & Operations Research, 1983
- Route first—Cluster second methods for vehicle routingOmega, 1983
- Optimization by Simulated AnnealingScience, 1983
- A generalized assignment heuristic for vehicle routingNetworks, 1981
- A Computational Modification to the Savings Method of Vehicle SchedulingJournal of the Operational Research Society, 1970
- Bases for Vehicle Fleet SchedulingJournal of the Operational Research Society, 1967