.png){kind=icon}
.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
combinatorial optimization
segregated storage problems
heuristics
population-based algorithms
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available