IDEAS home Printed from https://ideas.repec.org/a/spr/topjnl/v5y1997i1p1-40.html
   My bibliography  Save this article

A survey of some mathematical programming models in transportation

Author

Listed:
  • Jaume Barceló

Abstract

No abstract is available for this item.

Suggested Citation

  • Jaume Barceló, 1997. "A survey of some mathematical programming models in transportation," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 5(1), pages 1-40, June.
    • Handle: RePEc:spr:topjnl:v:5:y:1997:i:1:p:1-40
    DOI: 10.1007/BF02568528
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/BF02568528
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/BF02568528?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Snickars, Folke & Weibull, Jorgen W., 1977. "A minimum information principle : Theory and practice," Regional Science and Urban Economics, Elsevier, vol. 7(1-2), pages 137-168, March.
    2. Michael Florian & Sang Nguyen, 1976. "An Application and Validation of Equilibrium Trip Assignment Methods," Transportation Science, INFORMS, vol. 10(4), pages 374-390, November.
    3. L. Montero & J. Barceló, 1996. "A simplicial decomposition algorithm for solving the variational inequality formulation of the general traffic assignment problem for large scale networks," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 4(2), pages 225-256, December.
    4. Fisk, C. S., 1988. "On combining maximum entropy trip matrix estimation with user optimal assignment," Transportation Research Part B: Methodological, Elsevier, vol. 22(1), pages 69-73, February.
    5. Stella Dafermos, 1980. "Traffic Equilibrium and Variational Inequalities," Transportation Science, INFORMS, vol. 14(1), pages 42-54, February.
    6. Marguerite Frank & Philip Wolfe, 1956. "An algorithm for quadratic programming," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 3(1‐2), pages 95-110, March.
    7. Yang, Hai & Sasaki, Tsuna & Iida, Yasunori & Asakura, Yasuo, 1992. "Estimation of origin-destination matrices from link traffic counts on congested networks," Transportation Research Part B: Methodological, Elsevier, vol. 26(6), pages 417-434, December.
    8. van Zuylen, Henk J. & Branston, David M., 1982. "Consistent link flow estimation from counts," Transportation Research Part B: Methodological, Elsevier, vol. 16(6), pages 473-476, December.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Lundgren, Jan T. & Peterson, Anders, 2008. "A heuristic for the bilevel origin-destination-matrix estimation problem," Transportation Research Part B: Methodological, Elsevier, vol. 42(4), pages 339-354, May.
    2. Juha-Matti Kuusinen & Janne Sorsa & Marja-Liisa Siikonen, 2015. "The Elevator Trip Origin-Destination Matrix Estimation Problem," Transportation Science, INFORMS, vol. 49(3), pages 559-576, August.
    3. Chao Sun & Yulin Chang & Yuji Shi & Lin Cheng & Jie Ma, 2019. "Subnetwork Origin-Destination Matrix Estimation Under Travel Demand Constraints," Networks and Spatial Economics, Springer, vol. 19(4), pages 1123-1142, December.
    4. T. Abrahamsson, 1998. "Estimation of Origin-Destination Matrices Using Traffic Counts- A Literature Survey," Working Papers ir98021, International Institute for Applied Systems Analysis.
    5. Huo, Jinbiao & Liu, Chengqi & Chen, Jingxu & Meng, Qiang & Wang, Jian & Liu, Zhiyuan, 2023. "Simulation-based dynamic origin–destination matrix estimation on freeways: A Bayesian optimization approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 173(C).
    6. Shen, Wei & Wynter, Laura, 2012. "A new one-level convex optimization approach for estimating origin–destination demand," Transportation Research Part B: Methodological, Elsevier, vol. 46(10), pages 1535-1555.
    7. A. de Palma & Y. Nesterov, 2001. "Stationary Dynamic Solutions in Congested Transportation Networks: Summary and Perspectives," THEMA Working Papers 2001-19, THEMA (THéorie Economique, Modélisation et Applications), Université de Cergy-Pontoise.
    8. Hai Yang & Qiang Meng & Michael G. H. Bell, 2001. "Simultaneous Estimation of the Origin-Destination Matrices and Travel-Cost Coefficient for Congested Networks in a Stochastic User Equilibrium," Transportation Science, INFORMS, vol. 35(2), pages 107-123, May.
    9. Sherali, Hanif D. & Narayanan, Arvind & Sivanandan, R., 2003. "Estimation of origin-destination trip-tables based on a partial set of traffic link volumes," Transportation Research Part B: Methodological, Elsevier, vol. 37(9), pages 815-836, November.
    10. S. Dempe & A. Zemkoho, 2012. "Bilevel road pricing: theoretical analysis and optimality conditions," Annals of Operations Research, Springer, vol. 196(1), pages 223-240, July.
    11. D E Boyce, 1984. "Urban Transportation Network-Equilibrium and Design Models: Recent Achievements and Future Prospects," Environment and Planning A, , vol. 16(11), pages 1445-1474, November.
    12. Lo, H. P. & Zhang, N. & Lam, W. H. K., 1999. "Decomposition algorithm for statistical estimation of OD matrix with random link choice proportions from traffic counts," Transportation Research Part B: Methodological, Elsevier, vol. 33(5), pages 369-385, June.
    13. Sylvain Sorin, 2023. "Continuous Time Learning Algorithms in Optimization and Game Theory," Dynamic Games and Applications, Springer, vol. 13(1), pages 3-24, March.
    14. Maher, Michael J. & Zhang, Xiaoyan & Vliet, Dirck Van, 2001. "A bi-level programming approach for trip matrix estimation and traffic control problems with stochastic user equilibrium link flows," Transportation Research Part B: Methodological, Elsevier, vol. 35(1), pages 23-40, January.
    15. Maryam Abareshi & Mehdi Zaferanieh & Mohammad Reza Safi, 2019. "Origin-Destination Matrix Estimation Problem in a Markov Chain Approach," Networks and Spatial Economics, Springer, vol. 19(4), pages 1069-1096, December.
    16. Xinhua Mao & Jianwei Wang & Changwei Yuan & Wei Yu & Jiahua Gan, 2018. "A Dynamic Traffic Assignment Model for the Sustainability of Pavement Performance," Sustainability, MDPI, vol. 11(1), pages 1-19, December.
    17. Xie, Chi & Kockelman, Kara M. & Waller, S. Travis, 2011. "A maximum entropy-least squares estimator for elastic origin–destination trip matrix estimation," Transportation Research Part B: Methodological, Elsevier, vol. 45(9), pages 1465-1482.
    18. Nguyen, S. & Pallottino, S. & Inaudi, D., 1996. "Postoptimizing equilibrium flows on large scale networks," European Journal of Operational Research, Elsevier, vol. 91(3), pages 507-516, June.
    19. Dimitris Bertsimas & Julia Yan, 2018. "From Physical Properties of Transportation Flows to Demand Estimation: An Optimization Approach," Transportation Science, INFORMS, vol. 52(4), pages 1002-1011, August.
    20. Garcia-Rodenas, Ricardo & Verastegui-Rayo, Doroteo, 2008. "A column generation algorithm for the estimation of origin-destination matrices in congested traffic networks," European Journal of Operational Research, Elsevier, vol. 184(3), pages 860-878, February.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:topjnl:v:5:y:1997:i:1:p:1-40. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.