arrow
Return

Multi-factorial evolutionary algorithm based novel solution approach for multi-objective pollution-routing problem

delete2019-04-01
delete53
PRE
AI
A
Amit Rauniyar
R
Rahul Nath
P
Pranab K. Muhuri *
DOI:10.1016/j.cie.2019.02.031delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
The rapid increase in transportation has led to alarming levels of pollution globally, which has, in turn adverse effects on both the environment and the health of people. This has motivated researchers to develop efficient solutions for limiting the fuel consumption of vehicles so that greenhouse gas emission can be reduced. The pollution emitted by a vehicle depends primarily on two controllable factors viz. load and distance traveled. This paper considers a Pollution-Routing Problem (PRP) formulation with two objectives, minimization of fuel consumption (CO2 emissions), and minimization of total distance to be traversed, and proposes a novel solution based on the well-known Non-Dominated Sorting Genetic Algorithm-II (NSGA-II). Since the problem requires optimization of several routes formed at the same time, traditional NSGA-II frameworks are incapable of handling it efficiently. Thus, we incorporate a new paradigm of evolutionary algorithm, called multi-factorial optimization into NSGA-II to solve the problem of several routes generated simultaneously. The results of our experiments with benchmark datasets confirm the feasibility of the proposed approach with better solutions and faster convergence.
Keywords:
Multi-factorial evolutionary algorithm
Multi-objective optimization
Pollution routing problem
NSGA-II, SPEA2
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Computers and Industrial Engineering cover
Computers and Industrial Engineering
IF:
6.5
Papers:
1.0W
Citations:
3.8W

Organization

S
south asian university (sau)
Scholars:
364
Papers: 338
Citations: 0