Multiobjective Particle Swarm Optimization with Improved Selection Strategy for Route Optimization
- 1 April 2019
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 205-209
Abstract
The Multiobjective Route Optimization (MORO) problem is an extension of the traditional single-object route optimization problem, which aims to find an effective path with several conflicting objectives. Many research studies used multiobjective evolutionary algorithm (MOEA) to solve MORO problem, however, they cannot achieve satisfactory results in both quality and computational speed. In this paper, an improved selection strategy based multiobjective particle swarm optimization (ISSMOPSO) is proposed for MORO. The improved selection strategy tactfully combines the advantages of vector evaluated genetic algorithm (VEGA) and Pareto dominating and dominated relationship based fitness function (PDDR-FF). The selection strategy based on VEGA has a preference for the edge region of the Pareto front, the PDDR-FF-based selection strategy has the tendency converging toward the center area of the Pareto front, which preserve both the convergence rate and the distribution performance. The experimental results show that the convergence of ISSMOPSO is better than comparison algorithms, and the diversity is close to NSGA-II and SPEA2 but better than traditional MOPSO.Keywords
This publication has 10 references indexed in Scilit:
- An External Archive-Guided Multiobjective Particle Swarm Optimization AlgorithmIEEE Transactions on Cybernetics, 2017
- Fuzzy particle swarm optimization algorithms for the open shortest path first weight setting problemApplied Intelligence, 2016
- Population recombination strategies for multi-objective particle swarm optimizationSoft Computing, 2016
- The Shortest Path Optimization Based on Mutation Particle Swarm Optimization AlgorithmAdvanced Materials Research, 2014
- Particle swarm optimization2014
- Hybrid sampling strategy-based multiobjective evolutionary algorithm for process planning and scheduling problemJournal of Intelligent Manufacturing, 2013
- A discrete particle swarm optimization with random selection solution for the shortest path problem2010
- A Comparison of Particle Swarm Optimization and the Genetic Algorithm2005
- Comparison among five evolutionary-based optimization algorithmsAdvanced Engineering Informatics, 2005
- Comparison between genetic algorithms and particle swarm optimization1998