Towards probabilistic memetic algorithm: An initial study on capacitated arc routing problem

Capacitated arc routing problem (CARP) has attracted much attention due to its generality to many real world problems. Memetic algorithm (MA), among other metaheuristic search methods, has been shown to achieve competitive performances in solving CARP ranging from small to medium size. In this paper...

Full description

Saved in:
Bibliographic Details
Main Authors: FENG, Liang, ONG, Yew-Soon, NGUYEN, Quang Huy, TAN, Ah-hwee
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2010
Subjects:
Online Access:https://ink.library.smu.edu.sg/sis_research/6802
https://ink.library.smu.edu.sg/context/sis_research/article/7805/viewcontent/Prob_MA_CEC_2010.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
id sg-smu-ink.sis_research-7805
record_format dspace
spelling sg-smu-ink.sis_research-78052022-01-27T08:32:00Z Towards probabilistic memetic algorithm: An initial study on capacitated arc routing problem FENG, Liang ONG, Yew-Soon NGUYEN, Quang Huy TAN, Ah-hwee Capacitated arc routing problem (CARP) has attracted much attention due to its generality to many real world problems. Memetic algorithm (MA), among other metaheuristic search methods, has been shown to achieve competitive performances in solving CARP ranging from small to medium size. In this paper we propose a formal probabilistic memetic algorithm for CARP that is equipped with an adaptation mechanism to control the degree of global exploration against local exploitation while the search progresses. Experimental study on benchmark instances of CARP showed that the proposed probabilistic scheme led to improved search performances when introduced into a recently proposed state-of-the-art MA. The results obtained on 24 instances of the capacitated arc routing problems highlighted the efficacy of the probabilistic scheme with 9 new best known solutions established. 2010-07-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/6802 info:doi/10.1109/CEC.2010.5585993 https://ink.library.smu.edu.sg/context/sis_research/article/7805/viewcontent/Prob_MA_CEC_2010.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Databases and Information Systems
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic Databases and Information Systems
spellingShingle Databases and Information Systems
FENG, Liang
ONG, Yew-Soon
NGUYEN, Quang Huy
TAN, Ah-hwee
Towards probabilistic memetic algorithm: An initial study on capacitated arc routing problem
description Capacitated arc routing problem (CARP) has attracted much attention due to its generality to many real world problems. Memetic algorithm (MA), among other metaheuristic search methods, has been shown to achieve competitive performances in solving CARP ranging from small to medium size. In this paper we propose a formal probabilistic memetic algorithm for CARP that is equipped with an adaptation mechanism to control the degree of global exploration against local exploitation while the search progresses. Experimental study on benchmark instances of CARP showed that the proposed probabilistic scheme led to improved search performances when introduced into a recently proposed state-of-the-art MA. The results obtained on 24 instances of the capacitated arc routing problems highlighted the efficacy of the probabilistic scheme with 9 new best known solutions established.
format text
author FENG, Liang
ONG, Yew-Soon
NGUYEN, Quang Huy
TAN, Ah-hwee
author_facet FENG, Liang
ONG, Yew-Soon
NGUYEN, Quang Huy
TAN, Ah-hwee
author_sort FENG, Liang
title Towards probabilistic memetic algorithm: An initial study on capacitated arc routing problem
title_short Towards probabilistic memetic algorithm: An initial study on capacitated arc routing problem
title_full Towards probabilistic memetic algorithm: An initial study on capacitated arc routing problem
title_fullStr Towards probabilistic memetic algorithm: An initial study on capacitated arc routing problem
title_full_unstemmed Towards probabilistic memetic algorithm: An initial study on capacitated arc routing problem
title_sort towards probabilistic memetic algorithm: an initial study on capacitated arc routing problem
publisher Institutional Knowledge at Singapore Management University
publishDate 2010
url https://ink.library.smu.edu.sg/sis_research/6802
https://ink.library.smu.edu.sg/context/sis_research/article/7805/viewcontent/Prob_MA_CEC_2010.pdf
_version_ 1770576071705493504