.png){kind=icon}
返回
Three approximation algorithms for solving the generalized segregated storage problem
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(02)00917-7.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The paper presents three approximation algorithms for solving the generalized segregated storage problem (GSSP). GSSP involves determining an optimal distribution of goods among a set of storage compartments with the segregation (physical separation) restrictions. GSSP is a new generalization of well-known segregated storage problem. The paper gives problem formulation and proposes three approximation algorithms for solving it: a specialized construction heuristic and two population-based algorithms: an evolutionary algorithm and a population learning algorithm. The algorithms are evaluated in computational experiments. The analysis of variance method was used for statistical analysis of obtained results. (C) 2003 Elsevier B.V. All rights reserved.
Keyword:
combinatorial optimization
segregated storage problems
heuristics
population-based algorithms
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
查看更多内容