Multi-objective optimal path selection in electric vehicles

Authors:
Umair Farooq Siddiqi;Yoichi Shiraishi;Sadiq M. Sait
Affiliations:
Department of Production Science and Technology, Gunma University, Ota, Japan;Department of Production Science and Technology, Gunma University, Ota, Japan;Department of Computer Engineering, King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia
Venue:
Artificial Life and Robotics
Year:
2012

Citing 8
Cited 1

Iterative Computer Algorithms with Applications in Engineering: Solving Combinatorial Optimization Problems

Iterative Computer Algorithms with Applications in Engineering: Solving Combinatorial Optimization Problems
Computers and Intractability; A Guide to the Theory of NP-Completeness

Computers and Intractability; A Guide to the Theory of NP-Completeness
Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms

International Journal of Applied Mathematics and Computer Science
A non-dominated sorting particle swarm optimizer for multiobjective optimization

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Efficient Routing on Large Road Networks Using Hierarchical Communities

IEEE Transactions on Intelligent Transportation Systems
A fast and elitist multiobjective genetic algorithm: NSGA-II

IEEE Transactions on Evolutionary Computation
A genetic algorithm for shortest path routing problem and the sizing of populations

IEEE Transactions on Evolutionary Computation
ParEGO: a hybrid algorithm with on-line landscape approximation for expensive multiobjective optimization problems

IEEE Transactions on Evolutionary Computation

A memory efficient stochastic evolution based algorithm for the multi-objective shortest path problem

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work proposes a memory-efficient multi-objective optimization algorithm to perform optimal path selection (OPS) in electric vehicles (EVs). The proposed algorithm requires less computational time and executes efficiently on fast-processor-based embedded systems. It is a population-based simulated evolution algorithm that incorporates innovative functions for calculating the goodness of particles and performing the allocation operation. The goodness and allocation operations ensure the exploration of new paths and the preservation of Pareto-optimal solutions. We executed our algorithm on an Intel Celeron processor, which is also used in embedded systems and compared its performance with that of the non-dominated sorting genetic algorithm-II (NSGA-II). Our experiments used real road networks. The comparison shows that on an average, our algorithm found 5.5 % more Pareto-optimal solutions than NSGA-II. Therefore, our proposed algorithm is suitable for performing OPS in EVs.