A memory efficient stochastic evolution based algorithm for the multi-objective shortest path problem
Authors:
- Umair F. SiddiqiUSUmair F. Siddiqi
- Yoichi ShiraishiYSYoichi Shiraishi
- Mona DahbMDMona Dahb
- Sadiq M. SaitSSSadiq M. Sait
- 1 January 2014
- journal article
- Published by Elsevier in Applied Soft Computing
- Vol. 14, 653-662
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Non-Dominated Sorting Genetic Algorithm Based on Reinforcement Learning to Optimization of Broad-Band Reflector Antennas SatelliteIEEE Transactions on Magnetics, 2012
- Exploring the Runtime of an Evolutionary Algorithm for the Multi-Objective Shortest Path ProblemEvolutionary Computation, 2010
- Dominance-Based Multiobjective Simulated AnnealingIEEE Transactions on Evolutionary Computation, 2008
- Multiobjective Electromagnetic Optimization Based on a Nondominated Sorting Genetic Approach With a Chaotic Crossover OperatorIEEE Transactions on Magnetics, 2008
- Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-Linear Objectives with ApplicationsTheory of Computing Systems, 2007
- Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard AlgorithmsInternational Journal of Applied Mathematics and Computer Science, 2007
- Service restoration in distribution system using non-dominated sorting genetic algorithmElectric Power Systems Research, 2006
- A genetic algorithm for shortest path routing problem and the sizing of populationsIEEE Transactions on Evolutionary Computation, 2002
- A fast and elitist multiobjective genetic algorithm: NSGA-IIIEEE Transactions on Evolutionary Computation, 2002
- Approximating the Nondominated Front Using the Pareto Archived Evolution StrategyEvolutionary Computation, 2000