当前位置: X-MOL 学术IEEE Comput. Intell. Mag. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Robust Optimization in Uncertain Capacitated Arc Routing Problems: Progresses and Perspectives [Review Article]
IEEE Computational Intelligence Magazine ( IF 10.3 ) Pub Date : 2021-02-01 , DOI: 10.1109/mci.2020.3039069
Jialin Liu , Ke Tang , Xin Yao

T he capacitated arc routing problem is an important NP-hard problem with numerous realworld applications. The capacitated arc routing problem with uncertainties refers to those instances where there are uncertainties in decision variables, objective functions and/or constraints. The capacitated arc routing problem with uncertainties captures real-world situations much better than a static capacitated arc routing problem because few real-world problems are static and certain. Uncertainties in the capacitated arc routing problem pose new research challenges. Algorithms that work well for a static and certain capacitated arc routing problem may not work on the version with uncertainties. There have been increasing progresses in studying the capacitated arc routing problem with uncertainties during the past two decades. However, the papers on the capacitated arc routing problem with uncertainties have been scattered around in different journals and conferences in artificial intelligence, computer science, and operational research. Different definitions and formulations of capacitated arc routing problem with uncertainties are used by different papers, making comparisons difficult. In order to better understand the state-of-the-art in solving the capacitated arc routing problem with uncertainties, this paper presents a comprehensive review of the problem and its key research issues. Not only has the paper summarized the progresses so far, key research issues are identified, including scalability of the algorithms, performance measures, common benchmarks, etc. Future research directions are also identified at the end of this review.

中文翻译:

不确定电容电弧路由问题的鲁棒优化:进展和前景 [评论文章]

电容化弧路由问题是一个重要的 NP 难问题,在许多实际应用中。具有不确定性的电容式电弧路由问题是指决策变量、目标函数和/或约束存在不确定性的那些实例。具有不确定性的电容式电弧布线问题比静态电容式电弧布线问题更能捕捉现实世界的情况,因为很少有现实世界的问题是静态的和确定的。电容式电弧路由问题的不确定性带来了新的研究挑战。适用于静态和某些电容式电弧布线问题的算法可能不适用于具有不确定性的版本。在过去的 20 年中,在研究具有不确定性的电容式电弧路由问题方面取得了越来越多的进展。然而,关于具有不确定性的电容化弧路由问题的论文散布在人工智能、计算机科学和运筹学领域的不同期刊和会议上。不同论文使用了具有不确定性的容性电弧路由问题的不同定义和公式,这使得比较变得困难。为了更好地理解解决具有不确定性的电容式电弧路由问题的最新技术,本文对该问题及其关键研究问题进行了全面回顾。该论文不仅总结了迄今为止的进展,还确定了关键的研究问题,包括算法的可扩展性、性能度量、通用基准等。在本综述的末尾还确定了未来的研究方向。
更新日期:2021-02-01
down
wechat
bug