Decomposing Large-Scale Capacitated Arc Routing Problems using a Random Route Grouping Method

被引：0

作者：

Mei, Yi ^{[1
]}

Li, Xiaodong ^{[1
]}

Yao, Xin ^{[2
]}

机构：

[1] RMIT Univ, Sch Comp Sci & Informat Technol, Melbourne, Vic 3000, Australia

[2] Univ Birmingham, Sch Comp Sci, Birmingham B15 2TT, W Midlands, England

来源：

2013 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC) | 2013年

基金：

英国工程与自然科学研究理事会;

关键词：

SEARCH; ALGORITHM;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

In this paper, a simple but effective Random Route Grouping (RRG) scheme is developed to decompose the Large-Scale Capacitated Arc Routing Problem (LSCARP). A theoretical analysis is given to show that the decomposition is guaranteed to be improved by RRG along with the improvement of the best-sofar solution during the search process. Then, RRG is combined with a cooperative co-evolution model to solve LSCARP. The experimental results on the EGL-G LSCARP set showed that given the same computational budget, the proposed approach obtained much better results than its counterpart without using decomposition.

引用

页码：1013 / 1020

页数：8

共 50 条

[31] A random coordinate descent method for large-scale resource allocation problems
Necoara, I.
2012 IEEE 51ST ANNUAL CONFERENCE ON DECISION AND CONTROL (CDC), 2012, : 4474 - 4479
[32] Large-scale capacitated part-routing in the presence of process and routing flexibilities and setup costs
Diaby, M.
Nsakanda, A. L.
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2006, 57 (09) : 1100 - 1112
[33] Comparison of Differential Grouping and Random Grouping Methods on εCCPSO for Large-Scale Constrained Optimization
Peng, Chen
Hui, Qing
2016 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2016, : 2057 - 2063
[34] A very large-scale neighborhood search approach to capacitated warehouse routing problem
Geng, Y
Li, YZ
Lim, A
ICTAI 2005: 17TH IEEE INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2005, : 58 - 65
[35] A Developmental Solution to (Dynamic) Capacitated Arc Routing Problems using Genetic Programming
Weise, Thomas
Devert, Alexandre
Tang, Ke
PROCEEDINGS OF THE FOURTEENTH INTERNATIONAL CONFERENCE ON GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2012, : 831 - 838
[36] An Efficient Recursive Differential Grouping for Large-Scale Continuous Problems
Yang, Ming
Zhou, Aimin
Li, Changhe
Yao, Xin
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2021, 25 (01) : 159 - 171
[37] APPROXIMATE SOLUTIONS TO LARGE-SCALE CAPACITATED FACILITY LOCATION-PROBLEMS
SHETTY, B
APPLIED MATHEMATICS AND COMPUTATION, 1990, 39 (02) : 159 - 175
[38] Variable Decomposition for Large-Scale Constrained Optimization Problems Using a Grouping Genetic Algorithm
Carmona-Arroyo, Guadalupe
Quiroz-Castellanos, Marcela
Mezura-Montes, Efren
MATHEMATICAL AND COMPUTATIONAL APPLICATIONS, 2022, 27 (02)
[39] A MODEL FOR LARGE-SCALE AIRCRAFT ROUTING AND SCHEDULING PROBLEMS
SOUMIS, F
FERLAND, JA
ROUSSEAU, JM
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1980, 14 (1-2) : 191 - 201
[40] METHOD OF DECOMPOSING LARGE-SCALE SYSTEMS IN A STUDY OF STABILITY OF MOTION
KRAPIVNYI, YN
MARTYNYUK, AA
SOVIET APPLIED MECHANICS, 1988, 24 (08): : 810 - 816

← 1 2 3 4 5 →