id: 04154223
dt: j
an: 04154223
au: Romero, David; Sánchez-Flores, Adolfo
ti: Methods for the one-dimensional space allocation problem.
so: Comput. Oper. Res. 17, No.5, 465-473 (1990).
py: 1990
pu: Elsevier Science Ltd. (Pergamon), Oxford
la: EN
cc: 
ut: one-dimensional space allocation; heuristics; simulated annealing
ci: 
li: doi:10.1016/0305-0548(90)90051-8
ab: Summary: Although special cases of the one-dimensional space allocation
    problem (ODSAP) have been efficiently solved, like the so-called linear
    ordering problem with independent destinations, or the all prominent
    matrix case, the general problem appears redoubtable. So far, the use
    of known exact algorithms has been limited to small size problems, and
    for bigger problems very few heuristics have been devised. The best
    known solution methods for the ODSAP are contrasted here with several
    heuristics that incorporate the novel concept of simulated annealing.
    Various combinations of elementary interchange and insertion procedures
    are also studied. Our computational results confirm the suitability of
    simulated annealing to deal with this problem.
rv: