A multiobjective evolutionary algorithm for solving vehicle routing problem with time windows

K. C. Tan, T. H. Lee, Y. H. Chew, L. H. Lee

Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review

22 Citations (Scopus)

Abstract

Vehicle routing problem with time windows (VRPTW) involves the routing of a set of vehicles with limited capacity from a central depot to a set of geographically dispersed customers with known demands and predefined time windows. This paper proposes a hybrid multiobjective evolutionary algorithm (HMOEA) that incorporates various heuristics for local exploitation in the evolutionary search and the concept of Pareto's optimality for solving multiobjective optimization in VRPTW problems. The proposed HMOEA optimizes all routing constraints and objectives simultaneously, which improves the routing solutions in many aspects, such as lower routing cost, wider scattering area and better convergence trace.
Original languageEnglish
Title of host publication2003 IEEE International Conference on Systems, Man and Cybernetics
PublisherIEEE
Pages361-366
Volume1
ISBN (Print)0-7803-7952-7
DOIs
Publication statusPublished - 2003
Externally publishedYes
EventSystem Security and Assurance - Washington, DC, United States
Duration: 5 Oct 20038 Oct 2003

Conference

ConferenceSystem Security and Assurance
PlaceUnited States
CityWashington, DC
Period5/10/038/10/03

Research Keywords

  • Multiobjective evolutionary optimization
  • Vehicle routing with time windows

Fingerprint

Dive into the research topics of 'A multiobjective evolutionary algorithm for solving vehicle routing problem with time windows'. Together they form a unique fingerprint.

Cite this