An efficient two-phase exact algorithm for the automated truck freight transportation problem

A recent study has developed an integer linear program and an exact algorithm for the automated truck transportation freight problem with lane reservation. However, due to its NP-hard nature, their proposed method becomes difficult to solve large-size problems within acceptable time. In this paper, we firstly present an improved integer linear program by adding valid inequalities and identify that its several special cases are classical combinatorial optimization problems. Based on analyzed properties, a new efficient two-phase exact algorithm is developed. Computational results on benchmark and new larger-size instances with up to 700 nodes and 55 tasks show that the new algorithm outperforms very favorably the state-of-the-art one.

[1]  J. Princeton,et al.  Impact of a Dedicated Lane on the Capacity and the Level of Service of an Urban Motorway , 2011 .

[2]  Feng Chu,et al.  A quantum evolutionary algorithm for lane reservation problem , 2013, 2013 10th IEEE INTERNATIONAL CONFERENCE ON NETWORKING, SENSING AND CONTROL (ICNSC).

[3]  MengChu Zhou,et al.  An Improved Exact $\varepsilon$-Constraint and Cut-and-Solve Combined Method for Biobjective Robust Lane Reservation , 2015, IEEE Transactions on Intelligent Transportation Systems.

[4]  MengChu Zhou,et al.  $\varepsilon$-Constraint and Fuzzy Logic-Based Optimization of Hazardous Material Transportation via Lane Reservation , 2013, IEEE Transactions on Intelligent Transportation Systems.

[5]  Georgios Ellinas,et al.  Path Routing in Mesh Optical Networks , 2007 .

[6]  Ismail Karaoglan,et al.  A hybrid discrete particle swarm optimization for vehicle routing problem with simultaneous pickup and delivery , 2013, Comput. Ind. Eng..

[7]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[8]  Feng Chu,et al.  Exact and Heuristic Algorithms for Rapid and Station Arrival-Time Guaranteed Bus Transportation via Lane Reservation , 2017, IEEE Transactions on Intelligent Transportation Systems.

[9]  MengChu Zhou,et al.  Improved Quantum-Inspired Evolutionary Algorithm for Large-Size Lane Reservation , 2015, IEEE Transactions on Systems, Man, and Cybernetics: Systems.

[10]  Feng Chu,et al.  An optimal algorithm for automated truck freight transportation via lane reservation strategy , 2013 .

[11]  Guoliang Xue,et al.  The Constrained Shortest Path Problem: Algorithmic Approaches and an Algebraic Study with Generalization ∗ , 2005 .

[12]  Feng Chu,et al.  A new cut-and-solve and cutting plane combined approach for the capacitated lane reservation problem , 2015, Comput. Ind. Eng..

[13]  Feng Chu,et al.  A cut-and-solve-based algorithm for optimal lane reservation with dynamic link travel times , 2014 .

[14]  MengChu Zhou,et al.  Optimal Lane Reservation in Transportation Network , 2012, IEEE Transactions on Intelligent Transportation Systems.

[15]  Feng Chu,et al.  Heuristic for lane reservation problem in time constrained transportation , 2009, 2009 IEEE International Conference on Automation Science and Engineering.

[16]  J. Y. Yen.  Finding the K Shortest Loopless Paths in a Network , 1971 .

[17]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[18]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[19]  Christian Prins,et al.  A simple and effective evolutionary algorithm for the vehicle routing problem , 2004, Comput. Oper. Res..

[20]  Isa Nakhai Kamal Abadi,et al.  An efficient population-based simulated annealing algorithm for the multi-product multi-retailer perishable inventory routing problem , 2016, Comput. Ind. Eng..