Experiments with new stochastic global optimization search techniques

Computers and Operations Research

Volumn 27, Issue 9, 2000, Pages 841-865

  Özdamar, Linet ^a   Demirhan, Melek ^b  

^a ISTANBUL KULTUR UNIVERSITY   (Turkey)

^b YEDITEPE UNIVERSITY   (Turkey)

Author keywords

Adaptive partitioning algorithms; Fuzzy measures; Global optimization; Probabilistic search methods

Indexed keywords

CLUSTER ANALYSIS; SIMULATION; STATISTICAL ANALYSIS;

ADAPTIVE ALGORITHMS; COMPUTATIONAL METHODS; HEURISTIC METHODS; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES; SIMULATED ANNEALING;

ADAPTIVE PARTITIONING ALGORITHMS; PROBABILITY SEARCH METHODS; STOCHASTIC GLOBAL OPTIMIZATION SEARCH METHODS;

OPERATIONS RESEARCH;

ALGORITHM;

EID: 0034111264     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(99)00054-4     Document Type: Article

References (69)

1. Moré JJ, Wu Z. Global smoothing and continuation for large-scale molecular optimization. Preprint MCS-P539-1095. Argonne National Laboratory, Illinois, 1995.
2. Schoen F. A wide class of test functions for global optimization. Journal of Global Optimization. 3:1993;133-137.
3. Gill P., Murray W. Quasi-Newton methods for unconstrained optimization. Journal of Institute of Mathematics and its Applications. 9:1972;91-108.
4. Fletcher R., Powell M. A rapidly convergent descent method for minimization. Computer Journal. 6:1963;163-168.
5. Armijo L. Minimization of functions having Lipschitz continuous first partial derivatives. Pacific J. of Mathematics. 16:1966;1-3.
6. Fletcher R., Reeves C. Function minimization by conjugate gradients. Computer Journal. 7:1964;149-154.
7. Beveridge G, Schechter R. Optimization: theory and practice. New York: Mc-Graw Hill, 1970.
8. Törn A. A search clustering approach to global optimization. In: Dixon LCW, Szegö GP, editors. Towards global optimization 2. Amsterdam: North-Holland, 1978.
9. Price WL. A controlled random search procedure for global optimization. In: Dixon LCW, Szegö GP, editors. Towards global optimization 2. Amsterdam: North-Holland, 1978.
10. Rinnooy Kan A.H.G., Timmer G.T. Stochastic methods for global optimization. American Journal of Mathematical Management Science. 4:1984;7-40.
11. Ali M.M., Storey C. Topographical multi level single linkage. Journal of Global Optimization. 5:1994;349-358.
12. Törn A., Viitanen S. Topographical global optimization using pre-sampled points. Journal of Global Optimization. 5:1994;267-276.
13. Kirkpatrick A., Gelatt Jr C.D., Vechi M.P. Optimization by simulated annealing. 220:1983;671-680.
14. Dekkers A., Aarts E. Global optimization and simulated annealing. Mathematical Programming. 50:1991;367-393.
15. Ingber L. Simulated annealing:practice versus theory. Journal of Mathematical Computer Modelling. 18(11):1994;29-57.
16. Frost R. Ensemble based simulated annealing, ftp.sdsc.edu/pub/sdsc/math/Ebsa, La Jolla. CA. University of California, San Diego, 1993.
17. Wood GR. Multidimensional bisection and global minimization, Working Paper, New Zealand: University of Canterbury, 1985.
18. Horst R. A general class of branch and bound mehods in global optimization, with some new approaches for concave minimization. Journal of Optimization Theory and Applications. 51:1986;271-291.
19. Csendes T., Pinter J. The impact of accelerating tools on the interval subdivision algorithm for global optimization. European Journal of Operations Research. 65:1993;314-320.
20. Caprani O., Gothaab B., Madsen K. Use of real-valued local minimum in parallel interval global optimization. Interval Computations. 3:1993;71-82.
21. Ratz D, Csendes T. On the selection of subdivision directions in interval branch and bound methods. Working Paper, Karlsruhe University, Institut für Angewandte Mathematik, Karlsruhe, Germany, 1994.
22. Streltsov S, Vakili P. Global optimization: Partitioned random search and optimal index policies. Working Paper. Manufacturing Engineering Department. Boston: Boston University, 1995.
23. Pinter J. Convergence qualification of adaptive partitioning algorithms in global optimization. Mathematical Programming. 56:1992;343-360.
24. Kushner H.J. A new method of locating the maximum point of an arbitrary multi-peak curve in the presence of noise. Transactions Of ASME, Series D, Journal of Basic Engineering. 86:1964;97-105.
25. Danilin YM, Piyavskii SA. On an algorithm for finding the absolute minimum, In: Theory of optimal solutions. Kiev: Institute of Cybernetics, 1967;25-37.
26. Schubert B.O. A sequential method seeking the global maximum of a function. SIAM Journal of Numerical Analysis. 9:1972;379-388.
27. Strongin RG, Numerical methods for multiextremal problems. Moscow: Nauka, 1978.
28. Zilinskas A. Two algorithms for one-dimensional multimodal minimization. Optimization. 12:1981;53-63.
29. Wingo D.R. Estimating the location of the Cauchy distribution by numerical global optimization. Communications in Statistics Part B. Simulation and Computation. 12:1983;201-212.
30. Moore RE. Automatic error analysis in digital computation. Technical Report LMSD-48421, Lockheed Missiles and Space Division, Sunnyvale, CA, 1959.
31. Moore RE. Methods and applications of interval analysis. Philadelpxhia: SIAM, 1979.
32. Moore R.E., Ratschek H. Inclusion functions and global optimization II. Mathematical Programming. 41:1988;341-356.
33. Archetti F., Betro B. A probabilistic algorithm for global optimization. Calcolo. 16:1979;335-343.
34. Mockus JB, Thiesis V, Zilinskas A. The application of Bayesian methods for seeking the extremum. In: Dixon LCW, Szego, GP, editors. Towards global optimization, vol. 2. Amsterdam: North-Holland, 1978;117-29.
35. Boender CGE. The generalized multinomial distribution: a Bayesian analysis and applications, PhD dissertation. Erasmus University, Rotterdam, 1984.
36. Ingber L. Adaptive simulated annealing (ASA): lessons learned. Control and Cybernetics, (Polish Journal), 1999, to appear.
37. Bilchev G, Parmee I. Inductive search. IEEE Transactions 1996;832-6.
38. Özdamar L, Bozyel MA. The capacitated lot sizing problem with overtime decisions and setup times. Working Paper, Istanbul Kültür University, Dept of Computer Engineering. Istanbul. Turkey. 1996.
39. Ozdamar L., Bozyel M.A. Simultaneous lot sizing and loading of product families on parallel facilities of different classes. International Journal of Production Research. 36:1998;1305-1324.
40. "Ozdamar L., Birbil I.S. A hybrid genetic algorithm for the capacitated lot sizing and loading problem. European Journal of Operational Research. 110:1998;525-547.
41. Demirhan M, Özdamar L, Helvacioglu L, Birbil IS. A fractal partitioning algorithm (with fuzzy measures) for optimization. EUFIT '97, September 1997, Aachen, Germany.
42. Demirhan M, Özdamar L. A note on the use of fuzzy measures in adaptive partitioning algorithms for global optimization. IEEE Transactions on Fuzzy Systems 1999, to appear.
43. Pal N.R., Bezdek J.C. Measuring fuzzy uncertainty. IEEE Transactions on Fuzzy Systems. 2:1994;107-118.
44. Pal NR, Pal, SK. Object-background segmentation using new definitions of entropy IEE Proceedings 136, pt. E. 1989;284-95.
45. Deluca A., Termini S. A definition of nonprobabilistic entropy in the setting of fuzzy sets theory. Information and Control. 20:1972;301-312.
46. Ozdamar L, Demirhan M. Comparison of partition evaluation measures in an adaptive partitioning algorithm for global optimization. Fuzzy Sets and Systems 1999, to appear.
47. Press WH, Teukolsky SA, Vetterling WT, Flannery BP. Numerical recipes, The art of scientific computing. New York: Cambridge University Press, 1992.
48. Androulakis G.S., Vrahatis M.N. OPTAC: a portable software package for analyzing and comparing optimization methos by visualization. Journal of Computational and Applied Mathematics. 72:1996;41-62.
49. n Numerical Mathematics. 25:1975;23-38.
50. Botsaris C.A. A curvilinear optimization method based upon iterative estimation of the eigensystem of the hessian matrix. Journal of Mathematical Analysis and Applications. 63:1978;396-411.
51. More B.J., Garbow B.S. Hillstrom, K.E. Testing unconstrained optimization. ACM Transactions on Mathematical Software. 7:1981;17-41.
52. Kearfott B. An efficient degree-computation method for a generalized method of bisection. Numerical Mathematics. 32:1979;109-127.
53. Schaffer JD. A study of control parameters affecting online performance of genetic algorithms for function optimization. Proceedings of the Third International Conference on Genetic Algorithms, 1989: 51-60.
54. Srinivas M., Patnaik L.M. Adaptive probabilities of crossover and mutation in genetic algorithms. IEEE Transactions on Systems, Man and Cybernetics. 24:1994;656-667.
55. Michalewicz Z. Genetic algorithms - data structures = evolution programs. Berlin: Springer, 1994.
56. Rosenbrock HH. State-space and multivariable theory. London: Nelson, 1970.
57. Levy AV, Montalvo A, Gomez S, Calderon A. Topics in Global Optimization. Lecture Notes in Mathematics, No. 909. Berlin: Springer, 1981.
58. Jansson C, Knüppel O. Numerical results for a self-validating global optimization method. Working Paper, No. 94.1, Technical University of Hamburg-Harburg, 1994.
59. Schwefel H. Numerical optimization of computer models. New York: Wiley, 1991.
60. Törn A, Zilinskas A. Global optimization. Lecture Notes in Computer Science. Berlin: Springer, 1989.
61. Corana A., Marchesi M., Marini C., Ridella S. Minimizing multimodal functions of continuous variables with the simulated annealing algorithm. ACM Transactions of Mathematical Software. 13:1987;262-279.
62. Aluffi-Pentini F., Parisi V., Zirilli F. Global optimization and stochastic differential equations. Journal of Optimization Theory and Applications. 47:1985;1-16.
63. Breiman L., Cutler A. A deterministic algorithm for global optimization. Mathematical Programming. 58:1993;179-199.
64. Easom E. A survey of global optimization techniques. M Eng thesis, University of Louisville, Louisville, KY, 1990.
65. Stuckman B.E., Easom E.E. A comparison of Bayesian/Sampling global optimization techniques. IEEE Transactions on Systems, Man and Cybernetics. 22:1992;1024-1032.
66. De Jong K. An analysis of the behaviour of a class of genetic adaptive systems. PhD thesis. University of Michigan, Ann Arbor, 1975.
67. Wodrich M, Bilchev G. Cooperative distributed search: the ant's way. Working Paper, University of Cape Town, South Africa, 1997.
68. Baluja S. Population-based incremental learning: a method for integrating genetic search based function optimization and competitive learning. Working Paper. CMU-CS-94-163, School of Computer Science, Carnegie Mellon University, 1994.
69. Griewank A.O. Generalized descent for global optimization. Journal of Optimization Theory and Applications. 34:1981;11-39.