Non-additive shortest path in the context of traffic assignment
暂无分享,去创建一个
[1] Hillel Bar-Gera,et al. Origin-Based Algorithm for the Traffic Assignment Problem , 2002, Transp. Sci..
[2] Christos D. Zaroliagis,et al. Non-additive Shortest Paths , 2004, ESA.
[3] Leo Liberti,et al. Shortest paths on dynamic graphs , 2008, Int. Trans. Oper. Res..
[4] F. Leurent. Cost versus time equilibrium over a network , 1993 .
[5] Hong Kam Lo,et al. Reformulating the traffic equilibrium problem via a smooth gap function , 2000 .
[6] David Pisinger,et al. Multi-objective and multi-constrained non-additive shortest path problems , 2011, Comput. Oper. Res..
[7] Michael Patriksson,et al. The Traffic Assignment Problem: Models and Methods , 2015 .
[8] Matthias Ehrgott,et al. A comparison of solution strategies for biobjective shortest path problems , 2009, Comput. Oper. Res..
[9] Hong Kam Lo,et al. Traffic equilibrium problem with route-specific costs: formulation and algorithms , 2000 .
[10] C. Winston,et al. The value of automobile travel time: implications for congestion policy , 1998 .
[11] Stefano Giordano,et al. A survey on multi-constrained optimal path computation: Exact and approximate algorithms , 2010, Comput. Networks.
[12] Babak Javani,et al. Origin-destination-based truncated quadratic programming algorithm for traffic assignment problem , 2017 .
[13] George L. Nemhauser,et al. A Column Generation Algorithm for Optimal Traffic Assignment , 1973 .
[14] David A. Hensher,et al. VALUATION OF TRAVEL TIME SAVINGS. A DIRECT EXPERIMENTAL APPROACH , 1985 .
[15] Hai Yang,et al. A self-adaptive projection and contraction algorithm for the traffic assignment problem with path-specific costs , 2001, Eur. J. Oper. Res..
[16] E. Martins,et al. A bicriterion shortest path algorithm , 1982 .
[17] Torbjörn Larsson,et al. On traffic equilibrium models with a nonlinear time/money relation , 2002 .
[18] Yosef Sheffi,et al. Urban Transportation Networks: Equilibrium Analysis With Mathematical Programming Methods , 1985 .
[19] Robert B. Dial,et al. A path-based user-equilibrium traffic assignment algorithm that obviates path storage and enumeration , 2006 .
[20] Yann Disser,et al. Multi-criteria Shortest Paths in Time-Dependent Train Networks , 2008, WEA.
[21] Kenneth A. Small,et al. The Value of Time and Reliability: Measurement from a Value Pricing Experiment , 2001 .
[22] Lawrence Mandow,et al. Multiobjective heuristic search in road maps , 2012, Expert Syst. Appl..
[23] Matthias Müller-Hannemann,et al. Finding All Attractive Train Connections by Multi-criteria Pareto Search , 2004, ATMOS.
[24] Kim Allan Andersen,et al. A label correcting approach for solving bicriterion shortest-path problems , 2000, Comput. Oper. Res..
[25] R Jayakrishnan,et al. A PATH-BASED GRADIENT PROJECTION ALGORITHM: EFFECTS OF EQUILIBRATION WITH A RESTRICTED PATH SET UNDER TWO FLOW UPDATE POLICIES , 1998 .
[26] Dorothea Wagner,et al. Pareto Paths with SHARC , 2009, SEA.
[27] Dongjoo Park,et al. Solving the bicriteria traffic equilibrium problem with variable demand and nonlinear path costs , 2010, Appl. Math. Comput..
[28] Horst W. Hamacher,et al. Algorithms for time-dependent bicriteria shortest path problems , 2006, Discret. Optim..
[29] Mohamed Abdel-Aty,et al. INVESTIGATING EFFECT OF TRAVEL TIME VARIABILITY ON ROUTE CHOICE USING REPEATED-MEASUREMENT STATED PREFERENCE DATA , 1995 .
[30] Christos D. Zaroliagis,et al. Efficient models for timetable information in public transportation systems , 2008, JEAL.
[31] Lawrence Mandow,et al. A comparison of heuristic best-first algorithms for bicriterion shortest path problems , 2012, Eur. J. Oper. Res..
[32] Piet Demeester,et al. Speeding up Martins’ algorithm for multiple objective shortest path problems , 2013, 4OR.
[33] Xiangdong Xu,et al. A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem , 2012, Comput. Oper. Res..
[34] A. R Warburton. Bicriterion shortest path problems , 1984 .
[35] Manuel Iori,et al. An aggregate label setting policy for the multi-objective shortest path problem , 2010, Eur. J. Oper. Res..
[36] C. T. Tung,et al. A multicriteria Pareto-optimal path algorithm , 1992 .
[37] Deren Han,et al. Solving non-additive traffic assignment problems: A descent method for co-coercive variational inequalities , 2004, Eur. J. Oper. Res..
[38] Ziyou Gao,et al. A semismooth Newton method for traffic equilibrium problem with a general nonadditive route cost , 2011 .
[39] Howard Slavin,et al. An empirical comparison of alternative user equilibrium traffic assignment methods , 2006 .
[40] Xavier Gandibleux,et al. A survey and annotated bibliography of multiobjective combinatorial optimization , 2000, OR Spectr..
[41] Reza Mortazavi,et al. ANOMALIES IN THE VALUE OF TRAVEL-TIME CHANGES , 2001 .
[42] Matthias Ehrgott,et al. A framework for and empirical study of algorithms for traffic assignment , 2015, Comput. Oper. Res..
[43] Stefan Funke,et al. Polynomial-Time Construction of Contraction Hierarchies for Multi-Criteria Objectives , 2013, SOCS.
[44] Anthony Chen,et al. A self-adaptive Armijo stepsize strategy with application to traffic assignment models and algorithms , 2013 .
[45] Henk Taale,et al. Better Convergence for Dynamic Traffic Assignment Methods , 2015 .
[46] Changhyun Kwon,et al. dynamic traffic assignment , 2010 .
[47] P. Mirchandani,et al. Routing with nonlinear multiattribute cost functions , 1993 .