New heuristics for traveling salesman and vehicle routing problems with time windows
Conference
·
OSTI ID:36057
We consider variants of the Traveling Salesman (TSP) and Vehicle Routing (VRP) Problems in which each customer can only be visited within a pre-specified (hard) time-window. We first present a two-phase (construction and post-optimization) generalized insertion heuristic for the TSPTW. This insertion heuristic is then imbedded in a tabu search metaheuristic in order to solve the VRPTW. Computational results on standard benchmark problems will be reported.
- OSTI ID:
- 36057
- Report Number(s):
- CONF-9408161-; TRN: 94:009753-0326
- Resource Relation:
- Conference: 15. international symposium on mathematical programming, Ann Arbor, MI (United States), 15-19 Aug 1994; Other Information: PBD: 1994; Related Information: Is Part Of Mathematical programming: State of the art 1994; Birge, J.R.; Murty, K.G. [eds.]; PB: 312 p.
- Country of Publication:
- United States
- Language:
- English
Similar Records
Environmental inspection routes and the constrained travelling salesman problem
The Consistent Vehicle Routing Problem
The cost-constrained traveling salesman problem
Book
·
Thu Jan 01 00:00:00 EST 1976
·
OSTI ID:36057
+1 more
The Consistent Vehicle Routing Problem
Journal Article
·
Thu Jan 01 00:00:00 EST 2009
· Manufacturing & Service Operations Management
·
OSTI ID:36057
The cost-constrained traveling salesman problem
Technical Report
·
Mon Oct 01 00:00:00 EDT 1990
·
OSTI ID:36057