A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
- 31 October 2004
- journal article
- Published by Elsevier BV in Computers & Operations Research
- Vol. 31 (12), 1947-1964
- https://doi.org/10.1016/s0305-0548(03)00155-2
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- A unified tabu search heuristic for vehicle routing problems with time windowsJournal of the Operational Research Society, 2001
- A Lower Bound for the Split Delivery Vehicle Routing ProblemOperations Research, 2000
- A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time WindowsOperations Research, 1998
- Split-delivery routeing heuristics in livestock feed distributionJournal of the Operational Research Society, 1997
- Probabilistic diversification and intensification in local search for vehicle routingJournal of Heuristics, 1995
- The split delivery vehicle scheduling problem with time windows and grid network distancesComputers & Operations Research, 1995
- Vehicle routing with split deliveriesDiscrete Applied Mathematics, 1994
- Split delivery routingNaval Research Logistics (NRL), 1990
- Savings by Split Delivery RoutingTransportation Science, 1989
- Complexity of vehicle routing and scheduling problemsNetworks, 1981