City-courier routing and scheduling problems

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.

[1]  Michel Gendreau,et al.  Path relinking for the vehicle routing problem , 2004, J. Heuristics.

[2]  Samuel J. Raff,et al.  Routing and scheduling of vehicles and crews : The state of the art , 1983, Comput. Oper. Res..

[3]  Ángel Corberán,et al.  New Results on the Mixed General Routing Problem , 2005, Oper. Res..

[4]  Nicolas Jozefowiez,et al.  Multi-objective vehicle routing problems , 2008, Eur. J. Oper. Res..

[5]  Thomas Stützle,et al.  Local search algorithms for combinatorial problems - analysis, improvements, and new applications , 1999, DISKI.

[6]  Arne Løkketangen,et al.  Arc routing in a node routing environment , 2006, Comput. Oper. Res..

[7]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[8]  Rafael Martí,et al.  Scatter Search - Wellsprings and Challenges , 2006, Eur. J. Oper. Res..

[9]  Andrzej Jaszkiewicz,et al.  Genetic local search for multi-objective combinatorial optimization , 2022 .

[10]  Robert A. Russell,et al.  Hybrid Heuristics for the Vehicle Routing Problem with Time Windows , 1995, Transp. Sci..

[11]  Ronald L. Graham,et al.  An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set , 1972, Inf. Process. Lett..

[12]  Matthias Ehrgott,et al.  Multicriteria Optimization , 2005 .

[13]  L. Bodin.  ROUTING AND SCHEDULING OF VEHICLES AND CREWS–THE STATE OF THE ART , 1983 .

[14]  Jonathan F. Bard,et al.  A GRASP for the Vehicle Routing Problem with Time Windows , 1995, INFORMS J. Comput..

[15]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[16]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[17]  Lawrence Bodin,et al.  Street Routing and Scheduling Problems , 2003 .

[18]  S. Ruzika,et al.  Approximation Methods in Multiobjective Programming , 2005 .

[19]  Helena Ramalhinho Dias Lourenço,et al.  Iterated Local Search , 2001, Handbook of Metaheuristics.

[20]  T.-S. Chang,et al.  Routing strategies for integrating forward distribution and reverse collection , 2011, J. Oper. Res. Soc..

[21]  Rafael Martí,et al.  Scatter Search: Diseño Básico y Estrategias avanzadas , 2002, Inteligencia Artif..

[22]  Ángel Corberán,et al.  Heuristic solutions to the problem of routing school buses with multiple objectives , 2002, J. Oper. Res. Soc..

[23]  Manuel Laguna,et al.  Lessons from Applying and Experimenting with Scatter Search , 2005 .