.png){kind=icon}
返回
Nonlinear fixed charge transportation problem by spanning tree-based genetic algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2007.06.022.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Networks provide a useful way for modeling real world problems and are extensively used in many different types of systems: communications, hydraulic, mechanical, electronic, and logistics. The transportation problem (TP) is known as one of the important network problems. When the TP problem is associated with additional fixed cost for establishing the facilities or fulfilling the demand of customers, then it is called fixed charge transportation problem (fcTP). This problem is one of the NP-hard (IE/OR) problems that are difficult to solve using traditional methods. This paper aims to show the application of spanning tree-based Genetic Algorithm (GA) approach for solving nonlinear fixed charge transportation problem. Our new idea lies on the GA representation that includes the feasibility criteria and repairing procedure for the chromosome. Several numerical experimental results are presented to show the effectiveness of the proposed method. (c) 2007 Published by Elsevier Ltd.
Keyword:
nonlinear fixed charge problem
transportation problem
spanning tree-based genetic algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
分享收藏
查看更多内容