The vehicle routing problem: The case of the Hong Kong postal service

Ping Ji, Kejia Chen

Research output: Journal article publicationJournal articleAcademic researchpeer-review

11 Citations (Scopus)

Abstract

With the growth in population and development of business activities in Hong Kong, the range and level of services provided by Hongkong Post have multiplied. However, the schedule of its postal vehicles, including mail collection and delivery, is still constructed manually on a daily basis, based on the experience of staff and transportation reviews. In this paper, the problem of scheduling a set of n collection points (District Post Offices) from a depot (General Post Office) in Hong Kong Island is addressed. The objectives pursued are the maximization of resource utilization and minimization of operation costs. In other words, the variable cost is expected to be reduced. To achieve these goals, an integer linear programming (IP) model of the vehicle routing problem (VRP) is developed in an effort to obtain optimal solutions. As the model involves computational complexity, a commercial software package CPLEX is used to solve the problems efficiently. The results show that the proposed model can produce optimal vehicle routes and schedules.
Original languageEnglish
Pages (from-to)167-182
Number of pages16
JournalTransportation Planning and Technology
Volume30
Issue number2-3
DOIs
Publication statusPublished - 1 Apr 2007

Keywords

  • Hong Kong
  • Integer linear programming
  • Mail collection
  • Vehicle routing problem

ASJC Scopus subject areas

  • Transportation

Cite this