Capacitated arc routing problem in uncertain environments

Yi MEI; Ke TANG; Xin YAO

doi:10.1109/CEC.2010.5586031

Capacitated arc routing problem in uncertain environments

Yi MEI, Ke TANG, Xin YAO

Research output: Book Chapters | Papers in Conference Proceedings › Conference paper (refereed) › Research › peer-review

55 Citations (Scopus)

Abstract

In this paper, the Uncertain CARP (UCARP) is investigated. In UCARP, the demands of tasks and the deadheading costs of edges are stochastic and one has to design a robust solution for all possible environments. A problem model and a robustness measure for solutions are defined according to the requirements in reality. Three benchmark sets with uncertain parameters are generated by extending existing benchmark sets for static cases. In order to explore the solution space of UCARP, the most competitive algorithms for static CARP are tested on one of the generated uncertain benchmark sets. The experimental results showed that the optimal solution in terms of robustness in uncertain environment may be far away from the optimal one in terms of quality in a static environment and thus, utilizing only the expected value of the random variables can hardly lead to robust solutions. © 2010 IEEE.

Original language	English
Title of host publication	2010 IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010
DOIs	https://doi.org/10.1109/CEC.2010.5586031
Publication status	Published - Jul 2010
Externally published	Yes

Access to Document

10.1109/CEC.2010.5586031

Cite this

@inproceedings{3eb7ba6a39414e10a9380c4604a009b3,

title = "Capacitated arc routing problem in uncertain environments",

abstract = "In this paper, the Uncertain CARP (UCARP) is investigated. In UCARP, the demands of tasks and the deadheading costs of edges are stochastic and one has to design a robust solution for all possible environments. A problem model and a robustness measure for solutions are defined according to the requirements in reality. Three benchmark sets with uncertain parameters are generated by extending existing benchmark sets for static cases. In order to explore the solution space of UCARP, the most competitive algorithms for static CARP are tested on one of the generated uncertain benchmark sets. The experimental results showed that the optimal solution in terms of robustness in uncertain environment may be far away from the optimal one in terms of quality in a static environment and thus, utilizing only the expected value of the random variables can hardly lead to robust solutions. {\textcopyright} 2010 IEEE.",

author = "Yi MEI and Ke TANG and Xin YAO",

year = "2010",

month = jul,

doi = "10.1109/CEC.2010.5586031",

language = "English",

isbn = "9781424469109",

booktitle = "2010 IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010",

}

TY - GEN

T1 - Capacitated arc routing problem in uncertain environments

AU - MEI, Yi

AU - TANG, Ke

AU - YAO, Xin

PY - 2010/7

Y1 - 2010/7

N2 - In this paper, the Uncertain CARP (UCARP) is investigated. In UCARP, the demands of tasks and the deadheading costs of edges are stochastic and one has to design a robust solution for all possible environments. A problem model and a robustness measure for solutions are defined according to the requirements in reality. Three benchmark sets with uncertain parameters are generated by extending existing benchmark sets for static cases. In order to explore the solution space of UCARP, the most competitive algorithms for static CARP are tested on one of the generated uncertain benchmark sets. The experimental results showed that the optimal solution in terms of robustness in uncertain environment may be far away from the optimal one in terms of quality in a static environment and thus, utilizing only the expected value of the random variables can hardly lead to robust solutions. © 2010 IEEE.

AB - In this paper, the Uncertain CARP (UCARP) is investigated. In UCARP, the demands of tasks and the deadheading costs of edges are stochastic and one has to design a robust solution for all possible environments. A problem model and a robustness measure for solutions are defined according to the requirements in reality. Three benchmark sets with uncertain parameters are generated by extending existing benchmark sets for static cases. In order to explore the solution space of UCARP, the most competitive algorithms for static CARP are tested on one of the generated uncertain benchmark sets. The experimental results showed that the optimal solution in terms of robustness in uncertain environment may be far away from the optimal one in terms of quality in a static environment and thus, utilizing only the expected value of the random variables can hardly lead to robust solutions. © 2010 IEEE.

UR - http://www.scopus.com/inward/record.url?scp=79959439602&partnerID=8YFLogxK

U2 - 10.1109/CEC.2010.5586031

DO - 10.1109/CEC.2010.5586031

M3 - Conference paper (refereed)

SN - 9781424469109

BT - 2010 IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010

ER -

Capacitated arc routing problem in uncertain environments

Abstract

Access to Document

Other files and links

Fingerprint

Cite this