Ga based on the UV-structure Hypothesis and its Application to JSP

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1917, Issue , 2000, Pages 273-282

  Ikeda, Kokolo ^a   Kobayashi, Shigenobu ^a  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; ECONOMIC AND SOCIAL EFFECTS; GENETIC ALGORITHMS; JOB SHOP SCHEDULING; OPTIMIZATION;

EXPLOITATION AND EXPLORATIONS; GENETIC ALGORITHM (GAS); GLOBAL OPTIMUM; ITS APPLICATIONS; JOB SHOP SCHEDULING PROBLEMS; LANDSCAPE STRUCTURES; LOCAL OPTIMA; STRUCTURAL PROBLEMS;

PROBLEM SOLVING;

EID: 84947925513     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/3-540-45356-3_27     Document Type: Article

References (15)

1. K. Boese, “Cost versus Distance in the Traveling Salesman Problem,” Tech.Rep. TR-950018, UCLA CS Department, 1995 K.D. Boese and S.Muddu, “A New Adaptive Multi-Start Technique for Combinatorial Global Optimizations,” Operations Research Letters 16, pp. 101-113, 1994
2. Takahashi, O. “A Distance Dependent Alternation Model on Real-coded Genetic Algorithms” IEEE International Conference on Systems, Man, and Cybernetics, pp. 619-624, 1999
3. Ono, I. “A Real-coded Genetic Algorithm for Function Optimization Using Unimodal Normal Distribution Crossover”, Proc. of 7th Intr. Conf. on Genetic Algorithms , pp 246-253, 1997
4. H. Kita : A Functional Specialization Hypothesis for Designing Genetic Algorithm , IEEE International Conference on Systems, Man, and Cybernetics (1999)
5. J. Sakuma, S. Kobayashi : Extrapolation-Directed Crossover for Job-shop Scheduling Problems ; complementary combination with Job-based Order Crossover, GECCO 2000 , to appear
6. Aarts, E. , van Laarhoven, P, Lenstra, J and Ulder, N.: A Computational Study of Local Search Algorithms for Job-shop Scheduling, ORSA J. on Comput, Vol. 6, No. 2, pp. 118-125 (1994)
7. Appleegate, D. and Cook, W. : A Computational Study of the Job-shop Scheduling Problem, ORSA J. on Comput. , Vol. 3, No. 2, pp. 149-156 (1991)
8. Giffler, B. and Thompson, G. : Algorithms for Solving Production Schedulng Problems, Oper. Res. , Vol. 8, pp. 487-503 (1960)
9. Mattfeld, D. C. , Kopfer, H. and Bierwirth, C. : Control of Parallel Population Dynamics by Social-like Behavior of Ga-individuals, 3rd PPSN (1994)
10. Nowicki, E. and Smutnicki, C. : A Fast Taboo Search Algorithm for the Job Shop Problem, Institute of Engineering Cybernetics, Technical University of Wroclaw, Poland. Vol. Preprinty nr 8/93 (1993)
11. Ono, I. , Yamamura, M. and Kobayashi, S. : A Genetic Algorithm for Job-shop Scheduling Problems Using Job-based Order Crossover, Proceedings of 1996 IEEE International Conference on Evolutionary Computation, pp. 547-552 (1996)
12. Ono, I. and Kobayashi, S. : A Genetic Algorithm Taking Account of Characteristics Preservation for Job-shop Scheduling Problems, Proceedings of the 5th conference on Intelligent Autonomous Systems, pp. 711-718 (1998)
13. Ulder, N., Pesch, E., van Laarhoven, P., Bandelt, H.J. and Aarts, E.: Genetic Local Search Algorithm for the Traveling Salesman Problem, 1st PPSN, pp.109-116
14. Yamada, T. and Ryohei, N. Job-shop Scheduling by Simulated Annealing Combined with Deterministic Local Search, Kluwer Academic Publishers, MA, USA (1995); Transactions of Information Processing Society of Japan Vol.37 No.4 , pp.597-604(1996)
15. Yamada, T. and Ryohei, N. Scheduling by Generic Local Search with Multi-Step Crossover, Proceedings of the 4th conference on 4th PPSN , pp. 960969 (1996); Transactions of Information Processing Society of Japan Vol 38 No.6, pp.1126-1138(1997)