City-courier routing and scheduling problems |
| |
Authors: | Tsung-Sheng Chang Hui-Mei Yen |
| |
Institution: | Graduate Institute of Logistics Management, National Dong Hwa University, Hualien, Taiwan |
| |
Abstract: | This research seeks to propose innovative routing and scheduling strategies to help city couriers reduce operating costs and enhance service level. The strategies are realized by constructing a new type of routing and scheduling problem. The problem directly takes into account the inherent physical and operating constraints associated with riding in city distribution networks, which makes the problem involve multiple objectives and visiting specified nodes and arcs. Through network transformations, this study first formulates the city-courier routing and scheduling problem as a multi-objective multiple traveling salesman problem with strict time windows (MOMTSPSTW) that is NP-hard and new to the literature, and then proposes a multi-objective Scatter Search framework that seeks to find the set of Pareto-optimal solutions to the problem. Various new and improved sub-procedures are embedded in the solution framework. This is followed by an empirical study that shows and analyzes the results of applying the proposed method to a real-life city-courier routing and scheduling problem. |
| |
Keywords: | Logistics Couriers Routing and scheduling Multi-objective Scatter Search |
本文献已被 ScienceDirect 等数据库收录! |