Continuous approximation for demand balancing in solving large-scale one-commodity pickup and delivery problems

Abstract The one-commodity pickup and delivery problem (1-PDP) has a wide range of applications in the real world, e.g., for repositioning bikes in large cities to guarantee the sustainable operations of bike-sharing systems. It remains a challenge, however, to solve the problem for large-scale instances. This paper proposes a hybrid modeling framework for 1-PDP, where a continuum approximation (CA) approach is used to model internal pickup and delivery routing within each of multiple subregions, while matching of net surplus or deficit of the commodity out of these subregions is addressed in a discrete model with a reduced problem size. The interdependent local routing and system-level matching decisions are made simultaneously, and a Lagrangian relaxation based algorithm is developed to solve the hybrid model. A series of numerical experiments are conducted to show that the hybrid model is able to produce a good solution for large-scale instances in a short computation time.

[1]  Gilbert Laporte,et al.  The static bicycle relocation problem with demand intervals , 2014, Eur. J. Oper. Res..

[2]  Juan José Salazar González,et al.  A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery , 2004, Discret. Appl. Math..

[3]  Frédéric Meunier,et al.  Bike sharing systems: Solving the static rebalancing problem , 2013, Discret. Optim..

[4]  Carlos F. Daganzo,et al.  Continuum approximation techniques for the design of integrated package distribution systems , 2007 .

[5]  Yanfeng Ouyang,et al.  Design of vehicle routing zones for large-scale distribution systems , 2007 .

[6]  Juan José Salazar González,et al.  The One-Commodity Pickup-and-Delivery Travelling Salesman Problem , 2001, Combinatorial Optimization.

[7]  Yanfeng Ouyang,et al.  Advancements in continuous approximation models for logistics and transportation systems: 1996–2016 , 2017, 1706.05448.

[8]  Ammar Oulamara,et al.  The two-echelon multi-products location-routing problem with pickup and delivery: formulation and heuristic approaches , 2016 .

[9]  Carlos F. Daganzo,et al.  DESIGN OF MULTIPLE-VEHICLE DELIVERY TOURS II. OTHER METRICS , 1986 .

[10]  Carlos F. Daganzo,et al.  Logistics Systems Analysis , 1991 .

[11]  Reginald R. Souleyrette,et al.  Implementing Vehicle Routing Models , 1990 .

[12]  André Langevin,et al.  CONTINUOUS APPROXIMATIONA MODELS IN FREIGHT DISTRIBUTION: AN OVERVIEW , 1996 .

[13]  Julia Rieck,et al.  Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery , 2014, Eur. J. Oper. Res..

[14]  Inmaculada Rodríguez Martín,et al.  A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem , 2009, Comput. Oper. Res..

[15]  Carlos F. Daganzo,et al.  The length of tours in zones of different shapes , 1984 .

[16]  Richard F. Hartl,et al.  A survey on pickup and delivery problems , 2008 .

[17]  Carlos F. Daganzo,et al.  The Distance Traveled to Visit N Points with a Maximum of C Stops per Vehicle: An Analytic Model and an Application , 1984, Transp. Sci..

[18]  Yanfeng Ouyang,et al.  Discretization and Validation of the Continuum Approximation Scheme for Terminal System Design , 2003, Transp. Sci..

[19]  Iris A. Forma,et al.  A 3-step math heuristic for the static repositioning problem in bike-sharing systems , 2015 .

[20]  Goran Martinović,et al.  Single-Commodity Vehicle Routing Problem with Pickup and Delivery Service , 2008 .

[21]  Xin Wang,et al.  A Continuum Approximation Approach to the Dynamic Facility Location Problem in a Growing Market , 2017, Transp. Sci..

[22]  Xin Wang,et al.  Approximation of discrete spatial data for continuous facility location design , 2014, Integr. Comput. Aided Eng..

[23]  Fanggeng Zhao,et al.  Genetic algorithm for the one-commodity pickup-and-delivery vehicle routing problem , 2009, 2009 IEEE International Conference on Intelligent Computing and Intelligent Systems.

[24]  Mauro Dell'Amico,et al.  The bike sharing rebalancing problem: Mathematical formulations and benchmark instances , 2014 .

[25]  W. Y. Szeto,et al.  A hybrid large neighborhood search for the static multi-vehicle bike-repositioning problem , 2017 .

[26]  Hai Yang,et al.  Facility location design under continuous traffic equilibrium , 2015 .

[27]  Juan José Salazar González,et al.  Heuristics for the One-Commodity Pickup-and-Delivery Traveling Salesman Problem , 2004, Transp. Sci..

[28]  Juan-José Salazar-González,et al.  The one-commodity pickup-and-delivery traveling salesman problem: Inequalities and algorithms , 2007 .

[29]  Thomas Stützle,et al.  A destroy and repair algorithm for the Bike sharing Rebalancing Problem , 2016, Comput. Oper. Res..

[30]  Tal Raviv,et al.  Static repositioning in a bike-sharing system: models and solution approaches , 2013, EURO J. Transp. Logist..

[31]  Güneş Erdoğan,et al.  Discrete Optimization An exact algorithm for the static rebalancing problem arising in bicycle sharing systems , 2015 .

[32]  J. Beardwood,et al.  The shortest path through many points , 1959, Mathematical Proceedings of the Cambridge Philosophical Society.

[33]  Dragan Urošević,et al.  A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem , 2011, Eur. J. Oper. Res..

[34]  W. Y. Szeto,et al.  Chemical reaction optimization for solving a static bike repositioning problem , 2016 .

[35]  Carlos F. Daganzo,et al.  Design of multiple-vehicle delivery tours--I a ring-radial network , 1986 .

[36]  Ismail Karaoglan,et al.  Two Echelon Location Routing Problem with Simultaneous Pickup and Delivery: Mixed Integer Programming Formulations and Comparative Analysis , 2016, ICCL.

[37]  Marshall L. Fisher,et al.  The Lagrangian Relaxation Method for Solving Integer Programming Problems , 2004, Manag. Sci..

[38]  Yanfeng Ouyang,et al.  Reliable Facility Location Design Under the Risk of Disruptions , 2010, Oper. Res..

[39]  Fanggeng Zhao,et al.  Genetic algorithm for the one-commodity pickup-and-delivery traveling salesman problem , 2009, Comput. Ind. Eng..