中文版 | English
Title

Evolving Robust Solutions to Uncertain Capacitated Arc Routing Problem with Time Window

Author
DOI
Publication Years
2022
Conference Name
IEEE Symposium Series on Computational Intelligence (IEEE SSCI)
ISBN
978-1-6654-8769-6
Source Title
Pages
488-495
Conference Date
4-7 Dec. 2022
Conference Place
Singapore, Singapore
Publication Place
345 E 47TH ST, NEW YORK, NY 10017 USA
Publisher
Abstract
The capacitated arc routing problem with time window has been studied for years, while uncertainties in real-world scenarios, such as uncertain demands and uncertain routing conditions, were rarely considered. In this paper, we formulate an uncertain capacitated arc routing problem with time window that takes into account the uncertain demand of tasks, the uncertain deadheading costs and the uncertain presence of tasks and paths. A number of problem instances are generated based on the benchmark instances of static capacitated arc routing problem with time window considering the aforementioned four uncertain factors. To tackle this new challenging problem, we adapt a state-of-the-art algorithm for solving uncertain capacitated arc routing problem, an estimation of distribution algorithm (EDA) with a stochastic local search, to find robust solutions. Another algorithm, a memetic algorithm with extended neighborhood search, is also adapted as a baseline solution algorithm to this challenging problems. Our experimental results indicate that our EDA-based algorithm is effective in finding robust solutions to uncertain capacitated arc routing problems with time window.
Keywords
SUSTech Authorship
First
Language
English
URL[Source Record]
Indexed By
Funding Project
SUSTech Undergraduate Teaching Quality and Reform Project[SJZLGC202101]
WOS Research Area
Computer Science
WOS Subject
Computer Science, Artificial Intelligence ; Computer Science, Interdisciplinary Applications ; Computer Science, Theory & Methods
WOS Accession No
WOS:000971973800066
Data Source
IEEE
PDF urlhttps://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10022223
Citation statistics
Cited Times [WOS]:0
Document TypeConference paper
Identifierhttp://kc.sustech.edu.cn/handle/2SGJ60CL/425460
DepartmentDepartment of Computer Science and Engineering
Affiliation
Department of Computer Science and Engineering, Southern University of Science and Technology
First Author AffilicationDepartment of Computer Science and Engineering
First Author's First AffilicationDepartment of Computer Science and Engineering
Recommended Citation
GB/T 7714
Shuo Huang,Yinxi Tian,Xintong Duan. Evolving Robust Solutions to Uncertain Capacitated Arc Routing Problem with Time Window[C]. 345 E 47TH ST, NEW YORK, NY 10017 USA:IEEE,2022:488-495.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Export to Excel
Export to Csv
Altmetrics Score
Google Scholar
Similar articles in Google Scholar
[Shuo Huang]'s Articles
[Yinxi Tian]'s Articles
[Xintong Duan]'s Articles
Baidu Scholar
Similar articles in Baidu Scholar
[Shuo Huang]'s Articles
[Yinxi Tian]'s Articles
[Xintong Duan]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Shuo Huang]'s Articles
[Yinxi Tian]'s Articles
[Xintong Duan]'s Articles
Terms of Use
No data!
Social Bookmark/Share
No comment.

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.