A memetic algorithm for uncertain Capacitated Arc Routing Problems

The Capacitated Arc Routing Problem (CARP) is a widely investigated classic combinatorial optimization problem. Being a deterministic model, it is far away from the real world. A more practical problem model of CARP is the Uncertain CARP (UCARP), with the objective of finding a robust solution which...

Full description

Saved in:
Bibliographic Details
Published in:2013 IEEE Workshop on Memetic Computing (MC) pp. 72 - 79
Main Authors: Juan Wang, Ke Tang, Xin Yao
Format: Conference Proceeding
Language:English
Published: IEEE 01.04.2013
Subjects:
evolutionary algorithm
Maintenance engineering
Memetics
Optimization
robust optimization
Robustness
Sociology
Statistics
UCARP
Vehicles
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract The Capacitated Arc Routing Problem (CARP) is a widely investigated classic combinatorial optimization problem. Being a deterministic model, it is far away from the real world. A more practical problem model of CARP is the Uncertain CARP (UCARP), with the objective of finding a robust solution which performs well in all possible environments. There exist few algorithms for UCARP in previous work. In this paper, a Memetic Algorithm (MA) and its modified version in time consumption for UCARP are proposed. Experimental results on two benchmark test sets show that with an integrated fitness function and a large step-size local search operator, the new MAs show excellent ability to find robust solutions for UCARP. We also present a less time-consuming version of our MA which shows significant advantages in time consumption.
AbstractList The Capacitated Arc Routing Problem (CARP) is a widely investigated classic combinatorial optimization problem. Being a deterministic model, it is far away from the real world. A more practical problem model of CARP is the Uncertain CARP (UCARP), with the objective of finding a robust solution which performs well in all possible environments. There exist few algorithms for UCARP in previous work. In this paper, a Memetic Algorithm (MA) and its modified version in time consumption for UCARP are proposed. Experimental results on two benchmark test sets show that with an integrated fitness function and a large step-size local search operator, the new MAs show excellent ability to find robust solutions for UCARP. We also present a less time-consuming version of our MA which shows significant advantages in time consumption.
Author Juan Wang
Ke Tang
Xin Yao
Author_xml – sequence: 1
  surname: Juan Wang
  fullname: Juan Wang
  email: jingze@mail.ustc.edu.cn
  organization: Sch. of Comput. Sci. & Technol., Univ. of Sci. & Technol. of China, Hefei, China
– sequence: 2
  surname: Ke Tang
  fullname: Ke Tang
  email: ketang@ustc.edu.cn
  organization: Sch. of Comput. Sci. & Technol., Univ. of Sci. & Technol. of China, Hefei, China
– sequence: 3
  surname: Xin Yao
  fullname: Xin Yao
  email: x.yao@cs.bham.ac.uk
  organization: Sch. of Comput. Sci. & Technol., Univ. of Sci. & Technol. of China, Hefei, China
BookMark eNotz7tOwzAUgGEjwQClMwOLXyDBx058GUMEFKkIhLpXx85xsZRL5boDb89Ap3_7pP-OXc_LTIw9gKgBhHv66GspQNVaCytBXLG1MxYabVRrHYhb9tzxiSYqKXAcD0tO5Wficcn8PAfKBdPMezxiSAULDbzLgX8v55LmA__Kix9pOt2zm4jjidaXrtju9WXXb6rt59t7322r5ESp9NCYxpsGrI84RC1cDNpr8gERmuDBkAmtl0PANjogYZXGqKREkIP1Sq3Y4z-biGh_zGnC_Lu_jKk_4sVHWA
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/MC.2013.6608210
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Statistics
EISBN 9781467358910
1467358916
EndPage 79
ExternalDocumentID 6608210
Genre orig-research
GroupedDBID 6IE
6IL
CBEJK
RIE
RIL
ID FETCH-LOGICAL-i90t-6d474b7418bfadf609fc6b6ebcaa14cb17e7c5b2dca5f91e0836af322a12d8b33
IEDL.DBID RIE
IngestDate Thu Jun 29 18:36:40 EDT 2023
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i90t-6d474b7418bfadf609fc6b6ebcaa14cb17e7c5b2dca5f91e0836af322a12d8b33
PageCount 8
ParticipantIDs ieee_primary_6608210
PublicationCentury 2000
PublicationDate 2013-April
PublicationDateYYYYMMDD 2013-04-01
PublicationDate_xml – month: 04
  year: 2013
  text: 2013-April
