Network Learning via Multiagent Inverse Transportation Problems

References

• Agarwal R, Ergun Ö (2008) Mechanism design for a multicommodity flow game in service network alliances. Oper. Res. Lett. 36(5):520–524.Crossref, Google Scholar
• Ahuja RK, Orlin JB (2001) Inverse optimization. Oper. Res. 49(5):771–783.Link, Google Scholar
• Ahuja RK, Magnanti TL, Orlin JB (1993) Network Flows: Theory, Algorithms, and Applications (Prentice-Hall, Upper Saddle River, NJ).Google Scholar
• Airoldi EM, Blocker AW (2013) Estimating latent processes on a network from indirect measurements. J. Amer. Statist. Assoc. 108(501):149–164.Crossref, Google Scholar
• Akamatsu T (1996) Cyclic flows, Markov process and stochastic traffic assignment. Transportation Res. Part B 30(5):369–386.Crossref, Google Scholar
• Alexander L, Jiang S, Murga M, González MC (2015) Origin–destination trips by purpose and time of day inferred from mobile phone data. Transportation Res. Part C 58:240–250.Crossref, Google Scholar
• Ashok K, Ben-Akiva ME (2002) Estimation and prediction of time-dependent origin-destination flows with a stochastic mapping to path flows and link flows. Transportation Sci. 36(2):184–198.Link, Google Scholar
• Aswani A, Shen ZJM, Siddiq A (2015) Inverse optimization with noisy data. Working paper, University of California Berkeley, arXiv preprint arXiv:1507.03266.Google Scholar
• Baillon JB, Cominetti R (2008) Markovian traffic equilibrium. Math. Programming 111(1–2):33–56.Crossref, Google Scholar
• Bell MG (1991) The estimation of origin-destination matrices by constrained generalised least squares. Transportation Res. Part B 25(1):13–22.Crossref, Google Scholar
• Ben-Elia E, Shiftan Y (2010) Which road do I take? A learning-based model of route-choice behavior with real-time information. Transportation Res. Part A 44(4):249–264.Google Scholar
• Bertsimas D, Gupta V, Paschalidis IC (2012) Inverse optimization: A new perspective on the Black–Litterman model. Oper. Res. 60(6):1389–1403.Link, Google Scholar
• Bertsimas D, Gupta V, Paschalidis IC (2015) Data-driven estimation in equilibrium using inverse optimization. Math. Programming 153(2):595–633.Crossref, Google Scholar
• Birge JR, Hortaçsu A, Pavlin JM (2017) Inverse optimization for the recovery of market structure from market outcomes: An application to the MISO electricity market. Oper. Res. 65(4):837–855.Link, Google Scholar
• Brucker P, Shakhlevich NV (2009) Inverse scheduling with maximum lateness objective. J. Scheduling 12(5):475–488.Crossref, Google Scholar
• Burkard RE, Pleschiutschnig C, Zhang J (2004) Inverse median problems. Discrete Optim. 1(1):23–39.Crossref, Google Scholar
• Burton D, Toint PL (1992) On an instance of the inverse shortest paths problem. Math. Programming 53(1–3):45–61.Crossref, Google Scholar
• Cascetta E, Nuzzolo A, Russo F, Vitetta A (1996) A modified logit route choice model overcoming path overlapping problems: Specification and some calibration results for interurban networks. Lesort JB, ed. Proc. 13th Internat. Symposium Transportation Traffic Theory (Pergamon, Lyon, France), 697–711.Google Scholar
• Chow JYJ, Djavadian S (2015) Activity-based market equilibrium for capacitated multimodal transport systems. Transportation Res. Part C 59:2–18.Crossref, Google Scholar
• Chow JYJ, Recker WW (2012) Inverse optimization with endogenous arrival time constraints to calibrate the household activity pattern problem. Transportation Res. Part B 46(3):463–479.Crossref, Google Scholar
• Chow JYJ, Ritchie SG, Jeong K (2014) Nonlinear inverse optimization for parameter estimation of commodity-vehicle-decoupled freight assignment. Transportation Res. Part E 67:71–91.Crossref, Google Scholar
• Daganzo CF, Sheffi Y (1977) On stochastic models of traffic assignment. Transportation Sci. 11(3):253–274.Link, Google Scholar
• Day J, Nemhauser GL, Sokol JS (2002) Management of railroad impedances for shortest path-based routing. Electronic Notes Theoret. Comput. Sci. 66(6):53–65.Crossref, Google Scholar
• Dia H (2002) An agent-based approach to modelling driver route choice behaviour under the influence of real-time information. Transportation Res. Part C 10(5):331–349.Crossref, Google Scholar
• Esfahani PM, Shafieezadeh-Abadeh S, Hanasusanto GA, Kuhn D (2015) Data-driven inverse optimization with incomplete information. Working paper, École polytechnique fédérale de Lausanne, Lausanne, Switzerland, arXiv preprint arXiv:1512.05489.Google Scholar
• Feinberg Y (2000) Characterizing common priors in the form of posteriors. Econom. Theory 91(2):127–179.Crossref, Google Scholar
• Fosgerau M, Frejinger E, Karlstrom A (2013) A link based network route choice model with unrestricted choice set. Transportation Res. Part B 56:70–80.Crossref, Google Scholar
• Frejinger E, Bierlaire M (2007) Capturing correlation with subnetworks in route choice models. Transportation Res. Part B 41(3):363–378.Crossref, Google Scholar
• Gao S (2012) Modeling strategic route choice and real-time information impacts in stochastic and time-dependent networks. IEEE Trans. Intelligent Transportation Systems 13(3):1298–1311.Crossref, Google Scholar
• Güler Ç, Hamacher HW (2010) Capacity inverse minimum cost flow problem. J. Combinatorial Optim. 19(1):43–59.Crossref, Google Scholar
• Guo QW, Chow JYJ, Schonfeld P (2017) Stochastic dynamic switching in fixed and flexible transit services as market entry-exit real options. Transportation Res. Procedia 23:380–399.Crossref, Google Scholar
• Hazelton ML (2015) Network tomography for integer-valued traffic. Ann. Appl. Statist. 9(1):474–506.Crossref, Google Scholar
• Herrera JC, Work DB, Herring R, Ban XJ, Jacobson Q, Bayen AM (2010) Evaluation of traffic data obtained via GPS-enabled mobile phones: The Mobile Century field experiment. Transportation Res. Part C 18(4):568–583.Crossref, Google Scholar
• Heuberger C (2004) Inverse combinatorial optimization: A survey on problems, methods, and results. J. Combinatorial Optim. 8(3):329–361.Crossref, Google Scholar
• Hong SP, Kim KM, Byeon G, Min YH (2017) A method to directly derive taste heterogeneity of travellers’ route choice in public transport from observed routes. Transportation Res. Part B 95:41–52.Crossref, Google Scholar
• Munizaga MA, Palma C (2012) Estimation of a disaggregate multimodal public transport origin–destination matrix from passive smartcard data from Santiago, Chile. Transportation Res. Part C 24:9–18.Crossref, Google Scholar
• Nguyen S, Dupuis C (1984) An efficient method for computing traffic equilibria in networks with asymmetric transportation costs. Transportation Sci. 18(2):185–202.Link, Google Scholar
• Prato CG (2009) Route choice modeling: Past, present and future research directions. J. Choice Modelling 2(1):65–100.Crossref, Google Scholar
• Recker WW (1995) The household activity pattern problem: General formulation and solution. Transportation Res. Part B 29(1):61–77.Crossref, Google Scholar
• Ryzhov IO, Powell WB (2011) Information collection on a graph. Oper. Res. 59(1):188–201.Link, Google Scholar
• Srinivasan K, Mahmassani HS (2000) Modeling inertia and compliance mechanisms in route choice behavior under real-time information. Transportation Res. Record 1725:45–53.Crossref, Google Scholar
• Tang J, Liu F, Wang Y, Wang H (2015) Uncovering urban human mobility from large scale taxi GPS data. Physica A: Statist. Mechanics Appl. 438:140–153.Crossref, Google Scholar
• Tarantola A (2005) Inverse Problem Theory and Methods for Model Parameter Estimation (SIAM, Philadelphia).Crossref, Google Scholar
• Tebaldi C, West M (1998) Bayesian inference on network traffic using link count data. J. Amer. Statist. Assoc. 93(442):557–573.Crossref, Google Scholar
• Van Zuylen HJ, Willumsen LG (1980) The most likely trip matrix estimated from traffic counts. Transportation Res. Part B 14(3):281–293.Crossref, Google Scholar
• Vardi Y (1996) Network tomography: Estimating source-destination traffic intensities from link data. J. Amer. Statist. Assoc. 91(433):365–377.Crossref, Google Scholar
• Vovsha P, Bekhor S (1998) Link-nested logit model of route choice: Overcoming route overlapping problem. Transportation Res. Record 1645:133–142.Crossref, Google Scholar
• Wang L (2009) Cutting plane algorithms for the inverse mixed integer linear programming problem. Oper. Res. Lett. 37(2):114–116.Crossref, Google Scholar
• Watling DP, Rasmussen TK, Prato CG, Nielsen OA (2015) Stochastic user equilibrium with equilibrated choice sets: Part I–Model formulations under alternative distributions and restrictions. Transportation Res. Part B 77:166–181.Crossref, Google Scholar
• Williams S, White A, Waiganjo P, Orwa D, Klopp J (2015) The Digital Matatu project: Using cell phones to create an open source data for Nairobi’s semi-formal bus system. J. Transport Geography 49:39–51.Crossref, Google Scholar
• Yang H, Sasaki T, Iida Y, Asakura Y (1992) Estimation of origin-destination matrices from link traffic counts on congested networks. Transportation Res. Part B 26(6):417–434.Crossref, Google Scholar
• You SI, Chow JYJ, Ritchie SG (2016) Inverse vehicle routing for activity-based urban freight forecast modeling and city logistics. Transportmetrica A 12(7):650–673.Crossref, Google Scholar
• Zhan X, Hasan S, Ukkusuri SV, Kamga C (2013) Urban link travel time estimation using large-scale taxi data with partial information. Transportation Res. Part C 33:37–49.Crossref, Google Scholar
• Zhang J, Zhang L (2010) An augmented Lagrangian method for a class of inverse quadratic programming problems. Appl. Math. Optim. 61(1):57–83.Crossref, Google Scholar