A morph-based simulated annealing heuristic for a modified bin-packing problem

Journal of the Operational Research Society

Volumn 48, Issue 4, 1997, Pages 433-439

  Brusco, M J ^a   Thompson, G M ^b   Jacobs, L W ^c  

^a FLORIDA STATE UNIVERSITY   (United States)

^b Cornell University ^*  (United States)

^c NORTHERN ILLINOIS UNIVERSITY   (United States)

Author keywords

Annealing; Bin packing; Heuristics; Simulated

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; HEURISTIC METHODS; MATHEMATICAL MODELS; PROCESS CONTROL; RANDOM PROCESSES; RESOURCE ALLOCATION; SCHEDULING; SIMULATED ANNEALING;

MEAN PERCENT ABOVE THE BEST KNOWN OBJECTIVE VALUE (MPABKOV); MODIFIED BIN PACKING PROBLEM (MBPP);

OPERATIONS RESEARCH;

EID: 0031121388     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2600356     Document Type: Article

References (18)

1. con®dence intervals. Comp Opns Res 15: 171-177.
2. Karp, M., (1972). Reducibility among combinatorial problems. In: Miller RE and Thatcher JW (eds). Complexity of Computer Computations. Plenum Press: New York.
3. Garey, M. R., Johnson, D. S., (1979). Computers and Intractability: A Guide to the Theory of NP Completeness. Freeman: San Francisco.
4. Sera®ni P (eds). Algorithm Design for Computer Systems Design. Springer-Verlag: The Netherlands, pp 49-106.
5. Johnson, D. S., et al (1974). Worst-case performance bounds for simple one dimensional packing algorithms. Siam J Comput 3: 299-325.
6. Ong, H. L, Magazine, M. J., Wee, T. S., (1984). Probabilistic analysis of bin packing heuristics. Opns Res 32: 983-998.
7. Anily, S., Bramel, J., Simchi-Levi, D., (1984). Worst-case analysis of heuristics for the bin packing problem with general cost structures. Opns Res 42: 287-298.
8. T. KaÈmpke., (1988). Simulated annealing: use of a new tool in bin packing. Ann Opns Res 16: 327-332.
9. Rao, R. L., Iyengar, S. S, (1994). Bin-packing by simulated annealing Computs. Math Applic 27: 71-82.
10. Metropolis, N., et al (1953). Equation of state calculations by fast computing machines. J Chem Phys 21: 1087-1092.
11. Kirkpatrick, S., Gellatt, Jr C. D., Vecchi, M. P., (1983). Optimization by simulated annealing. Science 220: 671-683.
12. Cerny, V., (1985). Thermodynamical approach to the travellingsalesman problem. J Optim Theory Appl 45: 41-51.
13. Cheh, K., Goldbert, D., Askin, R., (1991). A note on the effect ofneighborhood structure in simulated annealing. Comp Opns Res 18: 537-547.
14. Jacobs, L. W., Brusco, M. J., (1995). Note: A local-searchheuristic for large set-covering problems. Naval Res Log 42: 1129-1140.
15. Thompson, G. M, Brusco, M. J., Jacobs, L. W., (1995). A metaheuristic for coverage-correlated, minimum cardinality set-covering problems. Working paper, Cornell University: Ithaca, New York.
16. Vakharia, A. J., Chang, Y. L., (1990). A simulated annealing approach to scheduling a manufacturing. cell Naval Log 37: 559-577.
17. Brusco, M. J, Jacobs, L. W, (1993). A simulated annealing approach to the solution of ¯exible labour scheduling problems. J Opl Res Soc 44: 1191-1200.
18. Thompson, G. M., (1996). A simulated-annealing heuristic for shift scheduling using non-continously available employees. Comp Opns Res 23: 275-288