Methods for the one-dimensional space allocation problem

Abstract 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.

[1]  José M. Troya,et al.  An Approximation Algorithm for Reducing Expected Head Movement in Linear Storage Devices , 1981, Inf. Process. Lett..

[2]  John R. Doyle,et al.  Classification by ordering a (sparse) matrix: a “simulated annealing” approach , 1988 .

[3]  Maurice Queyranne,et al.  On the One-Dimensional Space Allocation Problem , 1981, Oper. Res..

[4]  Vaughan R. Pratt,et al.  An n log n Algorithm to Distribute n Records Optimally in a Sequential Access File , 1972, Complexity of Computer Computations.

[5]  F. Rendl,et al.  A thermodynamically motivated simulation procedure for combinatorial optimization problems , 1984 .

[6]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[7]  V. Cerný.  Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .

[8]  David Romero.  Variations sur l'effet Condorcet , 1978 .

[9]  Wayne E. Smith.  Various optimizers for single‐stage production , 1956 .

[10]  E. Bonomi,et al.  The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm , 1984 .

[11]  Philip M. Morse,et al.  Optimal Linear Ordering of Information Items , 1972, Oper. Res..

[12]  P. Hansen,et al.  Deux problèmes d'affectation non linéaires , 1982 .

[13]  D. Bounds.  New optimization methods from physics and biology , 1987, Nature.

[14]  E. Lawler.  The Quadratic Assignment Problem , 1963 .

[15]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[16]  Patrick P. Bergmans.  Minimizing Expected Travel Time on Geometrical Patterns by Optimal Probability Rearrangements , 1972, Inf. Control..

[17]  M. Held,et al.  Finite-State Processes and Dynamic Programming , 1967 .

[18]  Harvey F. Silverman,et al.  Placement of Records on a Secondary Storage Device to Minimize Access Time , 1973, JACM.

[19]  J. Y. Wong,et al.  On Solving A One-Dimensional Space Allocation Problem With Integer Programming , 1976 .

[20]  Richard L. Francis,et al.  Some Layout Problems on the Line with Interdistance Constraints and Costs , 1979, Oper. Res..

[21]  Thomas M. Liebling,et al.  Euclidean matching problems and the metropolis algorithm , 1986, Z. Oper. Research.

[22]  D. Werra,et al.  Some experiments with simulated annealing for coloring graphs , 1987 .

[23]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[24]  Donald M. Simmons.  One-Dimensional Space Allocation: An Ordering Algorithm , 1969, Oper. Res..