Container drayage problem with flexible orders and its near real-time solution strategies

This article studies a container drayage problem with flexible orders defined by using requiring and releasing attributes as a unified formulation of various order types. A determined-activities-on-vertex (DAOV) graph introduces a temporary vertex set to formulate different truck statuses. The problem is formulated as a mixed-integer nonlinear programming model based on the DAOV graph. Four strategies including a window partition based (WPB) strategy are presented and evaluated extensively to solve the problem. Results indicate that the WPB method could solve the problem effectively and efficiently. Furthermore, this method is robust considering the operating time biases compared to other algorithms.

[1]  Ruiyou Zhang,et al.  Heuristic-based truck scheduling for inland container transportation , 2010, OR Spectr..

[2]  Leif H. Appelgren,et al.  A Column Generation Algorithm for a Ship Scheduling Problem , 1969 .

[3]  Paola Zuddas,et al.  Models and algorithms for the empty container repositioning and its integration with routing problems , 2013 .

[4]  Gerrit K. Janssens,et al.  Challenges in Managing Empty Container Movements at Multiple Planning Levels , 2011 .

[5]  Becky P.Y. Loo,et al.  Cross-boundary container truck congestion: the case of the Hong Kong-Pearl River Delta region , 2010 .

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

[7]  Karen Ka-Leung Moon,et al.  RFID research: An academic literature review (1995–2005) and future research directions , 2008 .

[8]  Ek Peng Chew,et al.  IT-based planning and control of seaport container terminals and freight transportation systems , 2010, OR Spectr..

[9]  Chuan-Kang Ting,et al.  The selective pickup and delivery problem: Formulation and a memetic algorithm , 2013 .

[10]  Herbert Kopfer,et al.  Synchronized routing of active and passive means of transport , 2014, OR Spectr..

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

[12]  Loo Hay Lee,et al.  The sample average approximation method for empty container repositioning with uncertainties , 2012, Eur. J. Oper. Res..

[13]  Peter Friess,et al.  Internet of Things Strategic Research Roadmap , 2011 .

[14]  Won Young Yun,et al.  Reducing hinterland transportation costs through container sharing , 2015 .

[15]  Antonio Iera,et al.  The Internet of Things: A survey , 2010, Comput. Networks.

[16]  George L. Nemhauser,et al.  An optimization approach for planning daily drayage operations , 2006, Central Eur. J. Oper. Res..

[17]  Guangming Zhang,et al.  Dynamic planning for urban drayage operations , 2011 .

[18]  Karen Renee Smilowitz,et al.  Multi-resource routing with flexible tasks: an application in drayage operations , 2006 .

[19]  Gerrit K. Janssens,et al.  A local search heuristic for the pre- and end-haulage of intermodal container terminals , 2009, Comput. Oper. Res..

[20]  Stefan Voß,et al.  Container terminal operation and operations research - a classification and literature review , 2004, OR Spectr..

[21]  Amos Levin.  Scheduling and Fleet Routing Models for Transportation Systems , 1971 .

[22]  Sophie N. Parragh,et al.  A survey on pickup and delivery problems Part I : Transportation between customers and depot , 2007 .

[23]  Stefan Voß,et al.  Operations research at container terminals: a literature update , 2007, OR Spectr..

[24]  Ruiyou Zhang,et al.  A reactive tabu search algorithm for the multi-depot container truck transportation problem , 2009 .

[25]  Tobias Achterberg,et al.  SCIP: solving constraint integer programs , 2009, Math. Program. Comput..

[26]  Herbert Kopfer,et al.  A Tabu Search Heuristic for the Inland Container Transportation Problem , 2013, Comput. Oper. Res..

[27]  L. Appelgren.  Integer Programming Methods for a Vessel Scheduling Problem , 1971 .

[28]  Walter Ukovich,et al.  Minimizing fleet operating costs for a container transportation company , 2006, Eur. J. Oper. Res..

[29]  Ruiyou Zhang,et al.  Modeling and optimization of a container drayage problem with resource constraints , 2011 .

[30]  Hans-Otto Günther,et al.  Maritime container logistics and onshore transportation systems (Part 1) , 2011 .

[31]  Hark Hwang,et al.  Development of mathematical models for the container road transportation in Korean trucking industries , 2007, Comput. Ind. Eng..

[32]  Milorad Vidovic,et al.  Vehicle Routing in Containers Pickup Up and Delivery Processes , 2011 .

[33]  Alan L. Erera,et al.  Planning local container drayage operations given a port access appointment system , 2008 .

[34]  T. Bektaş.  The multiple traveling salesman problem: an overview of formulations and solution procedures , 2006 .

[35]  Kap Hwan Kim,et al.  Container terminals and terminal operations , 2006, OR Spectr..

[36]  Warren B. Powell,et al.  Chapter 5 Dynamic Models for Freight Transportation , 2007, Transportation.

[37]  Akio Imai,et al.  A Lagrangian relaxation-based heuristic for the vehicle routing with full container load , 2007, Eur. J. Oper. Res..

[38]  Jian Yang,et al.  Real-Time Multivehicle Truckload Pickup and Delivery Problems , 2004, Transp. Sci..

[39]  Gerrit K. Janssens,et al.  Integrated planning of loaded and empty container movements , 2012, OR Spectrum.

[40]  David Pisinger,et al.  Solving Vehicle Routing with Full Container Load and Time Windows , 2012, ICCL.

[41]  Milorad Vidovic,et al.  The Variable Neighborhood Search Heuristic for the Containers Drayage Problem with Time Windows , 2014 .

[42]  Michel Gendreau,et al.  A review of dynamic vehicle routing problems , 2013, Eur. J. Oper. Res..

[43]  Gilbert Laporte,et al.  Dynamic pickup and delivery problems , 2010, Eur. J. Oper. Res..

[44]  Rob A. Zuidwijk,et al.  MIPLIB Truckload PDPTW Instances Derived from a Real-World Drayage Case , 2010 .

[45]  Iris F. A. Vis,et al.  Transshipment of containers at a container terminal: An overview , 2003, Eur. J. Oper. Res..

[46]  Rob A. Zuidwijk,et al.  Can agents measure up? A comparative study of an agent-based and on-line optimization approach for a drayage problem with uncertainty , 2010 .

[47]  Petros A. Ioannou,et al.  CONTAINER MOVEMENT BY TRUCKS IN METROPOLITAN NETWORKS: MODELING AND OPTIMIZATION , 2005 .

[48]  Warren B. Powell,et al.  Dynamic Models for Freight Transportation , 2007 .

[49]  Volker Gruhn,et al.  A General Vehicle Routing Problem , 2008, Eur. J. Oper. Res..

[50]  Carlos Arango,et al.  Dynamic approach to solve the daily drayage problem with transit time uncertainty , 2013, Comput. Ind..

[51]  Hani S. Mahmassani,et al.  On-Line Algorithms for Truck Fleet Assignment and Scheduling Under Real-Time Information , 1999 .

[52]  Amelia Regan,et al.  On the convergence of a new time window discretization method for the traveling salesman problem with time window constraints , 2009, Comput. Ind. Eng..

[53]  Warren B. Powell,et al.  An attribute–decision model for cross-border drayage problem , 2008 .

[54]  George L. Nemhauser,et al.  Handbooks in operations research and management science , 1989 .

[55]  Amelia C. Regan,et al.  Local truckload pickup and delivery with hard time window constraints , 2002 .

[56]  Sophie N. Parragh,et al.  A survey on pickup and delivery models Part II : Transportation between pickup and delivery locations , 2007 .