Presentation 1994/1/20
Search Space Level Analysis of Genetic Algorithms
Takeshi Yamada, Ryohei Nakano,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) The Job Shop Scheduling Problem is one of the most difficult NP- hard combinatorial optimization problems.This research investigates the influence of the differences of solution representations and search space structures on the quality of final solutionsobtained by using Genetic Algorithms through extensive computational experiments.Experiments have been done under different conditions:using bit strings or job sequences as solution representations,with different crossover operators,using search space structure of active schedules,nondelay schedules,or semiactive schedules.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Genetic Algorithms / job-shop scheduling problems / active schedules / combinatorial optimization / sequencing problems
Paper # AI93-72
Date of Issue

Conference Information
Committee AI
Conference Date 1994/1/20(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Artificial Intelligence and Knowledge-Based Processing (AI)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Search Space Level Analysis of Genetic Algorithms
Sub Title (in English)
Keyword(1) Genetic Algorithms
Keyword(2) job-shop scheduling problems
Keyword(3) active schedules
Keyword(4) combinatorial optimization
Keyword(5) sequencing problems
1st Author's Name Takeshi Yamada
1st Author's Affiliation NTT Communication Science Laboratories()
2nd Author's Name Ryohei Nakano
2nd Author's Affiliation NTT Communication Science Laboratories
Date 1994/1/20
Paper # AI93-72
Volume (vol) vol.93
Number (no) 424
Page pp.pp.-
#Pages 8
Date of Issue