A decision support system for optimizing dynamic courier routing operations

• Published in: Expert systems with applications Vol. 41; no. 15; pp. 6917 - 6933
• Main Authors: Lin, Canhong, Choy, K.L., Ho, G.T.S., Lam, H.Y., Pang, Grantham K.H., Chin, K.S.
• Format: Journal Article
• Language: English
• Published: Amsterdam Elsevier Ltd 01.11.2014; Elsevier
• Subjects: Algorithms; Applied sciences; Computer science; control theory; systems; Computing time; Courier service; Courier services; Decision support system; Decision support systems; Decision theory. Utility theory; Dynamic tests; Dynamic vehicle routing; Dynamics; Exact sciences and technology; Flows in networks. Combinatorial problems; Fuzzy logic; Information systems. Data bases; Logistics; Mathematical models; Memory organisation. Data processing; Operational research and scientific management; Operational research. Management science; Software; Variable Neighborhood Search; Windows (intervals); Fuzzy logic; Dynamic vehicle routing; Decision support system; Courier service; Variable Neighborhood Search; Prototype; Vehicle routing problem; Competitiveness; Modeling; Optimization; Minimum time; User service; Efficiency; Cancellation; Time interval; Hybrid model; Dynamic programming; Service life; Routing; Scheduling; Real time; Search algorithm; Service time; Time window; Neighborhood search; Heuristic method; Service quality
• ISSN: 0957-4174; 1873-6793
• DOI: 10.1016/j.eswa.2014.04.036

•Propose a dynamic courier routing model with new orders and order cancellation.•Integrate fuzzy time windows to formulate and evaluate courier service level.•Develop a Hybrid Neighboring Search algorithm to tackle the dynamic problem.•Enhance service level without increasing transportation and manpower cost. In this paper, we propose a prototype of a decision support system (DSS) that integrates a hybrid neighborhood search algorithm to solve the offline and online routing problems arising in courier service. In the dynamic operational environment of courier service, new customer orders and order cancellations continually arrive over time and thus disrupt the optimal routing schedule that was originally designed. This calls for the real-time re-optimization of routes. As service level is sensitive to whether allowable service time intervals are wide or narrow, it is valuable to study how adjustable and flexible time windows influence the courier service efficiency in a dynamic environment. To capture these dynamic features, a dynamic vehicle routing problem (DVRP) that simultaneously considers new customer orders and order cancellations is investigated in this study. Meanwhile, fuzzy time windows are formulated in the DVRP model to quantify the service level and explore the service efficiency. To tackle the new problem, we propose a competitive hybrid neighborhood search heuristic for (re)optimizing the offline and online routes. Numerical computational experiments and the comparison with results from Lingo show that our algorithm is capable of re-optimizing dynamic problems effectively and accurately in a very short time. The proposed model and algorithms are able to enhance courier service level without further expense of a longer traveling distance or a larger number of couriers.