A Hybrid genetic algorithm for multi-trip green capacitated Arc routing problem in the scope of urban services

43Citations
Citations of this article
32Readers
Mendeley users who have this article in their library.

Abstract

Greenhouse gases (GHG) are the main reason for the global warming during the past decades. On the other hand, establishing a well-structured transportation system will yield to create least cost-pollution. This paper addresses a novel model for the multi-trip Green Capacitated Arc Routing Problem (G-CARP) with the aim of minimizing total cost including the cost of generation and emission of greenhouse gases, the cost of vehicle usage and routing cost. The cost of generation and emission of greenhouse gases is based on the calculation of the amount of carbon dioxide emitted from vehicles, which depends on such factors as the vehicle speed, weather conditions, load on the vehicle and traveled distance. The main applications of this problem are in municipalities for urban waste collection, road surface marking and so forth. Due to NP-hardness of the problem, a Hybrid Genetic Algorithm (HGA) is developed, wherein a heuristic and simulated annealing algorithm are applied to generate initial solutions and a Genetic Algorithm (GA) is then used to generate the best possible solution. The obtained numerical results indicate that the proposed algorithm could present desirable performance within a suitable computational run time. Finally, a sensitivity analysis is implemented on the maximum available time of the vehicles in order to determine the optimal policy.

Cite

CITATION STYLE

APA

Tirkolaee, E. B., Hosseinabadi, A. A. R., Soltani, M., Sangaiah, A. K., & Wang, J. (2018). A Hybrid genetic algorithm for multi-trip green capacitated Arc routing problem in the scope of urban services. Sustainability (Switzerland), 10(5). https://doi.org/10.3390/su10051366

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free