VTechWorks staff will be away for the Thanksgiving holiday starting at noon on Wednesday, November 21, through Friday, November 23, and will not be replying to requests during this time. Thanks for your patience, and happy holidays!

Show simple item record

dc.contributor.authorEvans, Jonathan D.en_US
dc.date.accessioned2014-03-14T21:52:49Z
dc.date.available2014-03-14T21:52:49Z
dc.date.issued1996-03-05en_US
dc.identifier.otheretd-12302008-063806en_US
dc.identifier.urihttp://hdl.handle.net/10919/46466
dc.description.abstract

The demand for increased diversity, reduced cycle time, and reduced work-inprocess has caused increased popularity of mixed-model assembly lines. These lines combine the productivity of an assembly line and the flexibility of a job shop. The mixedmodel assembly line allows setup time between models to be zero. Large lines mixedmodel assembly lines require a timely, near-optimal method. A well balanced line reduces worker idle time and simplifies the mixed-model assembly line sequencing problem.

Prior attempts to solve the balancing problem have been in-adequate. Heuristic techniques are too simple to find near-optimal solutions and yield only one solution. An exhaustive search requires too much processing time. Simulated Annealing works well, but yields only one solution per run and the solutions may vary because of the random nature of the Simulated Annealing process. Multiple runs are required to get more than one solution, each run requiring some amount of time which depends on problem size. If only one run is performed, the solution achieved may be far from optimal. In addition, Simulated Annealing requires different parameters depending on the size of the problem.

The Genetic Algorithm (GA) is a probabilistic heuristic search strategy. In most cases, it begins with a population of random solutions. Then the population is reproduced using crossover and mutation with the fittest solutions having a higher probability of being parents. The idea is survival of the fittest, poor or unfit solutions do not reproduce and are replaced by better or fitter solutions. The final generation should yield multiple near optimal solutions.

The objective of this study is to investigate the Genetic Algorithm and its performance compared to Simulated Annealing for large mixed-model assembly lines. The results will show that the Genetic Algorithm will perform comparably to the Simulated Annealing. The Genetic Algorithm will be used to solve various mixed-model assembly line problems to discover the correct parameters to solve any mixed-model assembly line balancing problem.

en_US
dc.format.mediumBTDen_US
dc.publisherVirginia Techen_US
dc.relation.haspartLD5655.V855_1996.E936.pdfen_US
dc.subjectgenetic algorithmen_US
dc.subjectmixed-model assembly line balancingen_US
dc.subject.lccLD5655.V855 1996.E936en_US
dc.titleApplication of genetic algorithm to mixed-model assembly line balancingen_US
dc.typeThesisen_US
dc.contributor.departmentIndustrial and Systems Engineeringen_US
thesis.degree.nameMaster of Scienceen_US
thesis.degree.levelmastersen_US
thesis.degree.grantorVirginia Polytechnic Institute and State Universityen_US
dc.contributor.committeechairEyada, Osmon K.en_US
dc.contributor.committeememberSarin, Subhash C.en_US
dc.contributor.committeememberSumichrast, Robert T.en_US
dc.identifier.sourceurlhttp://scholar.lib.vt.edu/theses/available/etd-12302008-063806/en_US
dc.date.sdate2008-12-30en_US
dc.date.rdate2008-12-30
dc.date.adate2008-12-30en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record