arrow
Return

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

delete2014-01-01
delete13
PRE
AI
U
Umair F. Siddiqi *
S
Sadiq M. Sait
DOI:10.1016/j.asoc.2013.09.008delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Multi-objective shortest path (MOSP) problem aims to find the shortest path between a pair of source and a destination nodes in a network. This paper presents a stochastic evolution (StocE) algorithm for solving the MOSP problem. The proposed algorithm is a single-solution-based evolutionary algorithm (EA) with an archive for storing several non-dominant solutions. The solution quality of the proposed algorithm is comparable to the established population-based EAs. In StocE, the solution replaces its bad characteristics as the generations evolve. In the proposed algorithm, different sub-paths are the characteristics of the solution. Using the proposed perturb operation, it eliminates the bad sub-paths from generation to generation. The experiments were conducted on huge real road networks. The proposed algorithm is comparable to well-known single-solution and population-based EAs. The single-solution-based EAs are memory efficient, whereas, the population-based EAs are known for their good solution quality. The performance measures were the solution quality, speed and memory consumption, assessed by the hypervolume (HV) metric, total number of evaluations and memory requirements in megabytes. The HV metric of the proposed algorithm is superior to that of the existing single-solution and population-based EAs. The memory requirements of the proposed algorithm is at least half than the EAs delivering similar solution quality. The proposed algorithms also executes more rapidly than the existing single-solution-based algorithms. The experimental results show that the proposed algorithm is suitable for solving MOSP problems in embedded systems. (C) 2013 Elsevier B.V. All rights reserved.
Keywords:
Multi-objective shortest path
Multi-objective optimization
Stochastic evolution (StocE)
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

Applied Soft Computing cover
Applied Soft Computing
IF:
6.6
Papers:
1.4W
Citations:
4.8W

Organization

G
Gunma University
Scholars:
6.9K
Papers: 4.9K
Citations: 3.5K
Cited Papers

Cited Papers

Culture of Insect Tissues
err1954-03-01
err0
PREAI
errA. J. P. GOODCHILD
errShare
errSave
Dominance-based multiobjective simulated annealing
err2008-06-01
err100
errOAAI
errSmith, Kevin I.; Everson, Richard M.; Fieldsend, Jonathan E.; Murphy, Chris; Misra, Rashmi
errShare
errSave
A faster algorithm for calculating hypervolume
err2006-02-01
err759
PREAI
errWhile, L; Hingston, P; Barone, L; Huband, S
errShare
errSave
Machine Learning Techniques for the Segmentation of Tomographic Image Data of Functional Materials
err2019-06-25
err0
errOAAI
errOrkun Furat; Mingyan Wang; Matthias Neumann; Lukas Petrich; Matthias Weber; Carl E. Krill; Volker Schmidt
errShare
errSave
errShare
errSave
Long-term outcomes of surgery using the Ligament Advanced Reinforcement System as treatment for anterior cruciate ligament tears
err2022-02-01
err0
PREAI
errMaria A. Smolle; Stefan F. Fischerauer; Silvia Zötsch; Anna V. Kiegerl; Patrick Sadoghi; Gerald Gruber; Andreas Leithner; Gerwin A. Bernhardt
errShare
errSave
researcher View more