Advertisement

The Parallel Predator-Prey Model: A Step towards Practical Application

  • Christian Grimme
  • Joachim Lepping
  • Alexander Papaspyrou
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5199)

Abstract

In this paper, we apply the parallel predator-prey model for multi-objective optimization to a combinatorial problem for the first time: Exemplarily, we optimize sequences of 50 jobs for an instance of the bi-criteria scheduling problem 1|d j | ∑ C j ,L max with this approach. The modular building block architecture of the predator-prey system and the distribution of acting entities enables the analysis of separated problem knowledge and the design of corresponding variation operators. The actual modules are derived from local heuristics that tackle fractions of the complete problem. We unveil that it is possible to cover different areas of the Pareto-front with special property operators and make evident that the whole front can be covered if those operators are applied simultaneously to the spatial population. Further, we identify open problems that arise when the predator-prey model is applied to combinatorial problems which have not yet occurred for real-valued optimization problems.

Keywords

Schedule Problem Variation Operator Maximum Lateness Total Completion Time Short Processing Time 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Deb, K.: Multi-Objective Optimization using Evolutionary Algorithms. Wiley-Interscience Series in Systems and Optimization. Wiley, Chichester (2001)zbMATHGoogle Scholar
  2. 2.
    Graham, R.L., Lawer, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey. Annals of Discrete Mathematics 5, 287–326 (1979)CrossRefzbMATHMathSciNetGoogle Scholar
  3. 3.
    Grimme, C., Lepping, J.: Designing Multi-Objective Variation Operators Using a Predator-Prey Approach. In: Obayashi, S., Deb, K., Poloni, C., Hiroyasu, T., Murata, T. (eds.) EMO 2007. LNCS, vol. 4403, pp. 21–35. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  4. 4.
    Grimme, C., Lepping, J., Papaspyrou, A.: Exploring the Behavior of Building Blocks for Multi-Objective Variation Operator Design using Predator-Prey Dynamics. In: Thierens, D., et al. (eds.) Prococeedings of the Genetic and Evolutionary Computation Conference (GECCO), London, United Kingdom, vol. 1, pp. 805–812. ACM Press, New York (2007)Google Scholar
  5. 5.
    Jackson, J.R.: Scheduling a Production Line to Minimze Maximum Tardiness. Management Science Research Project, Research Report 43, University of California, Los Angeles (1955)Google Scholar
  6. 6.
    Laumanns, M., Rudolph, G., Schwefel, H.-P.: A Spatial Predator-Prey Approach to Multi-Objective Optimization: A Preliminary Study. In: Eiben, A.E., Bäck, Th., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, pp. 241–249. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  7. 7.
    Li, X.: A Real-Coded Predator-Prey Genetic Algorithm for Multiobjective Optimization.. In: Proceedings of the Second International Conference on Evolutionary Multi-Criterion Optimization (EMO), pp. 207–221 (2003)Google Scholar
  8. 8.
    Schmitt, K., Mehnen, J., Michelitsch, T.: Using Predators and Preys in Evolution Strategies. In: Beyer, H.-G., et al. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), vol. 1, pp. 827–828. ACM Press, New York (2005)Google Scholar
  9. 9.
    Smith, W.E.: Various Optimizers for Single-stage Production. Naval Research Logistics Quarterly 3, 59–66 (1956)CrossRefMathSciNetGoogle Scholar
  10. 10.
    T’kindt, V., Billaut, J.-C.: Multicriteria Scheduling. Theory, Models and Algorithms, 2nd edn. Springer, Berlin (2006)zbMATHGoogle Scholar
  11. 11.
    van Wassenhove, L.N., Gelders, F.: Solving a Bicriterion Scheduling Problem. European Journal of Operational Research 2(4), 281–290 (1980)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Christian Grimme
    • 1
  • Joachim Lepping
    • 1
  • Alexander Papaspyrou
    • 1
  1. 1.Robotics Research Institute - Section Information TechnologyDortmund University of TechnologyDortmundGermany

Personalised recommendations