A Simulated Annealing Heuristic for the Capacitated Green Vehicle Routing Problem

Nur Mayke Eka Normasari, Vincent F. Yu, Candra Bachtiyar and Sukoyo

Mathematical Problems in Engineering, 2019, vol. 2019, 1-18

Abstract:

This research studies the capacitated green vehicle routing problem (CGVRP), which is an extension of the green vehicle routing problem (GVRP), characterized by the purpose of harmonizing environmental and economic costs by implementing effective routes to meet any environmental concerns while fulfilling customer demand. We formulate the mathematical model of the CGVRP and propose a simulated annealing (SA) heuristic for its solution in which the CGVRP is set up as a mixed integer linear program (MILP). The objective of the CGVRP is to minimize the total distance traveled by an alternative fuel vehicle (AFV). This research conducts a numerical experiment and sensitivity analysis. The results of the numerical experiment show that the SA algorithm is capable of obtaining good CGVRP solutions within a reasonable amount of time, and the sensitivity analysis demonstrates that the total distance is dependent on the number of customers and the vehicle driving range.

Date: 2019
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2019/2358258.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2019/2358258.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:2358258

DOI: 10.1155/2019/2358258

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().