Value of Its Information for Congestion Avoidance in Inter-Modal Transportation Systems: Phase II, Final Report, March 2010

This Year 2 Final Report focuses on infrastructure utilization in the study of intelligent transportation system (ITS) information for congestion avoidance in intermodal transportation systems. In this report, intermodal freight refers to the shipment of freight involving more than one mode of transportation (road, rail, air, and sea) during a single, seamless journey. In Section A the authors propose a modeling and solution framework for the dynamic air cargo routing on air networks subject to stochastic flight departure delays. After developing a stylized experimental setup, they illustrate the effect of various network factors on the dynamic routing efficiency. In addition, they present a case study using the real data for a dynamic air cargo routing originating from the Cleveland Hopkins International Airport (CLE) and destined to the Seattle-Tacoma International Airport (SEA). In section B, the authors extend their approach in Section A to the integrated dynamic routing on the air-road intermodal network. In addition to routing on the air network, they also make alternative access airport selection and dynamic routing decisions on the road network. They illustrate the approach via a case study for a cargo originating from the regions of southeast Michigan and northern Ohio. They consider three main commercial airports in this region: Detroit Metropolitan Wayne County Airport (DTW), Toledo Express Airport (TOL) and Cleveland-Hopkins International Airport (CLE). They determine an alternative access airport for the cargo under various scenarios. In section C, the authors consider the operational response model of an automotive manufacturer faced with a delay in shipments of a component. They consider the case where the manufacturer allocates scarce component inventory among different product lines such that the impact of shipment delay is minimized. They illustrate the modeling and solution methods in a stylized example from a major OEM.

[1]  Gilbert Laporte,et al.  Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints , 1991, Oper. Res. Lett..

[2]  Xiaohong Guan,et al.  Unit Commitment with Identical Units: Successive Subproblem Solving Method Based on Lagrangian Relaxation , 2002, IEEE Power Engineering Review.

[3]  Randolph W. Hall,et al.  Freight Routing and Containerization in a Package Network that Accounts for Sortation Constraints and Costs , 2004 .

[4]  George Chryssolouris,et al.  Flexibility and Its Measurement , 1996 .

[5]  Chryssi Malandraki,et al.  A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem , 1996 .

[6]  Jozef Kratica,et al.  Solving the simple plant location problem by genetic algorithm , 2001, RAIRO Oper. Res..

[7]  Sophie Pochard.  Managing risks of supply-chain disruptions : dual sourcing as a real option , 2003 .

[8]  Nils J. Nilsson,et al.  Problem-solving methods in artificial intelligence , 1971, McGraw-Hill computer science series.

[9]  Eugene L. Lawler,et al.  Traveling Salesman Problem , 2016 .

[10]  Antonio J. Conejo,et al.  Decomposition Techniques in Mathematical Programming: Engineering and Science Applications , 2006 .

[11]  Zuo-Jun Max Shen,et al.  The Reliable Facility Location Problem: Formulations, Heuristics, and Approximation Algorithms , 2011, INFORMS J. Comput..

[12]  Haruki Matsuura,et al.  Component part commonality and process flexibility effects on manufacturing performance , 1994 .

[13]  J. M. Vleugel,et al.  Route choice and the impact of ‘logistic routes’ , 2004 .

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

[15]  Maged Dessouky,et al.  A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows , 2004 .

[16]  Dinakar Gade.  Capacitated facilities location problems with unreliable facilities , 2007 .

[17]  A. Kurtoglu.  Flexibility analysis of two assembly lines , 2004 .

[18]  A. Shapiro,et al.  The Sample Average Approximation Method for Stochastic Programs with Integer Recourse , 2002 .

[19]  Jean-François Cordeau,et al.  VRP with Time Windows , 1999, The Vehicle Routing Problem.

[20]  William C. Jordan,et al.  Principles on the benefits of manufacturing process flexibility , 1995 .

[21]  Gerhard Reinelt,et al.  The travelling salesman problem , 1995 .

[22]  Amelia C. Regan,et al.  TRAFFIC CONGESTION AND TRUCKING MANAGERS' USE OF AUTOMATED ROUTING AND SCHEDULING , 2003 .

[23]  Shabbir Ahmed,et al.  Supply chain design under uncertainty using sample average approximation and dual decomposition , 2009, Eur. J. Oper. Res..

[24]  John Douglas Hunt,et al.  Tour-based microsimulation of urban commercial movements , 2007 .

[25]  Nigel Slack,et al.  The Flexibility of Manufacturing Systems , 1987 .

[26]  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..

[27]  Rajeev Motwani,et al.  Approximating Capacitated Routing and Delivery Problems , 1999, SIAM J. Comput..

[28]  Michael J. Fry,et al.  Route Design for Lean Production Systems , 2008, Transp. Sci..

[29]  Alexander Shapiro,et al.  The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study , 2003, Comput. Optim. Appl..

[30]  Petros A. Ioannou,et al.  Truck route planning in nonstationary stochastic networks with time windows at customer locations , 2006, IEEE Transactions on Intelligent Transportation Systems.

[31]  Gilbert Laporte,et al.  The vehicle routing problem: An overview of exact and approximate algorithms , 1992 .

[32]  Marc Goetschalckx,et al.  A stochastic programming approach for supply chain network design under uncertainty , 2004, Eur. J. Oper. Res..

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

[34]  Joseph Geunes,et al.  Requirements Planning with Substitutions: Exploiting Bill-of-Materials Flexibility in Production Planning , 2000, Manuf. Serv. Oper. Manag..

[35]  Brian Tomlin,et al.  On the Value of Mitigation and Contingency Strategies for Managing Supply Chain Disruption Risks , 2006, Manag. Sci..

[36]  Pravin Varaiya,et al.  Travel-Time Reliability as a Measure of Service , 2003 .

[37]  Gerhard Reinelt,et al.  Traveling salesman problem , 2012 .

[38]  Germaine H. Saad,et al.  Managing Disruption Risks in Supply Chains , 2005 .

[39]  David Pisinger,et al.  An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows , 2006, Transp. Sci..

[40]  Alexander Shapiro,et al.  The empirical behavior of sampling methods for stochastic programming , 2006, Ann. Oper. Res..

[41]  Gilbert Laporte,et al.  Static pickup and delivery problems: a classification scheme and survey , 2007 .

[42]  M. Christopher,et al.  Building the Resilient Supply Chain , 2004 .

[43]  Diwakar Gupta,et al.  A “goodness test” for operational measures of manufacturing flexibility , 1996 .

[44]  Basheer M. Khumawala,et al.  An empirical comparison of tabu search, simulated annealing, and genetic algorithms for facilities location problems , 1997 .

[45]  J. C. Chen,et al.  A resource portfolio planning model using sampling-based stochastic programming and genetic algorithm , 2008, Eur. J. Oper. Res..

[46]  Andrew Lim,et al.  Reliable logistics networks design with facility disruptions , 2011 .

[47]  Andreas Norrman,et al.  Ericsson’s Proactive Supply Chain Risk Management-approach After a Serious Supplier Accident , 2004 .

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

[49]  Gilbert Laporte,et al.  The Vehicle Routing Problem with Stochastic Travel Times , 1992, Transp. Sci..

[50]  Roger Lezhou Zhan,et al.  Models and algorithms for reliable facility location problems and system reliability optimization , 2007 .

[51]  Alexander Shapiro,et al.  The Sample Average Approximation Method for Stochastic Discrete Optimization , 2002, SIAM J. Optim..

[52]  Alexander Shapiro,et al.  A simulation-based approach to two-stage stochastic programming with recourse , 1998, Math. Program..

[53]  Ben J. A. Kröse,et al.  Efficient Greedy Learning of Gaussian Mixture Models , 2003, Neural Computation.

[54]  Chandra R. Bhat,et al.  A parameterized consideration set model for airport choice: an application to the San Francisco Bay Area , 2004 .

[55]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control, Two Volume Set , 1995 .

[56]  Explore Configuring,et al.  A Simulation Study to , 2004 .

[57]  A. Bagchi,et al.  Three approaches to heuristic search in networks , 1985, JACM.

[58]  Stephan M. Wagner,et al.  An empirical investigation into supply chain vulnerability , 2006 .

[59]  Shoshana Anily,et al.  Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries , 1999 .

[60]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[61]  Russell C. Eberhart,et al.  A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[62]  Mark S. Daskin,et al.  Planning for Disruptions in Supply Chain Networks , 2006 .

[63]  Robert J. Vokurka,et al.  A review of empirical research on manufacturing flexibility , 2000 .

[64]  Lawrence V. Snyder,et al.  Supply Chain Management under the Threat of Disruptions , 2006 .

[65]  Jwm Will Bertrand,et al.  Supply Chain Design: Flexibility Considerations , 2003, Supply Chain Management.

[66]  R W Hall.  ALTERNATIVE ACCESS AND LOCATIONS FOR AIR CARGO , 2002 .

[67]  Gilbert Laporte,et al.  Designing collection routes through bank branches , 1991, Comput. Oper. Res..

[68]  Yue Shi,et al.  A modified particle swarm optimizer , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[69]  Michel Gendreau,et al.  Vehicle dispatching with time-dependent travel times , 2003, Eur. J. Oper. Res..

[70]  Daniele Vigo,et al.  Heuristics for the traveling salesman problem with pickup and delivery , 1999, Comput. Oper. Res..

[71]  Harry Groenevelt,et al.  Chapter 12 The just-in-time system , 1993, Logistics of Production and Inventory.

[72]  Lawrence V. Snyder,et al.  Reliability Models for Facility Location: The Expected Failure Cost Case , 2005, Transp. Sci..

[73]  Wei Tsang Ooi,et al.  A stochastic dynamic traveling salesman problem with hard time windows , 2009, Eur. J. Oper. Res..

[74]  B. Loo.  Passengers’ airport choice within multi-airport regions (MARs): some insights from a stated preference survey at Hong Kong International Airport , 2008 .

[75]  Daoud Ait-Kadi,et al.  A stochastic programming approach for designing supply loops , 2008 .

[76]  David S. Johnson,et al.  The Traveling Salesman Problem: A Case Study in Local Optimization , 2008 .

[77]  R. Wets,et al.  L-SHAPED LINEAR PROGRAMS WITH APPLICATIONS TO OPTIMAL CONTROL AND STOCHASTIC PROGRAMMING. , 1969 .

[78]  Chelsea C. White,et al.  Optimal vehicle routing with real-time traffic information , 2005, IEEE Transactions on Intelligent Transportation Systems.

[79]  John N. Tsitsiklis,et al.  Dynamic Shortest Paths in Acyclic Networks with Markovian Arc Costs , 1993, Oper. Res..

[80]  José Holguín-Veras,et al.  Observed Trip Chain Behavior of Commercial Vehicles , 2005 .

[81]  Chelsea C. White,et al.  State space reduction for nonstationary stochastic shortest path problems with real-time traffic information , 2005, IEEE Transactions on Intelligent Transportation Systems.