The Vehicle Routing Problem: The Case of the Hong Kong Postal Service

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.

[1]  Michel Gendreau,et al.  A guide to vehicle routing heuristics , 2002, J. Oper. Res. Soc..

[2]  Pradip Kumar Ray,et al.  Vehicle Routeing in Large Organizations: A Case Study , 1992 .

[3]  Paolo Toth,et al.  Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations , 1981, Math. Program..

[4]  Michael O. Ball,et al.  The design and analysis of heuristics , 1981, Networks.

[5]  Raymond E. Miller,et al.  Complexity of Computer Computations , 1972 .

[6]  Jan Karel Lenstra,et al.  A classification scheme for vehicle routing and scheduling problems , 1990 .

[7]  Gilbert Laporte,et al.  An exact algorithm for the asymmetrical capacitated vehicle routing problem , 1986, Networks.

[8]  Nicos Christofides,et al.  The period routing problem , 1984, Networks.

[9]  N. Biggs.  THE TRAVELING SALESMAN PROBLEM A Guided Tour of Combinatorial Optimization , 1986 .

[10]  Linus Schrage,et al.  Formulation and structure of more complex/realistic routing and scheduling problems , 1981, Networks.

[11]  Jacques A. Ferland,et al.  School bus routes generator in urban surroundings , 1980, Comput. Oper. Res..

[12]  Bruce L. Golden,et al.  VEHICLE ROUTING: METHODS AND STUDIES , 1988 .

[13]  Samuel J. Raff,et al.  Routing and scheduling of vehicles and crews : The state of the art , 1983, Comput. Oper. Res..

[14]  Thomas L. Magnanti,et al.  Combinatorial optimization and vehicle fleet planning: Perspectives and prospects , 1981, Networks.

[15]  Gilbert Laporte,et al.  The vehicle routing problem: An overview of exact and approximate algorithms , 1992 .

[16]  Richard C. Larson,et al.  Urban Operations Research , 1981 .

[17]  R. A. Zemlin,et al.  Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.

[18]  Gilbert Laporte,et al.  Designing collection routes through bank branches , 1991, Comput. Oper. Res..

[19]  Gilbert Laporte,et al.  Optimal Routing under Capacity and Distance Restrictions , 1985, Oper. Res..

[20]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[21]  J. F. Pierce,et al.  ON THE TRUCK DISPATCHING PROBLEM , 1971 .

[22]  Graham K. Rand,et al.  Surveys in Combinatorial Optimization , 1987 .

[23]  Edward J. Beltrami,et al.  Models for Public Systems Analysis , 1977 .

[24]  Jovan B. Popovic.  VEHICLE ROUTING IN THE CASE OF UNCERTAIN DEMAND: A BAYESIAN APPROACH. , 1995 .

[25]  Nicos Christofides,et al.  Distribution management : mathematical modelling and practical analysis , 1971 .

[26]  Lawrence Bodin,et al.  Classification in vehicle routing and scheduling , 1981, Networks.

[27]  Thomas L. Magnanti,et al.  Implementing vehicle routing algorithms , 1977, Networks.

[28]  Marshall L. Fisher,et al.  A generalized assignment heuristic for vehicle routing , 1981, Networks.