Many Objective Optimisation: Direct Objective Boundary Identification

  • Evan J. Hughes
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5199)


This paper describes and demonstrates a new and highly innovative technique that identifies an approximation of the entire bounding surface of the feasible objective region directly, including deep concavities, disconnected regions and the edges of interior holes in the feasible areas. The Pareto front is a subset of the surface of the objective boundary and can be extracted easily. Importantly, if the entire objective boundary is known, breaks and discontinuities in the Pareto front may be identified using automated methods; even with high objective dimensionality. This paper describes a proof-of-principle evolutionary algorithm that implements the new and unique Direct Objective Boundary Identification (DOBI) method.


Pareto Front Objective Space Delaunay Triangulation Random Search Objective Boundary 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Hughes, E.J.: Radar waveform optimisation as a many-objective application benchmark. In: Obayashi, S., Deb, K., Poloni, C., Hiroyasu, T., Murata, T. (eds.) EMO 2007. LNCS, vol. 4403, pp. 700–714. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  2. 2.
    Hughes, E.J.: MSOPS-II: A general-purpose many-objective optimiser. In: Congress on Evolutionary Computation CEC 2007, Singapore, pp. 3944–3951. IEEE, Los Alamitos (2007)CrossRefGoogle Scholar
  3. 3.
    Purshouse, R.C.: On the Evolutionary Optimisation of Many Objectives. PhD thesis, Department of Automatic Control and Systems Engineering, The University of Sheffield, Sheffield, UK (September 2003)Google Scholar
  4. 4.
    Hughes, E.J.: Evolutionary many-objective optimisation: Many once or one many? In: IEEE Congress on Evolutionary Computation, vol. 1, pp. 222–227. IEEE, Los Alamitos (2005)Google Scholar
  5. 5.
    Knowles, C., Deb, K. (eds.): Multiobjective Problem Solving from Nature: From Concepts to Applications. Natural Computing Series. Springer, Berlin (2008)Google Scholar
  6. 6.
    Zhao, H., Osher, S., Fedkiw, R.: Fast surface reconstruction using the level set method. In: Proceedings of IEEE Workshop on Variational and Level Set Methods in Computer Vision (VLSM 2001) (July 2001)Google Scholar
  7. 7.
    Jiřina, M.: Nearest neighbour distance statistics estimation. Technical report, Institute of Computer Science: Academy of Sciences of the Czech Republic (October 2002),
  8. 8.
    Muller, M.E.: A note on a method for generating points uniformly on n-dimensional spheres. Communications of the ACM 2, 19–20 (1959)CrossRefzbMATHGoogle Scholar
  9. 9.
    Hicks, J.S., Wheeling, R.F.: An efficient method for generating uniformly distributed points on the surface of an n-dimensional sphere. Communications of the ACM 2, 17–19 (1959)CrossRefzbMATHGoogle Scholar
  10. 10.
    Rose, C., Smith, M.D.: Mathematical Statistics with Mathematica. Springer, Heidelberg (2002)CrossRefzbMATHGoogle Scholar
  11. 11.
    Hughes, E.J.: Software resources,
  12. 12.
    Jacquelin, J.: Le problème de l’hyperchèvre. Quadrature (49), 6–12 (July- September 2003), ISSN 1142-2785

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Evan J. Hughes
    • 1
  1. 1.Department of Informatics and SensorsCranfield UniversityDCMT, ShrivenhamUK

Personalised recommendations