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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

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


    Contributors:
    Ji, Ping (author) / Chen, Kejia (author)

    Published in:

    Publication date :

    2007-04-01


    Size :

    16 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    Unknown





    U.S. Postal Airmail Routing Optimization

    Li, Yihua | Online Contents | 2013


    Hong Kong

    Ci͏̈ucci, Raffaella | Online Contents | 1997


    U.S. postal service electric flywheel vehicle

    Norman, T.A. | Tema Archive | 1978