An NSGA-II algorithm for the green vehicle routing problem

76Citations
Citations of this article
93Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we present and define the bi-objective Green Vehicle Routing Problem GVRP in the context of green logistics. The bi-objective GVRP states for the problem of finding routes for vehicles to serve a set of customers while minimizing the total traveled distance and the co 2 emissions. We review emission factors and techniques employed to estimate co 2 emissions and integrate them into the GVRP definition and model. We apply the NSGA-II evolutionary algorithm to solve GVRP benchmarks and perform statistical analysis to evaluate and validate the obtained results. The results show that the algorithm obtain good results and prove the explicit interest grant to emission minimization objective. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Jemai, J., Zekri, M., & Mellouli, K. (2012). An NSGA-II algorithm for the green vehicle routing problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7245 LNCS, pp. 37–48). https://doi.org/10.1007/978-3-642-29124-1_4

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