Skip to main content
SpringerLink
Log in

Zwei genetische Algorithmen zur Lösung des Bandabgleichproblems

  • Chapter
Operations Research Reflexionen aus Theorie und Praxis

Zusammenfassung

Nach einer allgemeinen Darstellung des Verfahrenskonzepts genetischer Algorithmen und einer kurzen Einführimg in das Bandabgleichproblem werden je ein genetischer Algorithmus mit problemferner und problemnaher Repräsentationsform zur Lösung des Bandabgleichproblems vorgestellt. Beide Algorithmen werden anhand von Problembeispielen aus der Literatur verglichen. In den Vergleich werden auch zwei heuristische Verfahren einbezogen.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 59.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 79.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literatur

  • Arcus, A. L. (1963): An Analysis of a Computer Method of Sequencing Assembly Line Operations, Unpublished Ph. D. Dissertation, University of California 1963.

    Google Scholar 

  • Baker, J. E. (1985): Adaptive Selection Methods for Genetic Algorithms, in: Grefenstette (1985), S. 101–111.

    Google Scholar 

  • Baker, J. E. (1987): Reducing Bias and Inefficiency in the Selection Algorithm, in: Grefenstette (1987a), S. 14–21.

    Google Scholar 

  • Belew, R.; Booker, L. (1991) (Hrsg.): Proceedings of the Fourth International Conference on Genetic Algorithms, Morgan Kaufman Publishers, Los Altos/Kalifornien 1991.

    Google Scholar 

  • Bethke, A. D. (1981): Genetic Algorithms as Function Optimizers, Ph.D. Thesis, Department of Computer and Communications Sciences, University of Michigan 1981.

    Google Scholar 

  • Boguschewski, A.; Gehring, H.; Köstermann, K. (1990): Montagelinien in der Pkw-Montage abstimmen, in: Arbeitsvorbereitung 27 (1990), S. 130–133.

    Google Scholar 

  • Bhuyan, J. N.; Raghavan, V. V.; V. K. Elayavalli (1991): Genetic Algorithm with an Ordered Representation, in: Belew; Booker 1991, S. 408–415.

    Google Scholar 

  • Bridges, C. L.; Goldberg, D. E. (1987): An Analysis of Reproduction and Crossover in a Binary Coded Genetic Algorithm, in: Grefenstette (1987a), S. 9–13.

    Google Scholar 

  • Brown, D. E.; Huntley, C. L.; Spillane, A. R. (1989): A Parallel Genetic Heuristic for the Quadratic Assignment Problem, in: Schaffer (1989), S. 406–415.

    Google Scholar 

  • Coombs, S.; Davis, L. (1987): Genetic Algorithms and Communication Link Speed Design: Constraints and Operators, in: Grefenstette (1987a), S. 257 - 260.

    Google Scholar 

  • Cleveland, G. A.; Smith, S. F. (1989): Using Genetic Algorithms to Schedule Flow Shop Releases, in: Schaffer ( 1989 ). S. 160–169.

    Google Scholar 

  • Davis, L. (1985a): Job Shop Scheduling with Genetic Algorithms, in: Grefenstette (1985), S. 136 - 140.

    Google Scholar 

  • Davis, L. (1985b): Applying Adaptive Algorithms to Epistatic Domains, in: Proceedings of the International Joint Conference on Artificial Intelligence, 1985, S. 162–164.

    Google Scholar 

  • Davis, L. (1987) (Hrsg.): Genetic Algorithms and Simulated Annealing. Pitman Publishing, London 1987.

    Google Scholar 

  • Davis, L. (1991) (Hrsg.): Handbook of Genetic Algorithms, Van Nostrand Reinhold, New York 1991.

    Google Scholar 

  • Deckro, R. F.; Rangachari, S. (1990): A Goal Approach to Assembly Line Balancing, in: Computers & Operations Research 17 (1990), S. 509 - 521.

    Google Scholar 

  • De Jong, K. A. (1975): An Analysis of the Behavior of a Class of Genetic Adaptive Systems, Doctoral Dissertation, University of Michigan 1975.

    Google Scholar 

  • Domschke, W.; Scholl, A.; Voß, S. (1993): Produktionsplanimg. Ablauforganisatorische Aspekte, Berlin 1993.

    Google Scholar 

  • Dorndorf, U.; Pesch, E. (1993): Genetic Algorithms for Job Shop Scheduling, in: Hansmann, K.-W.; Bachem, A.; Jarke, W. E. u.a: Operations Resesarch Proceedings 1992, Heidelberg 1993.

    Google Scholar 

  • Drexl, A. (1990): Fließbandaustaktung, Maschinenbelegung und Kapazitätsplanung in Netzwerken, in: Zeitschrift für Betriebswirtschaft 60 (1990), S. 53 - 70.

    Google Scholar 

  • Fremerey, F. (1993): Erhöhung der Variantenflexibilität in Mehrmodell-Montagesystemen durch ein Verfahren zur Leistungsabstimmung, Berlin 1993.

    Google Scholar 

  • Fox, B. R.; McMahon, M. B. (1991): Genetic Operators for Sequenzing Problems, in: Rawlins (1991), S. 284–300.

    Google Scholar 

  • Gabbert, P. S.; Brown, D. E.; Huntley, C. L. u.a. (1991): A System for Learning Routes and Schedules with Genetic Algorithms, in: Belew und Booker (1991), S. 430–436.

    Google Scholar 

  • Goldberg, D. E.; Lingle, R. (1985): Alleles, Loci, and the Traveling-Salesman Problem, in: Grefenstette (1985), S. 154–159.

    Google Scholar 

  • Goldberg, D. E. (1989): Genetic Algorithms in Search, Optimization, and Machine Learning, Reading/Massachusetts 1989.

    Google Scholar 

  • Goldberg, D. E.; Deb, K. (1991): A Comparative Analysis of Selection Schemes Used in Genetic Algorithms, in: Rawlins ( 1991 ), S. 69–93.

    Google Scholar 

  • Grefenstette, J. J. (1985) (Hrsg.): Proceedings of the First International Conference on Genetic Algorithms, Lawrence Erlbaum Associates, Hillsdale/New Jersey 1985.

    Google Scholar 

  • Grefenstette, J. J.; Gopal, R.; Rosmaita, B. u.a. (1985): Genetic Algorithm for the TSP, in: Grefenstette (1985), S. 160–168.

    Google Scholar 

  • Grefenstette, J. J. (1987a) (Hrsg.): Proceedings of the Second International Conference on Genetic Algorithms, Lawrence Erlbaum Associates, Hillsdale/New Jersey 1987.

    Google Scholar 

  • Grefenstette J. J. (1987b): Incorporating Problem Specific Knowledge into Genetic Algorithms, in: Davis (1987), S. 42–60.

    Google Scholar 

  • Grefenstette J. J.; Davis, L.; Cerys, D. (1991): GENESIS and OOGA: Two Genetic Algorithm Systems, Melrose/Massachusetts 1991.

    Google Scholar 

  • Helgeson, W. B.; Birnie, D. P. (1961): Assembly Line Balancing Using the Ranked Positional Weight Technique, in: The Journal of Industrial Engineering 12 (1961), S. 394–398.

    Google Scholar 

  • Heskiaoff, H. (1968): An Heuristic Method for Balancing Assembly Lines, in: Western Electric Engineering, 1968, S. 9–17.

    Google Scholar 

  • Hoffmann, T. R. (1992): EUREKA: A Hybrid System For Assembly Line Balancing, in: Management Science 38 (1992), S. 39–47.

    Google Scholar 

  • Holland, J. H. (1975): Adaption in Natural and Artificial Systems, The University of Michigan Press, Ann Arbor/Massachusetts 1975.

    Google Scholar 

  • Hollstien, R. B. (1971): Aritificial Genetic Adaption in Computer Control Systems, Ph.D. Thesis, Dept. Computer and Communication Sciences, University Of Michigan 1971.

    Google Scholar 

  • Hosage, C. M.; Goodchild, M. F. (1986): Discrete Space Location - Allocation Solutions from Genetic Algorithms, in: Annals of Operations Research 6 (1986), S. 35–46.

    Google Scholar 

  • Jog, P.; Suh, J. Y.; Gucht, D. V. (1989): The Effects of Population Size, Heuristic Crossover and Local Improvement on an Genetic Algorithm for the Traveling Salesman Problem, in: Schaffer (1989), S. 110–115.

    Google Scholar 

  • Kanet, J. J.; Sridharan, V. (1991): PROGENITOR: A Genetic Algorithm for Production Scheduling, in: Wirtschaftsinformatik 33 (1991), S. 332–336.

    Google Scholar 

  • Kilbridge, M. D.; Wester, L. (1961): A Heuristic Method of Assembly Line Balancing, in: Journal of Industrial Engineering 12 (1961), S. 202.

    Google Scholar 

  • Levitin, G.; Rubinovitz, J. (1993): Genetic Algorithm for Linear and Cyclic Assignment Problem, in: Computers und Operations Research 20 (1993), S. 575–586.

    Google Scholar 

  • Liepins, G. E.; Hillard, M. R.; Palmer, M. u.a. (1987): Greedy Genetics, in: Grefenstette (1987a), S. 90–99.

    Google Scholar 

  • Maziejewski, S. (1992): The Vehicle Routing and Scheduling Problem with Time Window Constraints using Genetic Algorithms, Diplomarbeit, Institut für Logik, Komplexität und Deduktionssysteme, Universität Karlsruhe 1992.

    Google Scholar 

  • Michalewicz, Z . (1992): Genetic Algorithms + Data Structures = Evolution Programs, Berlin 1992.

    Google Scholar 

  • Oliver, I. M.; Smith, D. J.; Holland, J. R. C. (1987): A Study of Permutation Crossover Operators on the Traveling Salesman Problem, in: Grefenstette (1987a), S. 224–230.

    Google Scholar 

  • Rawlins, G. J. E. (1991) (Hrsg.): Foundations of Genetic Algorithms, San Mateo/Kalifornien 1991.

    Google Scholar 

  • Richardson, J. T.; Palmer, M. P.; Liepins, G. u.a. (1989): Some Guidelines for Genetic Algorithms with Penalty Functions, in: Schaffer (1989), S. 191–197.

    Google Scholar 

  • Sawyer, J. F. H. (1970): Line Balancing. Machinery Publishing, Brighton 1970.

    Google Scholar 

  • Schaffer, D. J.; Morishima, A. (1987): An Adaptive Crossover Distribution Mechanism for Genetic Algorithms, in: Grefenstette (1987a), S. 36–40.

    Google Scholar 

  • Schaffer, D. J. (1989) (Hrsg.): Proceedings of the Third International Conference on Genetic Algorithms, Los Altos/Kalifornien 1989.

    Google Scholar 

  • Schaffer, D. J.; Caruna, R. A.; Eshaelmann, L. J. u.a. (1989): A Study of Control Parameters Affecting Online Perfomance Of Genetic Algorithms for Function Optimization, in: Schaffer (1989), S. 51–61.

    Google Scholar 

  • Sirag, D. J.; Weissner, P. T. (1987): Towards a Unified Thermodynamic Genetic Operator, in: Grefenstette (1987), S. 116–122.

    Google Scholar 

  • Smith, D. (1985): Bin Packing with Adaptive Search, in: Grefenstette (1985), S. 202–207.

    Google Scholar 

  • Syswerda, G. (1989): Uniform Crossover in Genetic Algorithms, in: Schaffer (1989), S. 2–9.

    Google Scholar 

  • Syswerda, G. (1991a): Schedule Optimization Using Genetic Algorithms, in: Davis (1991), S. 332–349.

    Google Scholar 

  • Syswerda, G. (1991b): A Study of Reproduction in Generational and Steady State Genetic Algorithms, in: Rawlins (1991), S. 94–101.

    Google Scholar 

  • Syswerda, G.; Palmucci, J. (1991): The Application of Genetic Algorithms to Resource Scheduling, in: Belew und Booker (1991), S. 502–508.

    Google Scholar 

  • Tam, K. Y. (1992): Genetic Algorithms, Function Optimization and Facility Layout Design, in: European Journal of Operational Research 63 (1992), S. 332–346.

    Google Scholar 

  • Thangiah, R. S.; Nygard, K. E.; Juell, P. L. (1991): GIDEON: A Genetic Algorithm System for Vehicle Routing with Time Windows, in: Proceedings of the IEEE Conference on Artificial Intelligence Applications, Miami 1991, S. 322–328.

    Chapter  Google Scholar 

  • Weber, H. (1993): Entwicklung eines genetischen Verfahrens zum Bandabgleich unter Berücksichtigimg praxisrelevanter Restriktionen, Diplomarbeit, Fachbereich Wirtschaftswissenschaft, Fern-Universität Hagen 1993.

    Google Scholar 

  • Withley, D.; Starkweather, D.; Fuquay, D. A. (1989): Scheduling Problems and Traveling Salesman: The Genetic Edge Rebombination Operator, in: Schaffer (1989), S. 133–140.

    Google Scholar 

  • Withley, D. (1989): The GENITOR Algorithm and Selective Pressure: Why Rank-based Allocation of Reproductive Trials Is Best, in: Schaffer (1989), S. 116–123.

    Google Scholar 

Download references

Authors
  1. Hermann Gehring
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gerhard Schütz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Fakultät für Wirtschaftswissenschaft, Ruhr-Universität Bochum, Universitätsstraße 150, D-44780, Bochum, Germany

    Brigitte Werners (Lehrstuhl für Betriebswirtschaftslehre insbes. Unternehmensforschung und Rechnungswesen) & Roland Gabriel (Lehrstuhl für Wirtschaftsinformatik) (Lehrstuhl für Betriebswirtschaftslehre insbes. Unternehmensforschung und Rechnungswesen) &  (Lehrstuhl für Wirtschaftsinformatik)

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Heidelberg

About this chapter

Cite this chapter

Gehring, H., Schütz, G. (1994). Zwei genetische Algorithmen zur Lösung des Bandabgleichproblems. In: Werners, B., Gabriel, R. (eds) Operations Research Reflexionen aus Theorie und Praxis. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-78998-4_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-78998-4_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-78999-1

  • Online ISBN: 978-3-642-78998-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation