Skip to main content

Branch-and-Cut for a 2-Commodity Flow Relocation Model with Time Constraints

  • Conference paper
  • First Online:
Combinatorial Optimization (ISCO 2022)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13526))

Included in the following conference series:

Abstract

We deal here with a general 2-commodity flow model designed for the management of shared mobility systems which operate on a given transit network. The model involves an integral flow which represents carriers together with an integral flow which represents the objects transported by those carriers. It may be viewed as the projection on the transit network of a flow model formulated on a time expanded network which simultaneously copes with temporal and resource issues, but does not fit practical computation. In order to make this projected model compatible with the time expanded network model, we introduce specific constraints whose handling involves a separation process. We prove that this separation process can be performed in polynomial time, discuss the experimental behaviour of the related Branch-and-Cut algorithm and briefly address the lift issue to turn an optimal solution of our projected model into a solution of the original problem.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 64.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 84.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

References

  1. Ahuja, R.V., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms and Applications. Prentice hall, Englewood Cliffs (1993)

    MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  3. Ashok, K., Ben-Akiva, M.: Estimation and prediction of time-dependent origin-destination flows with a stochastic mapping to path flows and link flows. Transp. Sci. 36(2), 184–198 (2002)

    Article  MATH  Google Scholar 

  4. Benchimol, M., et al.: Balancing the stations of a self service “bike hire’’ system. RAIRO - Oper. Res. 45, 37–61 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  5. Bsaybes, S., Quilliot, A., Wagler, A.K.: Fleet management for autonomous vehicles using flows in time-expanded networks. TOP 27(2), 288–311 (2019). https://doi.org/10.1007/s11750-019-00506-4

    Article  MathSciNet  MATH  Google Scholar 

  6. Bsaybes, S., Quilliot, A., Wagler A.: Fleet management for autonomous vehicles using multicommodity coupled flows in time-expanded networks. In: 17th International Symposium on Experimental Algorithms (SEA 2018), Leibniz International Proceedings in Informatics (LIPIcs) (2018)

    Google Scholar 

  7. Chemla, D., Meunier, F., Wolfler-Calvo, R.: Bike sharing systems: solving the static rebalancing problem. Disc. Optim. 10(2), 120–146 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  8. Chifflet, J., Mahey, P., Reynier, V.: Proximal decomposition for multicommodity flow problems with convex costs. Telecommun. Syst. 3, 1–10 (1994)

    Article  Google Scholar 

  9. Contardo, C., Morency, C., Rousseau, L.: Balancing a Dynamic Public Bike-Sharing System. Univ. MONTREAL, Rapport CIRRELT (2012)

    Google Scholar 

  10. Dell’Amico, M., Hadjicostantinou, E., Iori, M., Novellani, S.: The bike sharing rebalancing problem: mathematical formulations and benchmark instances. Omega 45, 7–19 (2014)

    Article  Google Scholar 

  11. Erdoğan, G., Battarra, M., Wolfler-Calvo, R.: An exact algorithm for the static rebalancing problem arising in bicycle sharing systems. Eur. J. Oper. Res. 245(3), 667–679 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  12. Gavalas, D., Konstantopoulos, C., Pantziou, G.: Design and management of vehicle-sharing systems: a survey of algorithmic approaches. Smart Cities Homes, 261–289 (2016)

    Google Scholar 

  13. GEO-SAFE. Geospatial based Environment for Optimisation Systems Addressing Fire Emergencies (2020). https://cordis.europa.eu/project/id/691161. Accessed 21 Dec 2020

  14. Krumke, S., Quilliot, A., Wagler, A., Wegener, J.: Relocation in carsharing systems using flows in time-expanded networks. Lect. Notes Comput. Sci. 8504, 87–98 (2014)

    Article  Google Scholar 

  15. Nourinejad, M., Roorda, M.: A dynamic carsharing decision support system. Transp. Res. Part E: Logist. Transp. Rev. 66, 36–50 (2014)

    Article  Google Scholar 

  16. Raviv, T., Tzur, M., Forma, I.A.: Static repositioning in a bike-sharing system: models and solution approaches. EURO J. Transp. Logist. 2, 187–229 (2013)

    Article  Google Scholar 

  17. Shaheen, S., Guzman, S., Zhang, H.: Bikesharing in Europe, the Americas, and Asia: Past, Present, and Future. Institute of Transportation Studies, UC Davis, Institute of Transportation Studies, Working Paper Series. 2143 (2010)

    Google Scholar 

  18. Schuijbroek, J., Hampshire, R.C., van Hoeve, W.: Inventory rebalancing and vehicle routing in bike sharing systems. Eur. J. Oper. Res. 257(3), 992–1004 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  19. Waserhole, A., Jost, V.: Vehicle sharing system pricing regulation: a fluid approximation (2012)

    Google Scholar 

Download references

Acknowledgement

This work has been carried out in the context of the H2020 Marie Skłodowska-Curie Research and Innovation Staff Exchange European project 691161 “GEO-SAFE" [13].

On behalf of all authors, the corresponding author states that there is no conflict of interest.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to José Luis Figueroa González .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Figueroa González, J.L., Baïou, M., Quilliot, A., Toussaint, H., Wagler, A. (2022). Branch-and-Cut for a 2-Commodity Flow Relocation Model with Time Constraints. In: Ljubić, I., Barahona, F., Dey, S.S., Mahjoub, A.R. (eds) Combinatorial Optimization. ISCO 2022. Lecture Notes in Computer Science, vol 13526. Springer, Cham. https://doi.org/10.1007/978-3-031-18530-4_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-18530-4_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-18529-8

  • Online ISBN: 978-3-031-18530-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics