Abstract
The next section shows not only how a heuristic approach can be employed to solve hard problems but also how an investigation of the mathematical model can lead to a simpler solution technique.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Fisk C (1980) Some developments in equilibrium traffic assignment. Transp Res Part B Methodol 14(3):243–256
Horowitz J (1984) The stability of stochastic equilibrium in a two link transportation network. Transp Res Part B Methodol 18(1):13–28
Hartman J (2009) Special issue on transport infrastructure: a route choice experiment with an efficient toll, networks and spatial economics. Accessible at: http://www.springerlink.com/content/3721172289268710/fulltext.pdf
Roughgarden T (2005) Selfish routing and the price of anarchy. MIT Press, London
Youn H, Jeong H, Gastner M (2009) The price of anarchy in transportation networks: efficiency and optimality control. Phys Rev Lett 101 (19 Sept 2009)
Skinner, Carlin (2013) The price of anarchy. Significance
Braess D, Nagurney A, Wakolbinger (2005) On a paradox of transport planning (a translation of the 1968 article). Transp Sci 39(4):446–450
Steinberg R, Zangwill W (1983) The prevalence of Braess’ paradox. Transp Sci 17(3):301–318
Dafermos SC, Nagurney A (1984) On some traffic equilibrium theory paradoxes Transp Res Ser B 18(2):101–110
Catoni S, Pallottino S (1991) Traffic equilibrium paradoxes. Transp Sci 25(3):240–244
Pas E, Principio S (1997) Braess’ paradox: some new insights. Transp Res B 31(3):265–276
Abrams R, Hagstrom J (2006) Improving traffic flows at no cost. In: Lawphongpanich S, Hearn D, Smith M (eds) Mathematical and computational models for congestion changing. Springer, New York
Mogoridge M (1997) The self-defeating nature of urban road capacity policy. Transp Policy 4(1):5–23
Arnott R, Small K (1994) The economics of traffic congestion. Am Sci 82:446–455
Stanley RP (2012) Enumerative combinatorics, vol 1 (2nd ed.). Cambridge Studies in Advanced Mathematics, 49, Cambridge University Press, Cambridge
The On-Line Encyclopedia of Integer Sequences (2011) https://oeis.org. OEIS Foundation Inc
Bellman R (1957) Dynamic programming. Princeton University Press, Princeton
Bazaraa MS, Sherali HD & Shetti CM (2006) Non linear programming. Wiley, New York
Rockafellar RT (1970) Convex analysis. Princeton Mathematical Series 28, Princeton University Press, Princeton
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this chapter
Cite this chapter
Lowndes, V., Berry, S., Parkes, C., Bagdasar, O., Popovici, N. (2017). Further Use of Heuristic Methods. In: Berry, S., Lowndes, V., Trovati, M. (eds) Guide to Computational Modelling for Decision Processes. Simulation Foundations, Methods and Applications. Springer, Cham. https://doi.org/10.1007/978-3-319-55417-4_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-55417-4_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-55416-7
Online ISBN: 978-3-319-55417-4
eBook Packages: Computer ScienceComputer Science (R0)