.png){kind=icon}
返回
Supporting supply process in charitable organizations by genetic algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2015.06.023.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The paper concerns the optimization problem arising in charitable organizations during supply process. Such institutions are especially interested in minimizing the cost of purchase which consists of the prices at which particular products are bought as well as of the cost of their transportation. We present the formal mathematical model of the problem and the lower bound for the criterion value. We propose a genetic algorithm and the specialized list heuristic approach solving the case, which we prove is strongly NP-hard. The efficiency of implemented methods was checked in extensive computational experiments. The proposed algorithms have been integrated with the software system designed with a view of supporting charitable organizations. (C) 2015 Elsevier Ltd. All rights reserved.
Keyword:
Computer applications
Genetic algorithms
Scheduling
Order completion and delivery problem
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
引用论文
.png){kind=icon}
THE TRAVELING SALESMAN PROBLEM - AN OVERVIEW OF EXACT AND APPROXIMATE ALGORITHMS旅行商问题-精确算法和近似算法的概述
PREAI
分享收藏
分享收藏分享收藏
查看更多内容