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


SOYSAL M., ÇİMEN M., ÖMÜRGÖNÜLŞEN M., Belbag S.

INTERNATIONAL JOURNAL OF BUSINESS ANALYTICS, cilt.6, sa.4, ss.1-11, 2019 (ESCI İndekslerine Giren Dergi) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 6 Konu: 4
  • Basım Tarihi: 2019
  • Doi Numarası: 10.4018/ijban.2019100101
  • Dergi Adı: INTERNATIONAL JOURNAL OF BUSINESS ANALYTICS
  • Sayfa Sayıları: ss.1-11

Özet

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.