IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v46y2010i3p451-466.html
   My bibliography  Save this article

A comparison of feasible direction methods for the stochastic transportation problem

Author

Listed:
  • Maria Daneva
  • Torbjörn Larsson
  • Michael Patriksson
  • Clas Rydergren

Abstract

No abstract is available for this item.

Suggested Citation

  • Maria Daneva & Torbjörn Larsson & Michael Patriksson & Clas Rydergren, 2010. "A comparison of feasible direction methods for the stochastic transportation problem," Computational Optimization and Applications, Springer, vol. 46(3), pages 451-466, July.
    • Handle: RePEc:spr:coopap:v:46:y:2010:i:3:p:451-466
    DOI: 10.1007/s10589-008-9199-0
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10589-008-9199-0
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10589-008-9199-0?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. Killmer, K. A. & Anandalingam, G. & Malcolm, S. A., 2001. "Siting noxious facilities under uncertainty," European Journal of Operational Research, Elsevier, vol. 133(3), pages 596-607, September.
    2. Holmberg, Kaj & Jornsten, Kurt O., 1984. "Cross decomposition applied to the stochastic transportation problem," European Journal of Operational Research, Elsevier, vol. 17(3), pages 361-368, September.
    3. Torbjörn Larsson & Michael Patriksson, 1992. "Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem," Transportation Science, INFORMS, vol. 26(1), pages 4-17, February.
    4. Salah E. Elmaghraby, 1960. "Allocation under Uncertainty when the Demand has Continuous D.F," Management Science, INFORMS, vol. 6(3), pages 270-294, April.
    5. Larry J. LeBlanc & Richard V. Helgason & David E. Boyce, 1985. "Improved Efficiency of the Frank-Wolfe Algorithm for Convex Network Programs," Transportation Science, INFORMS, vol. 19(4), pages 445-462, November.
    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. A. Karakitsiou & A. Migdalas, 2016. "Convex optimization problems in supply chain planning and their solution by a column generation method based on the Frank Wolfe method," Operational Research, Springer, vol. 16(3), pages 401-421, October.
    2. Maria Mitradjieva & Per Olov Lindberg, 2013. "The Stiff Is Moving---Conjugate Direction Frank-Wolfe Methods with Applications to Traffic Assignment ," Transportation Science, INFORMS, vol. 47(2), pages 280-293, May.
    3. Sang Nguyen & Stefano Pallottino & Federico Malucelli, 2001. "A Modeling Framework for Passenger Assignment on a Transport Network with Timetables," Transportation Science, INFORMS, vol. 35(3), pages 238-249, August.
    4. Takashi Akamatsu, 2001. "An Efficient Algorithm for Dynamic Traffic Equilibrium Assignment with Queues," Transportation Science, INFORMS, vol. 35(4), pages 389-404, November.
    5. Damberg, Olof & Lundgren, Jan T. & Patriksson, Michael, 1996. "An algorithm for the stochastic user equilibrium problem," Transportation Research Part B: Methodological, Elsevier, vol. 30(2), pages 115-131, April.
    6. Hillel Bar-Gera, 2002. "Origin-Based Algorithm for the Traffic Assignment Problem," Transportation Science, INFORMS, vol. 36(4), pages 398-417, November.
    7. David Di Lorenzo & Alessandro Galligari & Marco Sciandrone, 2015. "A convergent and efficient decomposition method for the traffic assignment problem," Computational Optimization and Applications, Springer, vol. 60(1), pages 151-170, January.
    8. Jayakrishnan, R. & Tsai, Wei K. & Oh, Jun-Seok & Adler, Jeffrey, 1999. "Event-based ATIS: Practical Implementation and Evaluation of Optimized Strategies (Part I)," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt0hz5n8x2, Institute of Transportation Studies, UC Berkeley.
    9. Yuan, Yun & Yu, Jie, 2018. "Locating transit hubs in a multi-modal transportation network: A cluster-based optimization approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 114(C), pages 85-103.
    10. Meng Li & Guowei Hua & Haijun Huang, 2018. "A Multi-Modal Route Choice Model with Ridesharing and Public Transit," Sustainability, MDPI, vol. 10(11), pages 1-14, November.
    11. Moore, II, James E. & Kim, Geunyoung & Cho, Seongdil & Hu, Hsi-hwa & Xu, Rong, 1997. "Evaluating System ATMIS Technologies Via Rapid Estimation Of Network Flows: Final Report," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt5c70f3d9, Institute of Transportation Studies, UC Berkeley.
    12. Xu, Zhandong & Xie, Jun & Liu, Xiaobo & Nie, Yu (Marco), 2020. "Hyperpath-based algorithms for the transit equilibrium assignment problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 143(C).
    13. Nie, Yu (Marco), 2010. "A class of bush-based algorithms for the traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 44(1), pages 73-89, January.
    14. Seungkyu Ryu & Anthony Chen & Xiangdong Xu & Keechoo Choi, 2014. "A Dual Approach for Solving the Combined Distribution and Assignment Problem with Link Capacity Constraints," Networks and Spatial Economics, Springer, vol. 14(2), pages 245-270, June.
    15. 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.
    16. Nair, Rahul & Miller-Hooks, Elise, 2014. "Equilibrium network design of shared-vehicle systems," European Journal of Operational Research, Elsevier, vol. 235(1), pages 47-61.
    17. Zheng, Hong & Peeta, Srinivas, 2014. "Cost scaling based successive approximation algorithm for the traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 68(C), pages 17-30.
    18. 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.
    19. Huang, Hai-Jun & Xu, Gang, 1998. "Aggregate scheduling and network solving of multi-stage and multi-item manufacturing systems," European Journal of Operational Research, Elsevier, vol. 105(1), pages 52-65, February.
    20. Paul Berglund & Changhyun Kwon, 2014. "Robust Facility Location Problem for Hazardous Waste Transportation," Networks and Spatial Economics, Springer, vol. 14(1), pages 91-116, March.

    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:coopap:v:46:y:2010:i:3:p:451-466. 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.