Determination of cutoff time for express courier services: a genetic algorithm approach

As the result of an explosive growth in e-tailing, telemarketing, and television home-shopping industries, the demand for the direct shipment of purchased goods by express couriers has increased over the last several years. The success of an express courier service often depends heavily on the direct marketing firm's ability to extend its cutoff time (deadline) for direct home deliveries coordinated by service centers near customers. Such an extension of cutoff time, however, may prolong consolidation holding time at the consolidation terminal and subsequently disrupt the timely delivery of products to customers. To make a trade-off between cutoff time extension and delivery delays, we propose an integer programming model and its genetic algorithm solution procedure that allows express couriers, such as UPS, FedEx, and DHL, to maximize their profit generated by direct home deliveries. To demonstrate the practicality and efficiency of the proposed model and solution procedure, we conducted a case study involving an express courier in Korea.

[1]  J. B. Schneider,et al.  Planning transportation terminal systems in urban regions: A man-machine interactive problem-solving approach , 1972 .

[2]  Warrren B Powell,et al.  The load planning problem of motor carriers: Problem description and a proposed solution approach , 1983 .

[3]  Warren B. Powell,et al.  A Local Improvement Heuristic for the Design of Less-than-Truckload Motor Carrier Networks , 1986, Transp. Sci..

[4]  R. Hall.  CONSOLIDATION STRATEGY : INVENTORY, VEHICLES AND TERMINALS , 1987 .

[5]  F. Buffa.  TRANSIT TIME AND COST FACTORS: THEIR EFFECTS ON INBOUND CONSOLIDATION , 1987 .

[6]  H Min,et al.  A COMPARATIVE REVIEW OF ANALYTICAL STUDIES ON FREIGHT CONSOLIDATION AND BACKHAULING , 1990 .

[7]  Thomas L. Magnanti,et al.  Routing in Point-to-Point Delivery Systems: Formulations and Solution Heuristics , 1990, Transp. Sci..

[8]  Hokey Min.  CONSOLIDATION TERMINAL LOCATION-ALLOCATION AND CONSOLIDATED ROUTING PROBLEMS / , 1996 .

[9]  John E. Beasley,et al.  A genetic algorithm for the generalised assignment problem , 1997, Comput. Oper. Res..

[10]  Mitsuo Gen,et al.  Genetic algorithms and engineering design , 1997 .

[11]  Waiman Cheung,et al.  Strategic Service Network Design for DHL Hong Kong , 2001, Interfaces.

[12]  Mitsuo Gen,et al.  The balanced allocation of customers to multiple distribution centers in the supply chain network: a genetic algorithm approach , 2002 .

[13]  Mitsuo Gen,et al.  A genetic algorithm approach to the bi-criteria allocation of customers to warehouses , 2003 .