PublicationDecade 2010
PublicationTitle 2013 IEEE Workshop on Memetic Computing (MC)
PublicationTitleAbbrev MC
PublicationYear 2013
Publisher IEEE
Publisher_xml – name: IEEE
Score 1.5870912
Snippet The Capacitated Arc Routing Problem (CARP) is a widely investigated classic combinatorial optimization problem. Being a deterministic model, it is far away...
SourceID ieee
SourceType Publisher
StartPage 72
SubjectTerms evolutionary algorithm
Maintenance engineering
Memetics
Optimization
robust optimization
Robustness
Sociology
Statistics
UCARP
Vehicles
Title A memetic algorithm for uncertain Capacitated Arc Routing Problems
URI https://ieeexplore.ieee.org/document/6608210
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV05T8MwFH4qFUMnjhZxywMjaWMnseOxVFQMUHXo0K3y8QxItEWl5ffjl0QgJBY2y7Ic6UXOZ8ffAXBTFBTmkMtEeGWTPJMmiTgTl7tBLL0iB_DKZ_ZRTSblfK6nLbj91sIgYkU-wz41q7t8v3Y7-lU2kDICFump9pSStVarcevhqR48jYiplfWbUb_iUiq0GB_87zmH0PuR3bHpN6AcQQtXx9Ch7WDtptyFuyFb4pJ0h8y8Pa_jwf5lyeK2k0V0qu_22SiinyPhGHo23DhGlJ84G01MyTEfPZiN72ejh6RJQUhedbpNpM9Vbsljxgbjg0x1cNJK4jAZnjvLFSpXWOGdKYLmSG7TJsRlarjwpc2yE2iv1is8BZYGV4rgfZYKnXONBrnxaalC_N4JFfQZdKkWi_fa52LRlOH87-4L6IgqGoJYLJfQ3m52eAX77jPWZHNdvZwvtBGSiQ
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1JTwIxFH4haCInFzDu9uDRgVnb6RGJBCMQDhy4kS6vaiKDQfD32zdMMCZevDVN00nepPO1028BuMsyCnNIeRBboYM04SrwOOOXu0LMrSAH8NJndijG43w2k5Ma3O-0MIhYks-wTc3yLt8uzYZ-lXU494BFeqo9Ss6q1FqVX08Uys6oR1ytpF2N-xWYUuJF__B_TzqC1o_wjk12kHIMNSxOoEEbwq2fchMeumyBC1IeMvX-svRH-9cF8xtP5vFpe7vPeh7_DEnH0LLuyjAi_fjZaGLKjvlswbT_OO0NgioHIXiT4TrgNhWpJpcZ7ZR1PJTOcM2JxaSi1OhIoDCZjq1RmZMRkt-0cn6hqii2uU6SU6gXywLPgIXO5LGzNgljmUYSFUbKhrlw_osXCyfPoUm1mH9snS7mVRku_u6-hYPBdDScD5_Gz5fQiMugCOK0XEF9vdrgNeybL1-f1U35or4BhMeV0g
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2013+IEEE+Workshop+on+Memetic+Computing+%28MC%29&rft.atitle=A+memetic+algorithm+for+uncertain+Capacitated+Arc+Routing+Problems&rft.au=Juan+Wang&rft.au=Ke+Tang&rft.au=Xin+Yao&rft.date=2013-04-01&rft.pub=IEEE&rft.spage=72&rft.epage=79&rft_id=info:doi/10.1109%2FMC.2013.6608210&rft.externalDocID=6608210