CPSO-THCS: An Optimization Algorithm for Emergency Supply Delivery Routing Problem

摘要

In the emergency supply delivery service, the delivery workers must send supplies to many graphically scattered customers as fast as possible. As various demands for a higher quality of the service occur, the schedule of the emergency supply delivery routing problem (ESDRP) must concern more challenging constraints from real-world situations, such as post-disaster supply response and urgent meal delivery service. This paper investigates the emergency supply delivery service in a real-world situation and formulates it as a multi-objective optimization problem. Special designed objective functions take the number of vehicles, the wastage of goods and the accumulation of free period into account. These novel objectives can measure the urgency of the service. To address the ESDRP, we design a customized particle swarm optimization with a two-hierarchy construction strategy (CPSO-THCS). In the framework of CPSO-THCS, a two-hierarchy construction strategy is proposed for simplifying the process of the construction of feasible solutions during the optimization. Experimental results on real-world benchmark datasets show that the proposed ESDRP model performs well and CPSO-THCS can solve it effectively.