Simulated annealing for the vehicle routing problem with two-dimensional loading constraints

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

34 Scopus Citations
View graph of relations

Author(s)

  • Stephen C. H. Leung
  • Jiemin Zheng
  • Defu Zhang
  • Xiyue Zhou

Related Research Unit(s)

Detail(s)

Original languageEnglish
Pages (from-to)61-82
Journal / PublicationFlexible Services and Manufacturing Journal
Volume22
Issue number1-2
Publication statusPublished - Jun 2010

Abstract

This paper addresses the capacitated vehicle routing problem with two-dimensional loading constraints (2L-CVRP). The 2L-CVRP is a combination of the two most important problems in distribution logistics, which are loading of freight into vehicles, and the successive routing of the vehicles to satisfy customer demand. The objective is to minimize the transportation cost. All vehicles must start and terminate at a central depot, and the transported items carried by the vehicles must be feasibly packed into the loading surfaces of the vehicles. A simulated annealing algorithm to solve the problem is presented, in which the loading component of the problem is solved through a collection of packing heuristics. A novel approach to plan packing is employed. An efficient data structure (Trie) is used to accelerate the algorithm. The extensive computational results prove the effectiveness of the algorithm.

Research Area(s)

  • Loading constraints, Simulated annealing, Vehicle routing

Citation Format(s)

Simulated annealing for the vehicle routing problem with two-dimensional loading constraints. / Leung, Stephen C. H.; Zheng, Jiemin; Zhang, Defu; Zhou, Xiyue.

In: Flexible Services and Manufacturing Journal, Vol. 22, No. 1-2, 06.2010, p. 61-82.

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