IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v52y2018i4p756-768.html
   My bibliography  Save this article

A Shortest-Path Algorithm for the Departure Time and Speed Optimization Problem

Author

Listed:
  • Anna Franceschetti

    (Distribution Management, HEC Montréal, Montréal, Québec H3T 2A7, Canada)

  • Dorothée Honhon

    (Naveen Jindal School of Management, University of Texas at Dallas, Richardson, Texas 75080)

  • Gilbert Laporte

    (Distribution Management, HEC Montréal, Montréal, Québec H3T 2A7, Canada)

  • Tom Van Woensel

    (School of Industrial Engineering, Eindhoven University of Technology, 5600 MB Eindhoven, Netherlands)

Abstract

We present a shortest-path algorithm for the departure time and speed optimization problem under traffic congestion. The objective of the problem is to determine an optimal schedule for a vehicle visiting a fixed sequence of customer locations to minimize a total cost function encompassing emissions cost and labor cost. We account for the presence of traffic congestion, which limits the vehicle speed during peak hours. We show how to cast this problem as a shortest-path problem by exploiting some structural results of the optimal solution. We illustrate the solution method and discuss some properties of the problem.

Suggested Citation

  • Anna Franceschetti & Dorothée Honhon & Gilbert Laporte & Tom Van Woensel, 2018. "A Shortest-Path Algorithm for the Departure Time and Speed Optimization Problem," Transportation Science, INFORMS, vol. 52(4), pages 756-768, August.
    • Handle: RePEc:inm:ortrsc:v:52:y:2018:i:4:p:756-768
    DOI: 10.1287/trsc.2018.0820
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/trsc.2018.0820
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.2018.0820?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
    ---><---

    References listed on IDEAS

    as
    1. K Fagerholt & G Laporte & I Norstad, 2010. "Reducing fuel emissions by optimizing speed on shipping routes," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(3), pages 523-529, March.
    2. Christos Kontovas & Harilaos N. Psaraftis, 2011. "Reduction of emissions along the maritime intermodal container chain: operational models and policies," Maritime Policy & Management, Taylor & Francis Journals, vol. 38(4), pages 451-469, March.
    3. Barth, Matthew & Younglove, Theodore & Scora, George, 2005. "Development of a Heavy-Duty Diesel Modal Emissions and Fuel Consumption Model," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt67f0v3zf, Institute of Transportation Studies, UC Berkeley.
    4. Lindstad, Haakon & Asbjørnslett, Bjørn E. & Strømman, Anders H., 2011. "Reductions in greenhouse gas emissions and cost by shipping at lower speeds," Energy Policy, Elsevier, vol. 39(6), pages 3456-3464, June.
    5. Demir, Emrah & Bektaş, Tolga & Laporte, Gilbert, 2012. "An adaptive large neighborhood search heuristic for the Pollution-Routing Problem," European Journal of Operational Research, Elsevier, vol. 223(2), pages 346-359.
    6. 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.
    7. Harilaos N. Psaraftis & Christos A. Kontovas, 2016. "Green Maritime Transportation: Speed and Route Optimization," International Series in Operations Research & Management Science, in: Harilaos N. Psaraftis (ed.), Green Transportation Logistics, edition 127, chapter 0, pages 299-349, Springer.
    8. Kramer, Raphael & Maculan, Nelson & Subramanian, Anand & Vidal, Thibaut, 2015. "A speed and departure time optimization algorithm for the pollution-routing problem," European Journal of Operational Research, Elsevier, vol. 247(3), pages 782-787.
    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. Daiane Maria Genaro Chiroli & Sérgio Fernando Mayerle & João Neiva Figueiredo, 2022. "Using state-space shortest-path heuristics to solve the long-haul point-to-point vehicle routing and driver scheduling problem subject to hours-of-service regulatory constraints," Journal of Heuristics, Springer, vol. 28(1), pages 23-59, February.
    2. Tom Woensel, 2019. "Comments on: Perspectives on integer programming for time-dependent models," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 27(2), pages 180-183, July.
    3. Xing, Zheng & Liu, Haitao & Wang, Tingsong & Chew, Ek Peng & Lee, Loo Hay & Tan, Kok Choon, 2023. "Integrated automated guided vehicle dispatching and equipment scheduling with speed optimization," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 169(C).
    4. Edward He & Natashia Boland & George Nemhauser & Martin Savelsbergh, 2021. "Time-Dependent Shortest Path Problems with Penalties and Limits on Waiting," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 997-1014, 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. Bektaş, Tolga & Ehmke, Jan Fabian & Psaraftis, Harilaos N. & Puchinger, Jakob, 2019. "The role of operational research in green freight transportation," European Journal of Operational Research, Elsevier, vol. 274(3), pages 807-823.
    2. 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).
    3. Mohammad Asghari & Seyed Mohammad Javad Mirzapour Al-E-Hashem, 2021. "Green vehicle routing problem: A state-of-the-art review," Post-Print hal-03182944, HAL.
    4. 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.
    5. Qiu, Rui & Xu, Jiuping & Ke, Ruimin & Zeng, Ziqiang & Wang, Yinhai, 2020. "Carbon pricing initiatives-based bi-level pollution routing problem," European Journal of Operational Research, Elsevier, vol. 286(1), pages 203-217.
    6. 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.
    7. Xiao, Yiyong & Zuo, Xiaorong & Huang, Jiaoying & Konak, Abdullah & Xu, Yuchun, 2020. "The continuous pollution routing problem," Applied Mathematics and Computation, Elsevier, vol. 387(C).
    8. He, Qie & Zhang, Xiaochen & Nip, Kameng, 2017. "Speed optimization over a path with heterogeneous arc costs," Transportation Research Part B: Methodological, Elsevier, vol. 104(C), pages 198-214.
    9. Gilbert Laporte, 2016. "Scheduling issues in vehicle routing," Annals of Operations Research, Springer, vol. 236(2), pages 463-474, January.
    10. Kramer, Raphael & Subramanian, Anand & Vidal, Thibaut & Cabral, Lucídio dos Anjos F., 2015. "A matheuristic approach for the Pollution-Routing Problem," European Journal of Operational Research, Elsevier, vol. 243(2), pages 523-539.
    11. Brunner, Carlos & Giesen, Ricardo & Klapp, Mathias A. & Flórez-Calderón, Luz, 2021. "Vehicle routing problem with steep roads," Transportation Research Part A: Policy and Practice, Elsevier, vol. 151(C), pages 1-17.
    12. Onur Can Saka & Sinan Gürel & Tom Van Woensel, 2017. "Using cost change estimates in a local search heuristic for the pollution routing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(2), pages 557-587, March.
    13. 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.
    14. Koç, Çağrı & Bektaş, Tolga & Jabali, Ola & Laporte, Gilbert, 2016. "The impact of depot location, fleet composition and routing on emissions in city logistics," Transportation Research Part B: Methodological, Elsevier, vol. 84(C), pages 81-102.
    15. Said Dabia & Emrah Demir & Tom Van Woensel, 2017. "An Exact Approach for a Variant of the Pollution-Routing Problem," Transportation Science, INFORMS, vol. 51(2), pages 607-628, May.
    16. Ricardo Fukasawa & Qie He & Fernando Santos & Yongjia Song, 2018. "A Joint Vehicle Routing and Speed Optimization Problem," INFORMS Journal on Computing, INFORMS, vol. 30(4), pages 694-709, November.
    17. Turkensteen, Marcel, 2017. "The accuracy of carbon emission and fuel consumption computations in green vehicle routing," European Journal of Operational Research, Elsevier, vol. 262(2), pages 647-659.
    18. Demir, Emrah & Bektaş, Tolga & Laporte, Gilbert, 2014. "A review of recent research on green road freight transportation," European Journal of Operational Research, Elsevier, vol. 237(3), pages 775-793.
    19. Soysal, Mehmet & Bloemhof-Ruwaard, Jacqueline M. & Haijema, Rene & van der Vorst, Jack G.A.J., 2015. "Modeling an Inventory Routing Problem for perishable products with environmental considerations and demand uncertainty," International Journal of Production Economics, Elsevier, vol. 164(C), pages 118-133.
    20. Franceschetti, Anna & Demir, Emrah & Honhon, Dorothée & Van Woensel, Tom & Laporte, Gilbert & Stobbe, Mark, 2017. "A metaheuristic for the time-dependent pollution-routing problem," European Journal of Operational Research, Elsevier, vol. 259(3), pages 972-991.

    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:inm:ortrsc:v:52:y:2018:i:4:p:756-768. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.