A novel stochastic optimization algorithm

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Volumn 30, Issue 1, 2000, Pages 193-198

  Li, Bing ^a   Jiang, Weisun ^b  

^a TANGSHAN UNIVERSITY   (China)

^b EAST CHINA UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

Artificial neural network; Scheduling; Stochastic optimization algorithm

Indexed keywords

DECODING; FUNCTIONS; GENETIC ALGORITHMS; MARKOV PROCESSES; NEURAL NETWORKS; RANDOM PROCESSES; SIGNAL ENCODING; SIMULATED ANNEALING;

CHEMOTAXIS ALGORITHMS; SIMULATED ANNEALING ALGORITHMS (SAA);

PROBLEM SOLVING;

EID: 0033897949     PISSN: 10834419     EISSN: None     Source Type: Journal    
DOI: 10.1109/3477.826960     Document Type: Article

References (18)

1. D. S. Johnson and C. R. Arago et al., "Optimization by simulated annealing, an experimental evolution - Part I," Graph Partitioning Oper. Res., vol. 37, no. 6, pp. 865-892, 1989.
2. H. Das and P. T. Cumming et al., "Scheduling multiproduct batch process via simulated annealing," Comput. Chem. Eng., vol. 14, no. 12, pp. 1352-1362, 1990.
3. I. P. Androulakis et al., "A genetic algorithm framework for process design and optimization," Comput. Chem. Eng., vol. 15, no. 4, pp. 217-228, 1991.
4. L. Ding and X. F. Zhu, "New training method of artificial neural networks" (in Chinese), Chemotaxis, Modeling and Control of Industrial Process, vol. 5, pp. 332-337, 1992.
5. B. Li and W. S. Jiang, "An improved genetic algorithm used to some combinatorial problems" (in Chinese), Proc. Control and Decision, pp. 360-362, 1995.
6. J. C. Potts, T. D. Giddens, and S. B. Yadav, "The development and evaluation of an improved genetic algorithm based on migration and artificial selection," IEEE Trans. Syst. Man, and Cybern., vol. 24, pp. 73-85.
7. P. Tian, "The mix strategy of Darwin and Boltzman for combinatorial problems: Theory and applications," Ph.D. dissertation (in Chinese), 1993.
8. F.-T. Lin et al., "Applying the genetic approach to simulated annealing in solving some np-hard problems," IEEE Trans. Syst., Man, Cybern., vol. 23, pp. 1752-1767, Nov./Dec. 1993.
9. M. Iosifescu, Finite Markov Processes and Their Application. New York: Wiley, 1980.
10. D. E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning. Reading, MA: Addison Wesley, 1989.
11. J. N. Aaral, K. Tumer, and J. Ghosh, "Designing genetic algorithms for the state assignment problem," IEEE Trans. Syst., Man, Cybern., vol. 25, pp. 687-694, 1995.
12. B. Li and W. S. Jiang, "Quasisimulated annealing algorithm and its application" (in Chinese), J. Inform. Contr., vol. 24, pp. 412-415, 1995.
13. D. Dasgupta and D. R. Mcgregor, "A more biologically motivated genetic algorithm: The model and some results," Cybernetics and Systems: An International Journal, vol. 25, pp. 447-469, 1994.
14. J. J. Grefenstette, "Optimization of control parameter for genetic algorithms," IEEE Trans. Syst., Man, Cybern., vol. SMC-16, pp. 122-128, 1986.
15. S. Kirkpatrick, C. D. Gelatt, Jr., and M. P. Vecchi, "Optimization by simulated annealing," Science, vol. 220, no. 4598, pp. 761-680, 1983.
16. V. Kreinovich, C. Quintana, and O. Fuentes, "Genetic algorithms: What fitness scaling is optimal?," Cybernetics and Systems: An International Journal, vol. 24, pp. 9-25, 1993.
17. K. Krishna, K. Ganeshan, and D. J. Ram, "Distributed simulated annealing algorithms for job shop scheduling," IEEE Trans. Syst., Man, Cybern., vol. 25, pp. 1102-1109, 1995.
18. H. M. Cartwright and R. A. Long, "Simultaneous optimization of chemical flowshop sequencing and topology using genetic algorithms," Ind. Eng. Chem. Res., vol. 32, pp. 2706-2713, 1993.