.png){kind=icon}
返回
A genetic algorithm using priority-based encoding with new operators for fixed charge transportation problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2012.11.016.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we propose a genetic algorithm using priority-based encoding (pb-GA) for linear and non-linear fixed charge transportation problems (fcTP) in which new operators for more exploration are proposed. We modify a priority-based decoding procedure proposed by Gen et al. [1] to adapt with the fcTP structure. After comparing well-known representation methods for a transportation problem, we explain our proposed pb-GA. We compare the performance of the pb-GA with the recently used spanning tree-based genetic algorithm (st-GA) using numerous examples of linear and nonlinear fcTPs. Finally, computational results show that the proposed pb-GA gives better results than the st-GA both in terms of the solution quality and computation time, especially for medium- and large-sized problems. Numerical experiments show that the proposed pb-GA better absorbs the characteristics of the nonlinear fcTPs. (C) 2012 Elsevier B.V. All rights reserved.
Keyword:
Fixed charge transportation problem
Priority-based genetic algorithm
Spanning tree-based genetic algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
引用论文
.png){kind=icon}
A genetic algorithm based heuristic to the multi-period fixed charge distribution problem基于遗传算法的多周期固定费用分配问题的启发式求解
PREAI
分享收藏
查看更多内容