Welcome to the InfoSci Platform
Reference Hub4
Performance Comparison of Two Recent Heuristics for Green Time Dependent Vehicle Routing Problem

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

Mehmet Soysal, Mustafa Çimen, Mine Ömürgönülşen, Sedat Belbağ
Copyright: © 2019 |Volume: 6 |Issue: 4 |Pages: 11
ISSN: 2334-4547|EISSN: 2334-4555|EISBN13: 9781522568339|DOI: 10.4018/IJBAN.2019100101
Cite Article Cite Article

MLA

Soysal, Mehmet, et al. "Performance Comparison of Two Recent Heuristics for Green Time Dependent Vehicle Routing Problem." IJBAN vol.6, no.4 2019: pp.1-11. http://doi.org/10.4018/IJBAN.2019100101

APA

Soysal, M., Çimen, M., Ömürgönülşen, M., & Belbağ, S. (2019). Performance Comparison of Two Recent Heuristics for Green Time Dependent Vehicle Routing Problem. International Journal of Business Analytics (IJBAN), 6(4), 1-11. http://doi.org/10.4018/IJBAN.2019100101

Chicago

Soysal, Mehmet, et al. "Performance Comparison of Two Recent Heuristics for Green Time Dependent Vehicle Routing Problem," International Journal of Business Analytics (IJBAN) 6, no.4: 1-11. http://doi.org/10.4018/IJBAN.2019100101

Export Reference

Mendeley
Favorite Full-Issue Download

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.