IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v16y2024i9p3706-d1385261.html
   My bibliography  Save this article

Sustainable Time-Dependent Cheapest Path Problem with Integrated Collaborative Stakeholders’ Perspectives

Author

Listed:
  • Ivana Semanjski

    (Department of Industrial Engineering and Product Design, Ghent University, 9000 Ghent, Belgium
    Industrial System Engineering (ISyE), Flanders Make, 9000 Ghent, Belgium)

  • Sidharta Gautama

    (Department of Industrial Engineering and Product Design, Ghent University, 9000 Ghent, Belgium
    Industrial System Engineering (ISyE), Flanders Make, 9000 Ghent, Belgium)

Abstract

The Sustainable Time-Dependent Cheapest Path Problem (STDCPP) entails locating a Hamiltonian path that covers all of the graph’s vertices at the lowest possible total sustainability cost. The issue is inspired by actual city logistics, where it is important to consider the opinions of diverse stakeholders in the light of sustainable urban mobility plans and service viability. To address this issue, this paper suggests a twofold contribution. First, we describe the Sustainable Time-Dependent Cheapest Path Problem and define the complex cost function, which, based on the multi-criteria decision-making approach, integrates the views of different stakeholders and sustainability elements into the route cost calculation. Second, we show that the modified problem satisfies the FIFO (First-In First-Out) property and demonstrate the applicability of the suggested approach on a real-life scenario where route sustainability is extracted from the traffic sign information system available in Flanders, Belgium.

