IDEAS home Printed from https://ideas.repec.org/a/igg/jban00/v6y2019i4p1-11.html
   My bibliography  Save this article

Performance Comparison of Two Recent Heuristics for Green Time Dependent Vehicle Routing Problem

Author

Listed:
  • Mehmet Soysal

    (Hacettepe University, Ankara, Turkey)

  • Mustafa Çimen

    (Hacettepe University, Ankara, Turkey)

  • Mine Ömürgönülşen

    (Hacettepe Universi, Ankara, Turkey)

  • Sedat Belbağ

    (Gazi University, Ankara, Turkey)

Abstract

This article concerns a green Time Dependent Capacitated Vehicle Routing Problem (TDCVRP) which is confronted in urban distribution planning. The problem is formulated as a Markovian Decision Process and a dynamic programming (DP) approach has been used for solving the problem. The article presents a performance comparison of two recent heuristics for the green TDCVRP that explicitly accounts for time dependent vehicle speeds and fuel consumption (emissions). These heuristics are the classical Restricted Dynamic Programming (RDP) algorithm, and the Simulation Based RDP that consists of weighted random sampling, RDP heuristic and simulation. The numerical experiments show that the Simulation Based Restricted Dynamic Programming heuristic can provide promising results within relatively short computational times compared to the classical Restricted Dynamic Programming for the green TDCVRP.

Suggested Citation

  • Mehmet Soysal & Mustafa Çimen & Mine Ömürgönülşen & Sedat Belbağ, 2019. "Performance Comparison of Two Recent Heuristics for Green Time Dependent Vehicle Routing Problem," International Journal of Business Analytics (IJBAN), IGI Global, vol. 6(4), pages 1-11, October.
    • Handle: RePEc:igg:jban00:v:6:y:2019:i:4:p:1-11
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJBAN.2019100101
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:igg:jban00:v:6:y:2019:i:4:p:1-11. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.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.