On activity-based network design problems

This paper examines network design where OD demand is not known a priori, but is the subject of responses in household or user itinerary choices to infrastructure improvements. Using simple examples, we show that falsely assuming that household itineraries are not elastic can result in a lack in understanding of certain phenomena; e.g., increasing traffic even without increasing economic activity due to relaxing of space–time prism constraints, or worsening of utility despite infrastructure investments in cases where household objectives may conflict. An activity-based network design problem is proposed using the location routing problem (LRP) as inspiration. The bilevel formulation includes an upper level network design and shortest path problem while the lower level includes a set of disaggregate household itinerary optimization problems, posed as household activity pattern problem (HAPP) (or in the case with location choice, as generalized HAPP) models. As a bilevel problem with an NP-hard lower level problem, there is no algorithm for solving the model exactly. Simple numerical examples show optimality gaps of as much as 5% for a decomposition heuristic algorithm derived from the LRP. A large numerical case study based on Southern California data and setting suggest that even if infrastructure investments do not result in major changes in link investment decisions compared to a conventional model, the results provide much higher resolution temporal OD information to a decision maker. Whereas a conventional model would output the best set of links to invest given an assumed OD matrix, the proposed model can output the same best set of links, the same daily OD matrix, and a detailed temporal distribution of activity participation and travel from which changes in peak period OD patterns can be observed.

[1]  Chinyao Low,et al.  Heuristic solutions to multi-depot location-routing problems , 2002, Comput. Oper. Res..

[2]  Wilfred W. Recker,et al.  A Bridge between Travel Demand Modeling and Activity-Based Travel Analysis , 2000 .

[3]  Gilbert Laporte,et al.  The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithms , 2003, 4OR.

[4]  Shing Chung Josh Wong,et al.  A stochastic transit assignment model using a dynamic schedule-based network , 1999 .

[5]  Christian Prins,et al.  A Metaheuristic to Solve a Location-Routing Problem with Non-Linear Costs , 2005, J. Heuristics.

[6]  H. Lo,et al.  Global optimization method for mixed transportation network design problem: A mixed-integer linear programming approach , 2011 .

[7]  Chandra R. Bhat,et al.  Activity-based Travel Demand Analysis , 2011 .

[8]  Siriphong Lawphongpanich,et al.  Schedule-based transit assignment model with travel strategies and capacity constraints , 2008 .

[9]  Thomas L. Magnanti,et al.  Network Design and Transportation Planning: Models and Algorithms , 1984, Transp. Sci..

[10]  Karthik Charan Konduri,et al.  Integrated Model of the Urban Continuum with Dynamic Time-dependent Activity-Travel Microsimulation: Framework, Prototype, and Implementation , 2012 .

[11]  Saïd Salhi,et al.  Location-routing: Issues, models and methods , 2007, Eur. J. Oper. Res..

[12]  Jee Eun Kang,et al.  The location selection problem for the household activity pattern problem , 2013 .

[13]  Pierre Dejax,et al.  Dynamic Location-routeing Problems , 1989 .

[14]  Joseph Y. J. Chow,et al.  Inverse optimization with endogenous arrival time constraints to calibrate the household activity pattern problem , 2012 .

[15]  Wilfred W. Recker,et al.  The Household Activity Pattern Problem: General Formulation and Solution , 1995 .

[16]  A. M. Geoffrion,et al.  Multicommodity Distribution System Design by Benders Decomposition , 1974 .

[17]  Gilbert Laporte,et al.  The Dial-a-Ride Problem: Variants, Modeling Issues and Algorithms , 2002 .

[18]  Kay W. Axhausen,et al.  Agent-Based Demand-Modeling Framework for Large-Scale Microsimulations , 2006 .

[19]  Hai Yang,et al.  Global optimization methods for the discrete network design problem , 2013 .

[20]  William H. K. Lam,et al.  A network equilibrium approach for modelling activity-travel pattern scheduling problems in multi-modal transit networks with uncertainty , 2013, Transportation.

[21]  H. Wang,et al.  Development of an Estimation Procedure for an Activity‐Based Travel Demand Model , 2008, Comput. Aided Civ. Infrastructure Eng..

[22]  William H. K. Lam,et al.  An activity-based time-dependent traffic assignment model , 2001 .

[23]  Chandra R. Bhat,et al.  Comprehensive Econometric Microsimulator for Daily Activity-Travel Patterns , 2004 .

[24]  Athanasios K. Ziliaskopoulos,et al.  Stochastic Dynamic Network Design Problem , 2001 .

[25]  Siriphong Lawphongpanich,et al.  Congestion Pricing for Schedule-Based Transit Networks , 2010, Transp. Sci..

[26]  Teodor Gabriel Crainic,et al.  Service network design in freight transportation , 2000, Eur. J. Oper. Res..

[27]  Hokey Min,et al.  Combined location-routing problems: A synthesis and future research directions , 1998, Eur. J. Oper. Res..

[28]  P.H.L. Bovy,et al.  Dynamic road pricing for optimizing network performance with heterogeneous users , 2005, Proceedings. 2005 IEEE Networking, Sensing and Control, 2005..

[29]  Michael A. P. Taylor TRANSPORTATION AND TRAFFIC THEORY IN THE 21ST CENTURY: PROCEEDINGS OF THE 15TH INTERNATIONAL SYMPOSIUM ON TRANSPORTATION AND TRAFFIC THEORY, ADELAIDE, AUSTRALIA, 16-18 JULY 2002 , 2002 .

[30]  Wilfred W. Recker,et al.  Development of a microscopic activity-based framework for analyzing the potential impacts of transportation control measures on vehicle emissions , 1999 .

[31]  T. Arentze,et al.  Multistate supernetwork approach to modelling multi-activity, multimodal trip chains , 2004, Int. J. Geogr. Inf. Sci..

[32]  Thomas L. Magnanti,et al.  Tailoring Benders decomposition for uncapacitated network design , 1986 .

[33]  Pierre Dejax,et al.  DYNAMIC LOCATION-ROUTING PROBLEMS , 1988 .

[34]  Joseph Y. J. Chow Activity‐Based Travel Scenario Analysis with Routing Problem Reoptimization , 2014, Comput. Aided Civ. Infrastructure Eng..

[35]  S. C. Liu,et al.  A two-phase heuristic method for the multi-depot location routing problem taking inventory control decisions into consideration , 2003 .

[36]  Matteo Fischetti,et al.  A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem , 1997, Oper. Res..

[37]  Satish V. Ukkusuri,et al.  Linear Programming Models for the User and System Optimal Dynamic Network Design Problem: Formulations, Comparisons and Extensions , 2008 .

[38]  Wilfred W. Recker,et al.  A mathematical programming formulation of the household activity rescheduling problem , 2008 .

[39]  Mark S. Daskin,et al.  A warehouse location-routing problem , 1985 .

[40]  Hang Liu,et al.  Generalized Profitable Tour Problems for Online Activity Routing System , 2012 .

[41]  Gianpaolo Ghiani,et al.  An efficient transformation of the generalized vehicle routing problem , 2000, Eur. J. Oper. Res..

[42]  Dung-Ying Lin,et al.  Integration of Activity-Based Modeling and Dynamic Traffic Assignment , 2008 .

[43]  Shing Chung Josh Wong,et al.  A dynamic schedule-based model for congested transit networks , 2004 .

[44]  Moshe Ben-Akiva,et al.  PII: S0965-8564(99)00043-9 , 2000 .

[45]  B. Heydecker Dynamic Equilibrium Network Design , 2002 .

[46]  Hai Yang,et al.  Models and algorithms for road network design: a review and some new developments , 1998 .

[47]  Patrick T. Harker,et al.  Properties of the iterative optimization-equilibrium algorithm , 1985 .