Suggested Citation

  • Ivana Semanjski & Sidharta Gautama, 2024. "Sustainable Time-Dependent Cheapest Path Problem with Integrated Collaborative Stakeholders’ Perspectives," Sustainability, MDPI, vol. 16(9), pages 1-19, April.
    • Handle: RePEc:gam:jsusta:v:16:y:2024:i:9:p:3706-:d:1385261
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/16/9/3706/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2071-1050/16/9/3706/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. F. Benjamin Zhan & Charles E. Noon, 1998. "Shortest Path Algorithms: An Evaluation Using Real Road Networks," Transportation Science, INFORMS, vol. 32(1), pages 65-73, February.
    2. Daniel Delling & Andrew V. Goldberg & Thomas Pajor & Renato F. Werneck, 2017. "Customizable Route Planning in Road Networks," Transportation Science, INFORMS, vol. 51(2), pages 566-561, May.
    3. Albiach, José & Sanchis, José Marí­a & Soler, David, 2008. "An asymmetric TSP with time windows and with time-dependent travel times and costs: An exact solution through a graph transformation," European Journal of Operational Research, Elsevier, vol. 189(3), pages 789-802, September.
    4. Franceschetti, Anna & Honhon, Dorothée & Van Woensel, Tom & Bektaş, Tolga & Laporte, Gilbert, 2013. "The time-dependent pollution-routing problem," Transportation Research Part B: Methodological, Elsevier, vol. 56(C), pages 265-293.
    5. José Holguín-Veras & Michael Silas & John Polimeni & Brenda Cruz, 2008. "An Investigation on the Effectiveness of Joint Receiver–Carrier Policies to Increase Truck Traffic in the Off-peak Hours," Networks and Spatial Economics, Springer, vol. 8(4), pages 327-354, December.
    6. Groothedde, Bas & Ruijgrok, Cees & Tavasszy, Lóri, 2005. "Towards collaborative, intermodal hub networks: A case study in the fast moving consumer goods market," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 41(6), pages 567-583, November.
    7. R. Montemanni & J. Barta & M. Mastrolilli & L. M. Gambardella, 2007. "The Robust Traveling Salesman Problem with Interval Data," Transportation Science, INFORMS, vol. 41(3), pages 366-381, August.
    8. Saaty, Thomas L., 1990. "How to make a decision: The analytic hierarchy process," European Journal of Operational Research, Elsevier, vol. 48(1), pages 9-26, September.
    9. Ichoua, Soumia & Gendreau, Michel & Potvin, Jean-Yves, 2003. "Vehicle dispatching with time-dependent travel times," European Journal of Operational Research, Elsevier, vol. 144(2), pages 379-396, January.
    10. Clark, Stephen & Watling, David, 2005. "Modelling network travel time reliability under stochastic demand," Transportation Research Part B: Methodological, Elsevier, vol. 39(2), pages 119-140, February.
    11. Daniel Delling & Giacomo Nannicini, 2012. "Core Routing on Dynamic Time-Dependent Road Networks," INFORMS Journal on Computing, INFORMS, vol. 24(2), pages 187-201, May.
    12. Castillo-Manzano, José I. & Castro-Nuño, Mercedes & Fageda, Xavier, 2016. "Exploring the relationship between truck load capacity and traffic accidents in the European Union," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 88(C), pages 94-109.
    13. Huang, Yixiao & Zhao, Lei & Van Woensel, Tom & Gross, Jean-Philippe, 2017. "Time-dependent vehicle routing problem with path flexibility," Transportation Research Part B: Methodological, Elsevier, vol. 95(C), pages 169-195.
    14. Fukasawa, Ricardo & He, Qie & Song, Yongjia, 2016. "A disjunctive convex programming approach to the pollution-routing problem," Transportation Research Part B: Methodological, Elsevier, vol. 94(C), pages 61-79.
    15. Chryssi Malandraki & Mark S. Daskin, 1992. "Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms," Transportation Science, INFORMS, vol. 26(3), pages 185-200, August.
    16. Vaidya, Omkarprasad S. & Kumar, Sushil, 2006. "Analytic hierarchy process: An overview of applications," European Journal of Operational Research, Elsevier, vol. 169(1), pages 1-29, February.
    17. Shangyao Yan & Ching-Hui Tang, 2008. "An Integrated Framework for Intercity Bus Scheduling Under Stochastic Bus Travel Times," Transportation Science, INFORMS, vol. 42(3), pages 318-335, August.
    18. Schneider, Johannes, 2002. "The time-dependent traveling salesman problem," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 314(1), pages 151-155.
    19. Russ J. Vander Wiel & Nikolaos V. Sahinidis, 1996. "An exact solution approach for the time‐dependent traveling‐salesman problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(6), pages 797-820, September.
    20. Daqing Wu & Jiyu Li & Jiye Cui & Dong Hu, 2023. "Research on the Time-Dependent Vehicle Routing Problem for Fresh Agricultural Products Based on Customer Value," Agriculture, MDPI, vol. 13(3), pages 1-23, March.
    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. Ivana Semanjski & Sidharta Gautama, 2019. "A Collaborative Stakeholder Decision-Making Approach for Sustainable Urban Logistics," Sustainability, MDPI, vol. 11(1), pages 1-11, January.
    2. Jean-François Cordeau & Gianpaolo Ghiani & Emanuela Guerriero, 2014. "Analysis and Branch-and-Cut Algorithm for the Time-Dependent Travelling Salesman Problem," Transportation Science, INFORMS, vol. 48(1), pages 46-58, February.
    3. Merve Kayacı Çodur & Mustafa Yılmaz, 2020. "A time-dependent hierarchical Chinese postman problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 28(1), pages 337-366, March.
    4. Ehmke, Jan Fabian & Campbell, Ann M. & Thomas, Barrett W., 2018. "Optimizing for total costs in vehicle routing in urban areas," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 116(C), pages 242-265.
    5. Furini, Fabio & Persiani, Carlo Alfredo & Toth, Paolo, 2016. "The Time Dependent Traveling Salesman Planning Problem in Controlled Airspace," Transportation Research Part B: Methodological, Elsevier, vol. 90(C), pages 38-55.
    6. Rifki, Omar & Chiabaut, Nicolas & Solnon, Christine, 2020. "On the impact of spatio-temporal granularity of traffic conditions on the quality of pickup and delivery optimal tours," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
    7. Lu, Jiawei & Nie, Qinghui & Mahmoudi, Monirehalsadat & Ou, Jishun & Li, Chongnan & Zhou, Xuesong Simon, 2022. "Rich arc routing problem in city logistics: Models and solution algorithms using a fluid queue-based time-dependent travel time representation," Transportation Research Part B: Methodological, Elsevier, vol. 166(C), pages 143-182.
    8. Behnke, Martin & Kirschstein, Thomas, 2017. "The impact of path selection on GHG emissions in city logistics," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 106(C), pages 320-336.
    9. Asghari, Mohammad & Mirzapour Al-e-hashem, S. Mohammad J., 2021. "Green vehicle routing problem: A state-of-the-art review," International Journal of Production Economics, Elsevier, vol. 231(C).
    10. Anke Stieber & Armin Fügenschuh, 2022. "Dealing with time in the multiple traveling salespersons problem with moving targets," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 30(3), pages 991-1017, September.
    11. Sun, Peng & Veelenturf, Lucas P. & Hewitt, Mike & Van Woensel, Tom, 2018. "The time-dependent pickup and delivery problem with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 116(C), pages 1-24.
    12. Verbeeck, C. & Vansteenwegen, P. & Aghezzaf, E.-H., 2016. "Solving the stochastic time-dependent orienteering problem with time windows," European Journal of Operational Research, Elsevier, vol. 255(3), pages 699-718.
    13. LIAN, Ying & LUCAS, Flavien & SÖRENSEN, Kenneth, 2022. "The on-demand bus routing problem with real-time traffic information," Working Papers 2022003, University of Antwerp, Faculty of Business and Economics.
    14. Liu, Yiming & Roberto, Baldacci & Zhou, Jianwen & Yu, Yang & Zhang, Yu & Sun, Wei, 2023. "Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 310(1), pages 133-155.
    15. Xiao, Yiyong & Konak, Abdullah, 2016. "The heterogeneous green vehicle routing and scheduling problem with time-varying traffic congestion," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 88(C), pages 146-166.
    16. Behnke, Martin & Kirschstein, Thomas & Bierwirth, Christian, 2021. "A column generation approach for an emission-oriented vehicle routing problem on a multigraph," European Journal of Operational Research, Elsevier, vol. 288(3), pages 794-809.
    17. Gmira, Maha & Gendreau, Michel & Lodi, Andrea & Potvin, Jean-Yves, 2021. "Tabu search for the time-dependent vehicle routing problem with time windows on a road network," European Journal of Operational Research, Elsevier, vol. 288(1), pages 129-140.
    18. Tikani, Hamid & Setak, Mostafa & Demir, Emrah, 2021. "A risk-constrained time-dependent cash-in-transit routing problem in multigraph under uncertainty," European Journal of Operational Research, Elsevier, vol. 293(2), pages 703-730.
    19. Verbeeck, C. & Sörensen, K. & Aghezzaf, E.-H. & Vansteenwegen, P., 2014. "A fast solution method for the time-dependent orienteering problem," European Journal of Operational Research, Elsevier, vol. 236(2), pages 419-432.
    20. Huang, Yixiao & Zhao, Lei & Van Woensel, Tom & Gross, Jean-Philippe, 2017. "Time-dependent vehicle routing problem with path flexibility," Transportation Research Part B: Methodological, Elsevier, vol. 95(C), pages 169-195.

    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:gam:jsusta:v:16:y:2024:i:9:p:3706-:d:1385261. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.