An investigation into the vehicle routing problem with time windows and link capacity constraints

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

27 Scopus Citations
View graph of relations

Author(s)

  • Hong Ma
  • Brenda Cheang
  • Andrew Lim
  • Lei Zhang
  • Yi Zhu

Related Research Unit(s)

Detail(s)

Original languageEnglish
Pages (from-to)336-347
Journal / PublicationOmega
Volume40
Issue number3
Publication statusPublished - Jun 2012

Abstract

In this work, we investigate a new, yet practical, variant of the vehicle routing problem called the vehicle routing problem with time windows and link capacity constraints (VRPTWLC). The problem considers new constraints imposed on road links with regard to vehicle passing tonnage, which is motivated by a business project with a Hong Kong transportation company that transports hazardous materials (hazmats) across the city and between Hong Kong and mainland China. In order to solve this computationally challenging problem, we develop a tabu search heuristic with an adaptive penalty mechanism (TSAP) to help manage the company's vehicle fleet. A new data set and its generation scheme are also presented to help validate our solutions. Extensive computational experiments are conducted, showing the effectiveness of the proposed solution approach. © 2011 Elsevier Ltd.

Research Area(s)

  • Fleet management, Hazardous materials, Heuristic, Link capacity, Vehicle routing

Citation Format(s)

An investigation into the vehicle routing problem with time windows and link capacity constraints. / Ma, Hong; Cheang, Brenda; Lim, Andrew; Zhang, Lei; Zhu, Yi.

In: Omega, Vol. 40, No. 3, 06.2012, p. 336-347.

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review