Methods for the one-dimensional space allocation problem

DOI10.1016/0305-0548(90)90051-8MaRDI QIDQ916571zbMATH OpenOpenAlexFDO

Authors Elsie Sterbin Gottlieb

Publication date 1990

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0305-0548(90)90051-8

zbMATH Keywords

heuristicsone-dimensional space allocationsimulated annealing

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Combinatorial optimization (90C27) Dynamic programming (90C39)

Recommendations

• scientific article; zbMATH DE number 4211814
• Applied simulated annealing
• An improved annealing scheme for the QAP
• Simulated annealing applied to the process allocation problem
• Bin-packing by simulated annealing

Cites work

• A simulated annealing approach to the multiconstraint zero-one knapsack problem
• A thermodynamically motivated simulation procedure for combinatorial optimization problems
• An n log n Algorithm to Distribute n Records Optimally in a Sequential Access File
• Classification by ordering a (sparse) matrix: A ``simulated annealing approach
• Deux problèmes d'affectation non linéaires
• Equation of state calculations by fast computing machines
• Euclidean matching problems and the metropolis algorithm
• Finite-State Processes and Dynamic Programming
• scientific article; zbMATH DE number 3906193 (Why is no real title available?)
• Minimizing expected travel time on geometrical patterns by optimal probability rearrangements
• On Solving A One-Dimensional Space Allocation Problem With Integer Programming
• On the One-Dimensional Space Allocation Problem
• One-Dimensional Space Allocation: An Ordering Algorithm
• Optimal Linear Ordering
• Optimization by simulated annealing
• Placement of Records on a Secondary Storage Device to Minimize Access Time
• Some experiments with simulated annealing for coloring graphs
• Some Layout Problems on the Line with Interdistance Constraints and Costs
• Some simplified NP-complete graph problems
• The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
• The quadratic assignment problem
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm

Cited in

(15)

• A new lower bound for the single row facility layout problem
• Formulating and solving production planning problems
• The single row facility layout problem: state of the art
• An efficient genetic algorithm for single row facility layout
• A semidefinite optimization approach for the single-row layout problem with unequal dimensions
• The influence of the fitness evaluation method on the performance of multiobjective search algorithms
• Global approaches for facility layout and VLSI floorplanning
• Single row layout models
• Fast local search for single row facility layout
• Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem
• scientific article; zbMATH DE number 4211814 (Why is no real title available?)
• Insertion based Lin-Kernighan heuristic for single row facility layout
• A computational study and survey of methods for the single-row facility layout problem
• The multi-story space assignment problem
• A matheuristic for solving the single row facility layout problem

This page was built for publication: Methods for the one-dimensional space allocation problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q916571)