Container truck transportation routing as a Mixed Fleet Heterogeneous Dial-a-Ride Problem

In this paper, a new variant of the Heterogeneous Dial-a-Ride Problem (HDARP) is innovatively applied to a routing problem of trucks picking up and delivering full and empty containers in the logistic chain, including container depots, importers demanding full containers and exporters requesting empty containers. On the route different types of trucks pick-up and deliver full and empty 20- and 40-foot containers. We consider trucks that are operated by alternative fuel, as well as the need for refuelling of trucks in any alternative fuel station to eliminate the risk of running out of fuel during its route. The objective of the paper is to contribute to the optimization of container truck transport routing with multiple pick¬ups and deliveries by providing a mathematical programming model aiming at minimizing the transportation cost as well as the negative environmental impacts.

[1]  Eduardo C. Xavier,et al.  Taxi and Ride Sharing: A Dynamic Dial-a-Ride Problem with Money as an Incentive , 2015, Expert Syst. Appl..

[2]  Pitu B. Mirchandani,et al.  The Vehicle Scheduling Problem for Fleets with Alternative-Fuel Vehicles , 2017, Transp. Sci..

[3]  Ismail Karaoglan,et al.  The green vehicle routing problem: A heuristic based exact solution approach , 2016, Appl. Soft Comput..

[4]  許鉅秉,et al.  國際期刊 Transportation Research-Part E---Logistics and Transportation Review 特刊編輯補助 , 2006 .

[5]  Kris Braekers,et al.  Typology and literature review for dial-a-ride problems , 2017, Ann. Oper. Res..

[6]  Sophie N. Parragh.  Introducing heterogeneous users and vehicles into models and algorithms for the dial-a-ride problem , 2011, Transportation research. Part C, Emerging technologies.

[7]  Martin W. P. Savelsbergh,et al.  Efficient feasibility testing for dial-a-ride problems , 2002, Oper. Res. Lett..

[8]  Erwin Pesch,et al.  Planning and Scheduling in Intermodal Transport , 2013, MIM.

[9]  Konstantinos G. Zografos,et al.  An integrated modelling approach for the bicriterion vehicle routing and scheduling problem with environmental considerations , 2017 .

[10]  Jean-François Cordeau,et al.  Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints , 2012, OR Spectr..

[11]  Kris Braekers,et al.  A multi-period dial-a-ride problem with driver consistency , 2016 .

[12]  Gilbert Laporte,et al.  A metaheuristic for the time-dependent pollution-routing problem , 2017, Eur. J. Oper. Res..

[13]  Angela Sanguinetti,et al.  The many reasons your mileage may vary: Toward a unifying typology of eco-driving behaviors , 2017 .

[14]  Dominik Goeke,et al.  Routing a mixed fleet of electric and conventional vehicles , 2015, Eur. J. Oper. Res..

[15]  Gilbert Laporte,et al.  An adaptive large neighborhood search heuristic for the Pollution-Routing Problem , 2012, Eur. J. Oper. Res..

[16]  Mikhail Y. Kovalyov,et al.  A game mechanism for single machine sequencing with zero risk , 2014 .

[17]  Kris Braekers,et al.  A hybrid Genetic Algorithm for the Heterogeneous Dial-A-Ride Problem , 2017, Comput. Oper. Res..

[18]  Gilbert Laporte,et al.  The dial-a-ride problem: models and algorithms , 2006, Ann. Oper. Res..

[19]  Erwin Pesch,et al.  A truck scheduling problem arising in intermodal container transportation , 2013, Eur. J. Oper. Res..

[20]  Gilbert Laporte,et al.  The Pollution-Routing Problem , 2011 .

[21]  Stephen Graham Ritchie,et al.  TRANSPORTATION RESEARCH. PART C, EMERGING TECHNOLOGIES , 1993 .

[22]  J. R. Jaramillo,et al.  The Green Vehicle Routing Problem , 2011 .

[23]  Erwin Pesch,et al.  Approaches to empty container repositioning problems in the context of Eurasian intermodal transportation , 2019, Omega.

[24]  T. V. Woensel,et al.  A selected review on the negative externalities of the freight transportation: Modeling and pricing , 2015 .

[25]  Dominik Kress,et al.  Mechanism design for machine scheduling problems: classification and literature overview , 2018, OR Spectr..

[26]  Jean-François Cordeau,et al.  A Branch-and-Cut Algorithm for the Dial-a-Ride Problem , 2006, Oper. Res..

[27]  Gerrit K. Janssens,et al.  Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depots , 2014 .

[28]  Sai Ho Chung,et al.  Survey of Green Vehicle Routing Problem: Past and future trends , 2014, Expert Syst. Appl..

[29]  Giovanni Righini,et al.  A heuristic approach for the green vehicle routing problem with multiple technologies and partial recharges , 2014 .

[30]  Dominik Kress,et al.  Incentive compatible mechanisms for scheduling two-parameter job agents on parallel identical machines to minimize the weighted number of late jobs , 2017, Discret. Appl. Math..

[31]  Kris Braekers,et al.  Three effective metaheuristics to solve the multi-depot multi-trip heterogeneous dial-a-ride problem , 2016 .

[32]  KoçÇağrı,et al.  The green vehicle routing problem , 2016 .

[33]  Gilbert Laporte,et al.  The bi-objective Pollution-Routing Problem , 2014, Eur. J. Oper. Res..

[34]  Gilbert Laporte,et al.  A review of recent research on green road freight transportation , 2014, Eur. J. Oper. Res..