Nothing Special   »   [go: up one dir, main page]

Skip to main content

Scale Multi-commodity Flow Handling on Dynamic Networks

  • Conference paper
  • First Online:
Large-Scale Scientific Computing (LSSC 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8353))

Included in the following conference series:

Abstract

We present here an experimental Large Scale Flow/Multi-commodity model for a routing and scheduling Transportation Problem. We deal with this model through a mix of a GRASP scheme and of Hierarchical Decomposition/Agregation techniques.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B., Reddy, M.R.: Applications of network optimization; Chap. 1 Network Models, Handbook O.R & Manag. Sci. 7, 1–83 (1995)

    Google Scholar 

  2. Aronson, J.E.: A survey on dynamic network flows. Ann. Op. Res. 20, 1–66 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  3. Barahona, F.: Network design using cut inequalities. SIAM J. Optim. 6, 822–837 (1995)

    MathSciNet  Google Scholar 

  4. Benchakroun, A., Ferland, J., Gascon, V.: Benders decomposition for network design problems with underlying tree structure. Invest. Operativa 6, 165–180 (1997)

    Google Scholar 

  5. Bienstock, D., Günlük, O.: Capacitated network design polyhedral structure and computation. INFORMS J. Comput. 8, 243–259 (1996)

    Article  MATH  Google Scholar 

  6. Cordeau, J.P., Toth, P., Vigo, D.: A survey of optimization models for train routing and scheduling. Transp. Sci. 32, 380–404 (1998)

    Article  MATH  Google Scholar 

  7. Crainic, T., Gendreau, M., Farvolden, J.M.: A simplex based Tabu search method for capacitated network design. INFORMS J. Comput. 12, 223–236 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  8. Crainic, T., Frangioni, A., Gendron, B.: Bundle based relaxation methods for multicommodity capacitated fixed charge network design. DAM 112, 73–99 (2001)

    MATH  MathSciNet  Google Scholar 

  9. Magnanti, T., Wong, R.T.: Network design and transportation planning models and algorithms. Trans. Sci. 18, 1–5 (1984)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Alain Quilliot .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Quilliot, A., Liberalino, H., Bernay, B. (2014). Scale Multi-commodity Flow Handling on Dynamic Networks. In: Lirkov, I., Margenov, S., Waśniewski, J. (eds) Large-Scale Scientific Computing. LSSC 2013. Lecture Notes in Computer Science(), vol 8353. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-43880-0_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-43880-0_33

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-43879-4

  • Online ISBN: 978-3-662-43880-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics