论文信息 - A stochastic approach to the bin-packing problem

A stochastic approach to the bin-packing problem

The process of gradually settling a combinatorial system into configurations of globally minimum energy has variously been called simulated annealing, statistical cooling, and so on. Very large combinatorial optimization problems have been solved using this technique. It has also been shown .that this method is effective in obtaining close-to-optimal solutions for problems known to be NP complete.

S. Sitharama Iyengar | Ramana L. Rao

[1] Jean-Marc Delosme,et al. Performance of a new annealing schedule , 1988, 25th ACM/IEEE, Design Automation Conference.Proceedings 1988..

[2] David S. Johnson,et al. Approximation Algorithms for Bin-Packing — An Updated Survey , 1984 .

[3] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

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

[6] Huang,et al. AN EFFICIENT GENERAL COOLING SCHEDULE FOR SIMULATED ANNEALING , 1986 .

[7] Mark Howard Jones,et al. A parallel simulated annealing algorithm for standard cell placement on a hypercube computer , 1987 .

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

[9] Kenneth J. Supowit,et al. Simulated Annealing Without Rejected Moves , 1986, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[10] Bruce Hajek,et al. A tutorial survey of theory and applications of simulated annealing , 1985, 1985 24th IEEE Conference on Decision and Control.