A route-neighborhood-based metaheuristic for vehicle routing problem with time windows

In this paper, a two-stage metaheuristic based on a new neighborhood structure is proposed to solve the vehicle routing problem with time windows (VRPTW). Our neighborhood construction focuses on the relationship between route(s) and node(s). Unlike the conventional methods for parallel route constr...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research 1999-11, Vol.118 (3), p.485-504
Main Authors: Liu, Fuh-Hwa Franklin, Shen, Sheng-Yuan
Format: Article
Language:English
Subjects:
Heuristic
Metaheuristics
Neighborhood
Neighborhoods
Operations research
Routing
Studies
Time windows
Vehicles
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, a two-stage metaheuristic based on a new neighborhood structure is proposed to solve the vehicle routing problem with time windows (VRPTW). Our neighborhood construction focuses on the relationship between route(s) and node(s). Unlike the conventional methods for parallel route construction, we construct routes in a nested parallel manner to obtain higher solution quality. Valuable information extracted from the previous parallel construction runs is used to enhance the performance of parallel construction. In addition, when there are only a few unrouted customers left, we design a special procedure for handling them. Computational results for 60 benchmark problems are reported. The results indicate that our approach is highly competitive with all existing heuristics, and in particular very promising for solving problems of large size.
ISSN:0377-2217
1872-6860
DOI:10.1016/S0377-2217(98)00315-4