.png){kind=icon}
返回
An efficient memetic algorithm for the uncapacitated single allocation hub location problem
.png){kind=icon}
PRE
AI
DOI：10.1007/s00500-012-0919-0.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we present a memetic algorithm (MA) for solving the uncapacitated single allocation hub location problem (USAHLP). Two efficient local search heuristics are designed and implemented in the frame of an evolutionary algorithm in order to improve both the location and allocation part of the problem. Computational experiments, conducted on standard CAB/AP hub data sets (Beasley in J Global Optim 8:429-433, 1996) and modified AP data set with reduced fixed costs (Silva and Cunha in Computer Oper Res 36:3152-3165, 2009), show that the MA approach is superior over existing heuristic approaches for the USAHLP. For several large-scale AP instances up to 200 nodes, the MA improved the best-known solutions from the literature until now. Numerical results on instances with 300 and 400 nodes introduced in Silva and Cunha (Computer Oper Res 36:3152-3165, 2009) show significant improvements in the sense of both solution quality and CPU time. The robustness of the MA was additionally tested on a challenging set of newly generated large-scale instances with 520-900 nodes. To the best of our knowledge, these are the largest USAHLP problem dimensions solved in the literature until now. In addition, in this paper, we report for the first time optimal solutions for 30 AP and modified AP instances.
Keyword:
Memetic algorithms
Network design
Hub location problems
Local search
期刊
IF:
2.5
论文数:
1.0W
被引数:
2.1W
机构
引用论文
.png){kind=icon}
Laser-Induced Breakdown Spectroscopy (LIBS) Analysis of Calcium Ions Dissolved in Water Using Filter Paper Substrates: An Ideal Internal Standard for Precision Improvement使用滤纸基底对溶解在水中的钙离子进行激光诱导击穿光谱 (LIBS) 分析: 提高精度的理想内标
PREAI
分享收藏Solution algorithms for the capacitated single allocation hub location problem容量受限的单分配枢纽选址问题的求解算法
PREAI
分享收藏分享收藏
查看更多内容