Skip to main content
OSTI.GOVU.S. Department of Energy Office of Scientific and Technical Information
U.S. Department of Energy
Office of Scientific and Technical Information
 

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--
Country of Publication:
United States
Language:
English

Similar Records

The Consistent Vehicle Routing Problem
Journal Article · Wed Dec 31 23:00:00 EST 2008 · Manufacturing & Service Operations Management · OSTI ID:967995
A Library of Local Search Heuristics for the Vehicle Routing Problem
Journal Article · Thu Dec 31 23:00:00 EST 2009 · Mathematical Programming Computation · OSTI ID:979334
The cost-constrained traveling salesman problem
Technical Report · Mon Oct 01 00:00:00 EDT 1990 · OSTI ID:6223080

Related Subjects

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATION
99 GENERAL AND MISCELLANEOUS
ALGORITHMS
DATA BASE MANAGEMENT
EFFICIENCY
INFORMATION RETRIEVAL
OPTIMIZATION
ROUTING
TRANSPORTATION SYSTEMS