Overview of a heuristic for vehicle routing problem with time windows

Fuh-Hwa Liu, Sheng yuan Shen

Research output: Contribution to journalConference article

15 Scopus citations

Abstract

In this paper, a two-stage metaheuristic based on a new neighborhood structure is proposed to solve the vehicle routing problem with time windows. 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. Computational results for 60 benchmark problems are reported. The results indicate that our approach is highly competitive with all existing heuristics, in particular very promising for solving problems with large size.

Original languageEnglish
Pages (from-to)331-334
Number of pages4
JournalComputers and Industrial Engineering
Volume37
Issue number1
DOIs
StatePublished - 1 Jan 1999
EventProceedings of the 1998 24th International Conference on Computers and Industrial Engineering - Middlesex, UK
Duration: 2 Sep 19984 Sep 1998

Fingerprint Dive into the research topics of 'Overview of a heuristic for vehicle routing problem with time windows'. Together they form a unique fingerprint.

  • Cite this