A SIMULATED ANNEALING HEURISTIC FOR THE GREEN VEHICLE ROUTING PROBLEM

  • Moch Yasin Program Studi Sistem Informasi Fakultas Sains dan Teknologi UIN Sunan Ampel Surabaya
  • Vincent F. Yu Department of Industrial Management, National Taiwan University of Science and Technology

Abstract

Nowadays, the encouragement of the use of green vehicle is greater than it previously has ever been. In the United States, transportation sector is responsible for 28% of national greenhouse gas emissions in 2009. Therefore, there have been many studies devoted to the green supply chain management including the green vehicle routing problem (GVRP). GVRP plays a very important role in helping organizations with alternative fuel-powered vehicle fleets overcome obstacles resulted from limited vehicle driving range in conjunction with limited fuel infrastructure. The objective of GVRP is to minimize total distance traveled by the alternative fuel vehicle fleet. This study develops a mathematical model and a simulated annealing (SA) heuristic for the GVRP. Computational results indicate that the SA heuristic is capable of obtaining good GVRP solutions within a reasonable amount of time.

Downloads

Download data is not yet available.
Published
2015-12-01
How to Cite
YASIN, Moch; F. YU, Vincent. A SIMULATED ANNEALING HEURISTIC FOR THE GREEN VEHICLE ROUTING PROBLEM. Information System and Informatics Journal, [S.l.], v. 1, n. 2, p. 17-21, dec. 2015. ISSN 2460-8092. Available at: <http://systemic.uinsby.ac.id/index.php/SYSTEMIC/article/view/15>. Date accessed: 23 sep. 2017.
Section
Articles

Keywords

Alternative fuel vehicle; green vehicle routing problem; simulated annealing