Fiber-to-Object Assignment Heuristics

Abstract : Fiber-to-Object Assignment Problem (FOAP) comes from Astronomy. This geometrical and combinatorial problem is to arrange the maximum of segments – or rectangles – in the plane without crossovers. To solve this problem, we have recursively built a series of heuristic algorithms that converge on a maximal solution. Anyway the first elements of the series give good results quickly. They can be improved by post-optimization heuristics based on the same heuristics. Our results show that these heuristics are able to reach the best solution within a few minutes.
Document type :
Journal articles
Liste complète des métadonnées
Contributor : Lip6 Publications <>
Submitted on : Tuesday, September 8, 2015 - 10:13:34 AM
Last modification on : Monday, December 17, 2018 - 1:27:50 AM

Links full text




Francis Sourd, Philippe Chrétienne. Fiber-to-Object Assignment Heuristics. European Journal of Operational Research, Elsevier, 1999, 117 (1), pp.1-14. ⟨10.1016/S0377-2217(98)00193-3⟩. ⟨hal-01195565⟩



Record views