IDEAS home Printed from https://ideas.repec.org/a/spr/flsman/v33y2021i3d10.1007_s10696-020-09391-7.html
   My bibliography  Save this article

Optimizing construction schedules and material deliveries in city logistics: a case study from the building industry

Author

Listed:
  • Pamela C. Nolz

    (AIT Austrian Institute of Technology)

Abstract

We consider the problem of designing a logistics system to assure efficient urban construction processes for an innovative urban building area in the city of Vienna. We address the challenges of coordinating workers and the timely delivery and storage of material with the objective of optimizing resource-efficiency as well as reducing traffic related to construction tasks. The problem is formulated as a hierarchical optimization problem, incorporating tactical construction logistics planning as well as operational construction logistics planning. On the tactical level a time schedule of tasks for different construction phases and the corresponding material transports and storage decisions are optimized on a weekly basis, while on the operational level the daily optimization of material transports, modeled as an inventory routing problem, is addressed. A mixed-integer programming formulation of the problem on each planning level is provided and solved using CPLEX. The suggested approach is tested on realistic data from the city of Vienna. The results associated with different scenarios are analyzed to illustrate the value of the proposed approach for the design of construction logistics processes.

Suggested Citation

  • Pamela C. Nolz, 2021. "Optimizing construction schedules and material deliveries in city logistics: a case study from the building industry," Flexible Services and Manufacturing Journal, Springer, vol. 33(3), pages 846-878, September.
    • Handle: RePEc:spr:flsman:v:33:y:2021:i:3:d:10.1007_s10696-020-09391-7
    DOI: 10.1007/s10696-020-09391-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10696-020-09391-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10696-020-09391-7?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. Hong Zhang & Heng Li & C. M. Tam, 2006. "Heuristic scheduling of resource-constrained, multiple-mode and repetitive projects," Construction Management and Economics, Taylor & Francis Journals, vol. 24(2), pages 159-169.
    2. Kolisch, Rainer & Heß, K., 2000. "Efficient methods for scheduling make-to-order assemblies under resource, assembly area and part availability constraints," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 7010, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    3. Kolisch, Rainer, 2000. "Integrated scheduling, assembly area- and part-assignment for large-scale, make-to-order assemblies," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 6637, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    4. A. Alan B. Pritsker & Lawrence J. Waiters & Philip M. Wolfe, 1969. "Multiproject Scheduling with Limited Resources: A Zero-One Programming Approach," Management Science, INFORMS, vol. 16(1), pages 93-108, September.
    5. Kolisch, Rainer, 2000. "Integration of assembly and fabrication for make-to-order production," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 335, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    6. N H Moin & S Salhi, 2007. "Inventory routing problems: a logistical overview," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(9), pages 1185-1194, September.
    7. Christian Artigues & Oumar Koné & Pierre Lopez & Marcel Mongeau, 2015. "Mixed-Integer Linear Programming Formulations," International Handbooks on Information Systems, in: Christoph Schwindt & Jürgen Zimmermann (ed.), Handbook on Project Management and Scheduling Vol.1, edition 127, chapter 0, pages 17-41, Springer.
    8. Campbell, Ann Melissa & Hardin, Jill R., 2005. "Vehicle minimization for periodic deliveries," European Journal of Operational Research, Elsevier, vol. 165(3), pages 668-684, September.
    9. Frank Schultmann & Otto Rentz, 2002. "Scheduling of deconstruction projects under resource constraints," Construction Management and Economics, Taylor & Francis Journals, vol. 20(5), pages 391-401.
    10. Kolisch, R. & Padman, R., 2001. "An integrated survey of deterministic project scheduling," Omega, Elsevier, vol. 29(3), pages 249-272, June.
    11. Doerner, K.F. & Gutjahr, W.J. & Hartl, R.F. & Strauss, C. & Stummer, C., 2008. "Nature-inspired metaheuristics for multiobjective activity crashing," Omega, Elsevier, vol. 36(6), pages 1019-1037, December.
    12. Yossiri Adulyasak & Jean-François Cordeau & Raf Jans, 2014. "Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems," INFORMS Journal on Computing, INFORMS, vol. 26(1), pages 103-120, February.
    13. Yu, Yugang & Chen, Haoxun & Chu, Feng, 2008. "A new model and hybrid approach for large scale inventory routing problems," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1022-1040, September.
    14. Olaguibel, Ramon Alvarez-Valdes & Goerlich, JoseManuel Tamarit, 1993. "The project scheduling polyhedron: Dimension, facets and lifting theorems," European Journal of Operational Research, Elsevier, vol. 67(2), pages 204-220, June.
    15. Hemmelmayr, Vera & Doerner, Karl F. & Hartl, Richard F. & Savelsbergh, Martin W.P., 2010. "Vendor managed inventory for environments with stochastic product usage," European Journal of Operational Research, Elsevier, vol. 202(3), pages 686-695, May.
    16. Walter J. Bell & Louis M. Dalberto & Marshall L. Fisher & Arnold J. Greenfield & R. Jaikumar & Pradeep Kedia & Robert G. Mack & Paul J. Prutzman, 1983. "Improving the Distribution of Industrial Gases with an On-Line Computerized Routing and Scheduling Optimizer," Interfaces, INFORMS, vol. 13(6), pages 4-23, December.
    17. Awi Federgruen & Paul Zipkin, 1984. "A Combined Vehicle Routing and Inventory Allocation Problem," Operations Research, INFORMS, vol. 32(5), pages 1019-1037, October.
    18. Kolisch, R., 2000. "Integration of assembly and fabrication for make-to-order production," International Journal of Production Economics, Elsevier, vol. 68(3), pages 287-306, December.
    19. Kolisch, R., 2000. "Integrated scheduling, assembly area- and part-assignment for large-scale, make-to-order assemblies," International Journal of Production Economics, Elsevier, vol. 64(1-3), pages 127-141, March.
    20. Oğuz Solyalı & Jean-François Cordeau & Gilbert Laporte, 2012. "Robust Inventory Routing Under Demand Uncertainty," Transportation Science, INFORMS, vol. 46(3), pages 327-340, August.
    21. J Zhou & P E D Love & X Wang & K L Teo & Z Irani, 2013. "A review of methods and algorithms for optimizing construction scheduling," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 64(8), pages 1091-1105, August.
    22. Claudia Archetti & Luca Bertazzi & Gilbert Laporte & Maria Grazia Speranza, 2007. "A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem," Transportation Science, INFORMS, vol. 41(3), pages 382-391, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Israt Jahan & Guomin Zhang & Muhammed Bhuiyan & Satheeskumar Navaratnam & Long Shi, 2022. "Experts’ Perceptions of the Management and Minimisation of Waste in the Australian Construction Industry," Sustainability, MDPI, vol. 14(18), pages 1-20, September.
    2. Rajkumar, G. & Saravanan, M. & Marimuthu, P., 2023. "Developing a numerical model to analyze the production process of PMEDM," Resources Policy, Elsevier, vol. 80(C).
    3. Eric Forcael & Ibzan Carriel & Alexander Opazo-Vega & Francisco Moreno & Francisco Orozco & Rubén Romo & Duzgun Agdas, 2024. "Artificial Bee Colony Algorithm to Optimize the Safety Distance of Workers in Construction Projects," Mathematics, MDPI, vol. 12(13), pages 1-23, July.

    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. Hartmann, Sönke & Briskorn, Dirk, 2010. "A survey of variants and extensions of the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 207(1), pages 1-14, November.
    2. Cárdenas-Barrón, Leopoldo Eduardo & González-Velarde, José Luis & Treviño-Garza, Gerardo & Garza-Nuñez, Dagoberto, 2019. "Heuristic algorithm based on reduce and optimize approach for a selective and periodic inventory routing problem in a waste vegetable oil collection environment," International Journal of Production Economics, Elsevier, vol. 211(C), pages 44-59.
    3. Rossi, Roberto & Tomasella, Maurizio & Martin-Barragan, Belen & Embley, Tim & Walsh, Christopher & Langston, Matthew, 2019. "The Dynamic Bowser Routing Problem," European Journal of Operational Research, Elsevier, vol. 275(1), pages 108-126.
    4. Mirzapour Al-e-hashem, Seyed M.J. & Rekik, Yacine & Mohammadi Hoseinhajlou, Ebrahim, 2019. "A hybrid L-shaped method to solve a bi-objective stochastic transshipment-enabled inventory routing problem," International Journal of Production Economics, Elsevier, vol. 209(C), pages 381-398.
    5. Liu, Ming & Liu, Xin & Chu, Feng & Zheng, Feifeng & Chu, Chengbin, 2019. "Distributionally robust inventory routing problem to maximize the service level under limited budget," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 126(C), pages 190-211.
    6. Yossiri Adulyasak & Jean-François Cordeau & Raf Jans, 2015. "Benders Decomposition for Production Routing Under Demand Uncertainty," Operations Research, INFORMS, vol. 63(4), pages 851-867, August.
    7. Oğuz Solyalı & Jean-François Cordeau & Gilbert Laporte, 2012. "Robust Inventory Routing Under Demand Uncertainty," Transportation Science, INFORMS, vol. 46(3), pages 327-340, August.
    8. Leandro C. Coelho & Jean-François Cordeau & Gilbert Laporte, 2014. "Thirty Years of Inventory Routing," Transportation Science, INFORMS, vol. 48(1), pages 1-19, February.
    9. Jafarian, Ahmad & Asgari, Nasrin & Mohri, Seyed Sina & Fatemi-Sadr, Elham & Farahani, Reza Zanjirani, 2019. "The inventory-routing problem subject to vehicle failure," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 126(C), pages 254-294.
    10. Divsalar, Ali & Vansteenwegen, Pieter, 2016. "A two-phase algorithm for the cyclic inventory routing problemAuthor-Name: Chitsaz, Masoud," European Journal of Operational Research, Elsevier, vol. 254(2), pages 410-426.
    11. Seyed Mahmood KAZEMI & Masoud RABBANI & Reza TAVAKKOLI-MOGHADDAM & Farid Abolhassani SHAHREZA, 2017. "An Exact Solution for Joint Optimization of Inventory and Routing Decisions in Blood Supply Chains: A Case Study," ECONOMIC COMPUTATION AND ECONOMIC CYBERNETICS STUDIES AND RESEARCH, Faculty of Economic Cybernetics, Statistics and Informatics, vol. 51(4), pages 315-333.
    12. Manousakis, Eleftherios & Repoussis, Panagiotis & Zachariadis, Emmanouil & Tarantilis, Christos, 2021. "Improved branch-and-cut for the Inventory Routing Problem based on a two-commodity flow formulation," European Journal of Operational Research, Elsevier, vol. 290(3), pages 870-885.
    13. Mahmutoğulları, Özlem & Yaman, Hande, 2023. "A Branch-and-Cut Algorithm for the Inventory Routing Problem with Product Substitution," Omega, Elsevier, vol. 115(C).
    14. Bertazzi, Luca & Moezi, Sarem Deilami & Maggioni, Francesca, 2021. "The value of integration of full container load, less than container load and air freight shipments in vendor–managed inventory systems," International Journal of Production Economics, Elsevier, vol. 241(C).
    15. Oğuz Solyalı & Haldun Süral, 2011. "A Branch-and-Cut Algorithm Using a Strong Formulation and an A Priori Tour-Based Heuristic for an Inventory-Routing Problem," Transportation Science, INFORMS, vol. 45(3), pages 335-345, August.
    16. Hadi Jahangir & Mohammad Mohammadi & Seyed Hamid Reza Pasandideh & Neda Zendehdel Nobari, 2019. "Comparing performance of genetic and discrete invasive weed optimization algorithms for solving the inventory routing problem with an incremental delivery," Journal of Intelligent Manufacturing, Springer, vol. 30(6), pages 2327-2353, August.
    17. Schmid, Verena & Doerner, Karl F. & Laporte, Gilbert, 2013. "Rich routing problems arising in supply chain management," European Journal of Operational Research, Elsevier, vol. 224(3), pages 435-448.
    18. Skålnes, Jørgen & Andersson, Henrik & Desaulniers, Guy & Stålhane, Magnus, 2022. "An improved formulation for the inventory routing problem with time-varying demands," European Journal of Operational Research, Elsevier, vol. 302(3), pages 1189-1201.
    19. Liang Tang & Zhihong Jin & Xuwei Qin & Ke Jing, 2019. "Supply chain scheduling in a collaborative manufacturing mode: model construction and algorithm design," Annals of Operations Research, Springer, vol. 275(2), pages 685-714, April.
    20. Skålnes, Jørgen & Ben Ahmed, Mohamed & Hvattum, Lars Magnus & Stålhane, Magnus, 2024. "New benchmark instances for the inventory routing problem," European Journal of Operational Research, Elsevier, vol. 313(3), pages 992-1014.

    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:flsman:v:33:y:2021:i:3:d:10.1007_s10696-020-09391-7. 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.