Fiber-to-object assignment heuristics

doi:10.1016/S0377-2217(98)00193-3

Fiber-to-object assignment heuristics

1999-08-01

3

PRE

AI

DOI：10.1016/S0377-2217(98)00193-3

原文链接

原文求助

摘要

En 中文

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. (C) 1999 Elsevier Science B.V. All rights reserved.

Keyword:

heuristics

optimization

combinatorial analysis

astronomy

Fiber-to-object assignment heuristics

摘要

AI总结

期刊

机构

引用论文