Document Open Access Logo

Speed-Aware Network Design: A Parametric Optimization Approach

Authors Ugo Rosolia , Marc Bataillou Almagro, George Iosifidis, Martin Gross, Georgios Paschos

PDF

File

Thumbnail PDF
PDF
OASIcs.ATMOS.2025.9.pdf
  • Filesize: 1.26 MB
  • 16 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Applied computing → Transportation
Keywords
  • Network Design
  • Transportation Networks
  • Mixed-Integer Programming
  • Speed-Coverage
  • Parametric Optimization

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

Network design problems have been studied from the 1950s, as they can be used in a wide range of real-world applications, e.g., design of communication and transportation networks. In classical network design problems, the objective is to minimize the cost of routing the demand flow through a graph. In this paper, we introduce a generalized version of such a problem, where the objective is to tradeoff routing costs and delivery speed; we introduce the concept of speed-coverage, which is defined as the number of unique items that can be sent to destinations in less than 1-day. Speed-coverage is a function of both the network design and the inventory stored at origin nodes, e.g., an item can be delivered in 1-day if it is in-stock at an origin that can reach a destination within 24 hours. Modeling inventory is inherently complex, since inventory coverage is described by an integer function with a large number of points (exponential to the number of origin sites), each one to be evaluated using historical data. To bypass this complexity, we first leverage a parametric optimization approach, which converts the non-linear joint routing and speed-coverage optimization problem into an equivalent mixed-integer linear program. Then, we propose a sampling strategy to avoid evaluating all the points of the speed-coverage function. The proposed method is evaluated on a series of numerical tests with representative scenarios and network sizes. We show that when considering the routing costs and monetary gains resulting from speed-coverage, our approach outperforms the baseline by 8.36% on average.

Cite As Get BibTex

Ugo Rosolia, Marc Bataillou Almagro, George Iosifidis, Martin Gross, and Georgios Paschos. Speed-Aware Network Design: A Parametric Optimization Approach. In 25th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2025). Open Access Series in Informatics (OASIcs), Volume 137, pp. 9:1-9:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/OASIcs.ATMOS.2025.9

Author Details

Ugo Rosolia
  • Amazon Science & Tech, Luxembourg, Luxembourg
Marc Bataillou Almagro
  • Amazon Science & Tech, Luxembourg, Luxembourg
George Iosifidis
  • Delft University of Technology, The Netherlands
Martin Gross
  • Amazon Science & Tech, Luxembourg, Luxembourg
Georgios Paschos
  • Amazon Science & Tech, Luxembourg, Luxembourg

References

  1. Alexander A Ageev and Maxim I Sviridenko. Pipage rounding: A new method of constructing algorithms with proven performance guarantee. Journal of Combinatorial Optimization, 8:307-328, 2004. URL: https://doi.org/10.1023/B:JOCO.0000038913.96607.C2.
  2. Bernd Bank, Jürgen Guddat, Diethard Klatte, Bernd Kummer, and Klaus Tammer. Non-linear parametric optimization, volume 58. Walter de Gruyter GmbH & Co KG, 1982. Google Scholar
  3. Cynthia Barnhart and Rina R Schneur. Air network design for express shipment service. Operations Research, 44(6):852-863, 1996. URL: https://doi.org/10.1287/OPRE.44.6.852.
  4. Konstantinos Benidis, Georgios Paschos, Martin Gross, and George Iosifidis. Middle-mile optimization for next-day delivery. arXiv preprint arXiv:2310.18388, 2023. Google Scholar
  5. Natashia L Boland and Martin WP Savelsbergh. Perspectives on integer programming for time-dependent models. Top, 27(2):147-173, 2019. Google Scholar
  6. Francesco Borrelli, Alberto Bemporad, and Manfred Morari. Predictive control for linear and hybrid systems. Cambridge University Press, 2017. Google Scholar
  7. James F Campbell. Hub location for time definite transportation. Computers & Operations Research, 36(12):3107-3116, 2009. URL: https://doi.org/10.1016/J.COR.2009.01.009.
  8. Valentina Carbone, Aurélien Rouquet, and Christine Roussat. The rise of crowd logistics: a new way to co-create logistics value. Journal of Business Logistics, 38(4):238-252, 2017. Google Scholar
  9. Sunil Chopra, Itzhak Gilboa, and S Trilochan Sastry. Source sink flows with capacity installation in batches. Discrete Applied Mathematics, 85(3):165-192, 1998. URL: https://doi.org/10.1016/S0166-218X(98)00024-9.
  10. Bernard Fortz, Luís Gouveia, and Martim Joyce-Moniz. Models for the piecewise linear unsplittable multicommodity flow problems. European Journal of Operational Research, 261(1):30-42, 2017. URL: https://doi.org/10.1016/J.EJOR.2017.01.051.
  11. Ioannis Fragkos, Jean-François Cordeau, and Raf Jans. Decomposition methods for large-scale network expansion problems. Transportation Research Part B: Methodological, 144:60-80, 2021. Google Scholar
  12. Tomas Gal and Josef Nedoma. Multiparametric linear programming. Management Science, 18(7):406-422, 1972. Google Scholar
  13. Bernard Gendron, Teodor Gabriel Crainic, and Antonio Frangioni. Multicommodity capacitated network design. In Telecommunications network planning, pages 1-19. Springer, 1999. Google Scholar
  14. Lacy M Greening, Mathieu Dahan, and Alan L Erera. Lead-time-constrained middle-mile consolidation network design with fixed origins and destinations. Transportation Research Part B: Methodological, 174:102782, 2023. Google Scholar
  15. Mike Hewitt and Fabien Lehuede. New formulations for the scheduled service network design problem. Transportation Research Part B: Methodological, 172:117-133, 2023. Google Scholar
  16. Mathias A Klapp, Alan L Erera, and Alejandro Toriello. The one-dimensional dynamic dispatch waves problem. Transportation Science, 52(2):402-415, 2018. URL: https://doi.org/10.1287/TRSC.2016.0682.
  17. Vienna Klein and Claudius Steinhardt. Dynamic demand management and online tour planning for same-day delivery. European Journal of Operational Research, 307(2):860-886, 2022. URL: https://doi.org/10.1016/J.EJOR.2022.09.011.
  18. Andreas Krause and Daniel Golovin. Submodular function maximization. Tractability, 3(71-104):3, 2014. Google Scholar
  19. Cristiana L Lara, Jochen Koenemann, Yisu Nie, and Cid C de Souza. Scalable timing-aware network design via lagrangian decomposition. European Journal of Operational Research, 309(1):152-169, 2023. URL: https://doi.org/10.1016/J.EJOR.2023.01.018.
  20. George L Nemhauser, Laurence A Wolsey, and Marshall L Fisher. An analysis of approximations for maximizing submodular set functions—i. Mathematical programming, 14:265-294, 1978. URL: https://doi.org/10.1007/BF01588971.
  21. Henrik Pålsson, Fredrik Pettersson, and Lena Winslott Hiselius. Energy consumption in e-commerce versus conventional trade channels-insights into packaging, the last mile, unsold products and product returns. Journal of cleaner production, 164:765-778, 2017. Google Scholar
  22. Iosif Pappas, Dustin Kenefake, Baris Burnak, Styliani Avraamidou, Hari S Ganesh, Justin Katz, Nikolaos A Diangelakis, and Efstratios N Pistikopoulos. Multiparametric programming in process systems engineering: Recent developments and path forward. Frontiers in Chemical Engineering, 2:620168, 2021. Google Scholar
  23. Sadegh Shahmohammadi, Zoran JN Steinmann, Lau Tambjerg, Patricia van Loon, JM Henry King, and Mark AJ Huijbregts. Comparative greenhouse gas footprinting of online versus traditional shopping for fast-moving consumer goods: A stochastic approach. Environmental science & technology, 54(6):3499-3509, 2020. Google Scholar
  24. Jan Vondrák, Chandra Chekuri, and Rico Zenklusen. Submodular function maximization via the multilinear relaxation and contention resolution schemes. In Proceedings of the forty-third annual ACM symposium on Theory of computing, pages 783-792, 2011. URL: https://doi.org/10.1145/1993636.1993740.
  25. Haotian Wu, Ian Herszterg, Martin Savelsbergh, and Yixiao Huang. Service network design for same-day delivery with hub capacity constraints. Transportation Science, 57(1):273-287, 2023. URL: https://doi.org/10.1287/TRSC.2022.1155.
  26. Yu Yao, Xiaoning Zhu, Hongyu Dong, Shengnan Wu, Hailong Wu, Lu Carol Tong, and Xuesong Zhou. ADMM-based problem decomposition scheme for vehicle routing problem with time windows. Transportation Research Part B: Methodological, 129:156-174, 2019. Google Scholar
  27. Baris Yildiz, Hande Yaman, and Oya Ekin Karasan. Hub location, routing, and route dimensioning: Strategic and tactical intermodal transportation hub network design. Transportation Science, 55(6):1351-1369, 2021. URL: https://doi.org/10.1287/TRSC.2021.1070.
  28. Barış Yıldız and Martin Savelsbergh. Optimizing package express operations in china. European Journal of Operational Research, 300(1):320-335, 2022. URL: https://doi.org/10.1016/J.EJOR.2021.09.035.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact