Skip to main content
Springer Nature Link
Log in

Anwendung von Metaheuristiken zur Lösung betrieblicher Planungsprobleme

Potenziale und Grenzen einer softwaretechnischen Unterstützung

Application of metaheuristics within operations management — Potential and limitations of software reuse

  • WI — Aufsatz
  • Published:
Wirtschaftsinformatik

Abstract

Application of metaheuristics within operations management — Potential and limitations of software reuse Business reality comprises a large variety of well structured problems (e.g. in production and logistics management), for which effective and efficient solution procedures are available from research. This includes metaheuristics such as iterative local search, tabu search and evolutionary algorithms. However, the implementation of these quantitative solution procedures as part of decision support systems usually requires problem-specific adaptations. To simplify this task we developed an application framework in C++, which represents various metaheuristics as reusable software components. These components can be used in arbitrary application domains. The framework clearly simplifies the effective practical application of metaheuristics. Nevertheless, a certain effort may be unavoidable if one aims at high-quality solutions in novel applications.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Literatur

  1. Aarts, E. H. L.; Lenstra, J. K.: Local Search in Combinatorial Optimization. Wiley, Chichester 1997.

    Google Scholar 

  2. Ausiello, G.; Crescenzi, P.; Gambosi, G.; Kann, V.; Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, Berlin Heidelberg 1999.

    Google Scholar 

  3. Battiti, R.: Reactive search: Toward selftuning heuristics. In: Rayward-Smith, V. J.; Osman, I. H.; Reeves, C. R.; Smith, G. D. (Hrsg.): Modern Heuristic Search Methods. Wiley, Chichester 1996, S. 61–83.

    Google Scholar 

  4. Biskup, U.: Entwicklung einer Konfigurationsanwendung basierend auf den Anforderungen von HotFrame: Grafische Benutzeroberfläche, Software-Generator, Konfigurationssprache. Diplomarbeit, Technische Universität Braunschweig 2000.

    Google Scholar 

  5. Bosch, J.; Molin, P.; Mattsson, M.; Bengtsson, P.; Fayad, M. E.: Framework problems and experiences. In: Fayad, M. E.; Schmidt, D. C.; Johnson, R. E. (Hrsg.): Building Application Frameworks: Object-Oriented Foundations of Framework Design. Wiley, Chichester 1999, S. 55–82.

    Google Scholar 

  6. Böse, J.; Reiners, T.; Steenken, D.; Voß, S.: Vehicle dispatching at seaport container terminals using evolutionary algorithms. In: Sprague, R. H. (Hrsg.): Proceedings of the 33rd Annual Hawaii International Conference on System Sciences, IEEE, Piscataway (2000), DTM-IT, S. 1–10.

    Google Scholar 

  7. Broy, M.; Siedersleben, J.: Objektorientierte Programmierung und Softwareentwicklung: Eine kritische Einschätzung. In: Informatik-Spektrum 25 (2002), S. 3–11.

    Google Scholar 

  8. Carnegie Mellon Software Engineering Institute: Domain Engineering. http://www.sei.cmu.edu/domain-engineering/domain_eng.html. Abruf am 2002-12-02.

  9. Culberson, J. C.: On the futility of blind search: An algorithmic view of „no free lunch”. In: Evolutionary Computation 6 (1998), S. 109–127.

    Google Scholar 

  10. Czarnecki, K.; Eisenecker, U. W.: Generative Programming: Methods, Tools, and Applications. Addison-Wesley, Reading 2000.

    Google Scholar 

  11. Dorn, J.: Planung von betrieblichen Ab-läufen durch Standardsoftware — eine Widerspruch? In: Wirtschaftsinformatik 42 (2000), S. 201–209.

    Google Scholar 

  12. Fayad, M. E.; Schmidt, D. C.; Johnson, R. E. (Hrsg.): Building Application Frameworks: Object-Oriented Foundations of Framework Design. Wiley, Chichester 1999.

    Google Scholar 

  13. Fichefet, J.: From operational research towards decision science aid: A quest for the philosophers’ stone? In: Cahiers du CERO 36 (1994), S. 113–142.

    Google Scholar 

  14. Fink, A.: Software-Wiederverwendung bei der Lösung von Planungsproblemen mittels Meta-Heuristiken. Shaker, Aachen 2000.

    Google Scholar 

  15. Fink, A; Schneidereit, G.; Voß, S.: Solving general ring network design problems by metaheuristics. In: Laguna, M.; González Velarde, J. L. (Hrsg.): Computing Tools for Modeling, Optimization and Simulation (Interfaces in Computer Science and Operations Research), Kluwer, Boston 2000, S. 91–113.

    Chapter  Google Scholar 

  16. Fink, A.; Voß, S.; Woodruff, D. L.: An adoption path for intelligent heuristic search componentware. In: Rolland, E.; Umanath, N. S. (Hrsg.): Proceedings of the 4th INFORMS Conference on Information Systems and Technology. INFORMS, Linthicum 1999, S. 153–168.

    Google Scholar 

  17. Fink, A.; Voß, S.: Applications of modern heuristic search methods to pattern sequencing problems. Computers & Operations Research 26 (1999), S. 17–34.

    Google Scholar 

  18. Fink, A.; Voß, S.: Reusable metaheuristic software components and their application via software generators. In: De Sousa, J. P. (Hrsg.): Proceedings of the 4th Metaheuristics International Conference, Porto 2001, S. 637–642.

    Google Scholar 

  19. Fink, A.; Voß, S.: HotFrame: A heuristic optimization framework. In: Voß, S.; Woodruff, D. L. (Hrsg.): Optimization Software Class Libraries. Kluwer, Boston 2002, S. 81–154.

    Google Scholar 

  20. Fink, A.; Voß, S.: Solving the continuous flow-shop scheduling problem by metaheuris-tics. European Journal of Operational Research. Im Druck (2003).

    Google Scholar 

  21. Gamma, E.; Helm, R.; Johnson, R.; Vlissides, J.: Entwurfsmuster: Elemente wiederverwendbarer objektorientierter Software. Ad-dison-Wesley, Bonn 1996.

    Google Scholar 

  22. Garey, M. R.; Johnson, D. S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York 1979.

    Google Scholar 

  23. Glover, F.; Laguna, M.: Tabu Search. Kluwer, Boston 1997.

    Book  Google Scholar 

  24. Gutenschwager, K.: Online-Dispositionsprobleme in der Lagerlogistik: Modellierung — Lö sungsansätze — praktische Umsetzung. Physi-ca, Heidelberg 2002.

    Google Scholar 

  25. Johnson, D. S.; Aragon, C. R.; McGeoch, L. A.; Schevon, C.: Optimization by simulated annealing: An experimental evaluation; part i, graph partitioning. Operations Research 37 (1989), S. 865–892.

    Google Scholar 

  26. Kang, K.; Cohen, S.; Hess, J.; Novak, W.; Peterson, S.: Feature-oriented domain analysis (FODA) feasibility study. Arbeitsbericht CMU/SEI-90-TR-21, Carnegie Mellon Software Engineering Institute, Carnegie Mellon University 1990.

    Google Scholar 

  27. Mertens, P.: Geschichte und ausgewählte Gegenwartsprobleme der Wirtschaftsinformatik. In: Wirtschaftswissenschaftliches Studium (WiSt) 27 (1998), S. 170–175.

    Google Scholar 

  28. Meyer, B.: Object-Oriented Software Construction. 2. Aufl., Prentice Hall, Engle-wood-Cliffs 1997.

    Google Scholar 

  29. Michalewicz, Z.; Fogel, D. B.: How to Solve It: Modern Heuristics. Springer, Berlin Heidelberg 2000.

    Google Scholar 

  30. Musser, D. R.; Stepanov, A. A.: Algorithm-oriented generic libraries. Software — Practice and Experience 24 (1994), S. 623–642.

    Google Scholar 

  31. Nievergelt, J.: Complexity, algorithms, programs, systems: The shifting focus. In: Journal of Symbolic Computation 17 (1994), S. 297–310.

    Google Scholar 

  32. Parnas, D. L.: A technique for software module specification with examples. In: Communications of the ACM 15 (1972), S. 330–336.

    Google Scholar 

  33. Parnas, D. L.: On the criteria to be used in decomposing systems into modules. In: Communications of the ACM 15 (1972), S. 1053–1058.

    Google Scholar 

  34. Pree, W.: Komponentenbasierte Softwareentwicklung mit Frameworks. dbpunkt, Heidelberg 1997.

    Google Scholar 

  35. Radcliffe, N. J.; Surry, P. D.: Fundamental limitations on search algorithms: Evolutionary computing in perspective. In: Van Leeuwen, J. (Hrsg.): Computer Science Today: Recent Trends and Developments, Lecture Notes in Computer Science 1000. Springer, Berlin Heidelberg 1995, S. 275–291.

    Google Scholar 

  36. Simon, H. A.: The future of information systems. In: Ramesh, R.; Rao, H. R. (Hrsg.): Interface between Information Systems and Operations Research, Part I — Models of Systems. Annals of Operations Research 71, Baltzer, Amsterdam 1997, S. 3–14.

    Google Scholar 

  37. Simos, M.; Creps, D.; Klinger, C.; Levine, L.; Allemang, D.: Organization domain modeling (ODM) guidebook, version 2.0. Software Technology for Adaptable, Reliable Systems (STARS), Arbeitsbericht STARS-VC-A025/001/00, 1996.

    Google Scholar 

  38. Szyperski, C. (mit Gruntz, D.; Murer, S.): Component Software: Beyond Object-Oriented Programming. 2. Aufl., Addison-Wesley, Reading 2003.

    Google Scholar 

  39. Turowksi, K. (Hrsg.): Vereinheitlichte Spezifikation von Fachkomponenten. Memorandum des Arbeitskreises 5.10.3 (Komponenten-orientierte betriebliche Anwendungssysteme) der Gesellschaft für Informatik, Februar 2002.

    Google Scholar 

  40. Vaessens, R. J. M.; Aarts, E. H. L.; Len-stra, J. K.: A local search template. Computers & Operations Research 25 (1998), S. 969–979.

    Google Scholar 

  41. Voß, S.: Meta-heuristics: The state of the art. In: Nareyek, A. (Hrsg.): Local Search for Planning and Scheduling, Lecture Notes in Artificial Intelligence 2148. Springer, Berlin Heidelberg 2001, S. 1–23.

    Chapter  Google Scholar 

  42. Voß, S.; Woodruff, D. L. (Hrsg.): Optimization Software Class Libraries. Kluwer, Boston 2002.

    Google Scholar 

  43. Weihe, K.: Reuse of algorithms: Still a challenge to object-oriented programming. In: ACM SIGPLAN Notices 32 (1997) 10, S. 34–48.

    Google Scholar 

  44. Weiss, D. J.; Lai, C. T. R.: Software Product-Line Engineering: A Family-Based Software Development Process. Addison-Wesley, Reading 1999.

    Google Scholar 

  45. Wolpert, D. H.; Macready, W. G.: No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation 1 (1997), S. 67–82.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Wirtschaftsinformatik, Universität Hamburg, Von-Melle-Park 5, 20146, Hamburg, Deutschland

    Andreas Fink &  Stefan Voß

Authors
  1. Andreas Fink
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stefan Voß
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Andreas Fink.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fink, A., Voß, S. Anwendung von Metaheuristiken zur Lösung betrieblicher Planungsprobleme. Wirtschaftsinf 45, 395–407 (2003). https://doi.org/10.1007/BF03250905

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03250905

Keywords

Search

Navigation