IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v81y1995i3p561-570.html
   My bibliography  Save this article

The minimal average cost flow problem

Author

Listed:
  • Chen, Y. L.

Abstract

No abstract is available for this item.

Suggested Citation

  • Chen, Y. L., 1995. "The minimal average cost flow problem," European Journal of Operational Research, Elsevier, vol. 81(3), pages 561-570, March.
    • Handle: RePEc:eee:ejores:v:81:y:1995:i:3:p:561-570
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(93)E0348-2
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Jeff L. Kennington, 1978. "A Survey of Linear Cost Multicommodity Network Flows," Operations Research, INFORMS, vol. 26(2), pages 209-236, April.
    2. Carlos F. Daganzo & Yosef Sheffi, 1977. "On Stochastic Models of Traffic Assignment," Transportation Science, INFORMS, vol. 11(3), pages 253-274, August.
    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. Wei, Chong & Asakura, Yasuo & Iryo, Takamasa, 2014. "Formulating the within-day dynamic stochastic traffic assignment problem from a Bayesian perspective," Transportation Research Part B: Methodological, Elsevier, vol. 59(C), pages 45-57.
    2. Ahipaşaoğlu, Selin Damla & Meskarian, Rudabeh & Magnanti, Thomas L. & Natarajan, Karthik, 2015. "Beyond normality: A cross moment-stochastic user equilibrium model," Transportation Research Part B: Methodological, Elsevier, vol. 81(P2), pages 333-354.
    3. Theodore Tsekeris & Klimis Vogiatzoglou, 2011. "Spatial agent-based modeling of household and firm location with endogenous transport costs," Netnomics, Springer, vol. 12(2), pages 77-98, July.
    4. E. Nikolova & N. E. Stier-Moses, 2014. "A Mean-Risk Model for the Traffic Assignment Problem with Stochastic Travel Times," Operations Research, INFORMS, vol. 62(2), pages 366-382, April.
    5. Ehrgott, Matthias & Wang, Judith Y.T. & Watling, David P., 2015. "On multi-objective stochastic user equilibrium," Transportation Research Part B: Methodological, Elsevier, vol. 81(P3), pages 704-717.
    6. Huang, Ruqing & Han, Lee D. & Huang, Zhongxiang, 2022. "A new network equilibrium flow model: User-equilibrium with quantity adjustment," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 163(C).
    7. Castillo, Enrique & Menéndez, José María & Sánchez-Cambronero, Santos, 2008. "Predicting traffic flow using Bayesian networks," Transportation Research Part B: Methodological, Elsevier, vol. 42(5), pages 482-509, June.
    8. Ji, Xiangfeng & Chu, Yanyu, 2020. "A target-oriented bi-attribute user equilibrium model with travelers’ perception errors on the tolled traffic network," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 144(C).
    9. Du, Muqing & Tan, Heqing & Chen, Anthony, 2021. "A faster path-based algorithm with Barzilai-Borwein step size for solving stochastic traffic equilibrium models," European Journal of Operational Research, Elsevier, vol. 290(3), pages 982-999.
    10. Bell, Michael G. H., 1995. "Stochastic user equilibrium assignment in networks with queues," Transportation Research Part B: Methodological, Elsevier, vol. 29(2), pages 125-137, April.
    11. Ampol Karoonsoontawong & Dung-Ying Lin, 2015. "Combined Gravity Model Trip Distribution and Paired Combinatorial Logit Stochastic User Equilibrium Problem," Networks and Spatial Economics, Springer, vol. 15(4), pages 1011-1048, December.
    12. Dial, Robert B., 1997. "Bicriterion traffic assignment: Efficient algorithms plus examples," Transportation Research Part B: Methodological, Elsevier, vol. 31(5), pages 357-379, October.
    13. Sun, Mingmei, 2023. "A day-to-day dynamic model for mixed traffic flow of autonomous vehicles and inertial human-driven vehicles," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 173(C).
    14. Ma, Jie & Meng, Qiang & Cheng, Lin & Liu, Zhiyuan, 2022. "General stochastic ridesharing user equilibrium problem with elastic demand," Transportation Research Part B: Methodological, Elsevier, vol. 162(C), pages 162-194.
    15. Songyot Kitthamkesorn & Anthony Chen & Sathaporn Opasanon & Suwicha Jaita, 2021. "A P-Hub Location Problem for Determining Park-and-Ride Facility Locations with the Weibit-Based Choice Model," Sustainability, MDPI, vol. 13(14), pages 1-16, July.
    16. Garg, Manish & Smith, J. Cole, 2008. "Models and algorithms for the design of survivable multicommodity flow networks with general failure scenarios," Omega, Elsevier, vol. 36(6), pages 1057-1071, December.
    17. Jiang, Chenming & Bhat, Chandra R. & Lam, William H.K., 2020. "A bibliometric overview of Transportation Research Part B: Methodological in the past forty years (1979–2019)," Transportation Research Part B: Methodological, Elsevier, vol. 138(C), pages 268-291.
    18. Jiayang Li & Zhaoran Wang & Yu Marco Nie, 2023. "Wardrop Equilibrium Can Be Boundedly Rational: A New Behavioral Theory of Route Choice," Papers 2304.02500, arXiv.org, revised Feb 2024.
    19. Paolo Delle Site, 2017. "On the Equivalence Between SUE and Fixed-Point States of Day-to-Day Assignment Processes with Serially-Correlated Route Choice," Networks and Spatial Economics, Springer, vol. 17(3), pages 935-962, September.
    20. Sarah Root & Amy Cohn, 2008. "A novel modeling approach for express package carrier planning," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(7), pages 670-683, October.

    More about this item

    Statistics

    Access and download statistics

    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:eee:ejores:v:81:y:1995:i:3:p:561-570. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.