Abstract

This paper deals with the Alienor method to tackle multiobjective nonlinear optimization problems. In this approach, the multiple criteria of the optimization problem are aggregated into a single one using weighted sums. Then, the resulting single objective nonlinear optimization problem is solved using the Alienor method associated with the Optimization Preserving Operators technique which has proved to be suitable for (nonlinear) optimization problems with a large number of variables (see [1]). The proposed approach is evaluated through test problems. The results show that the approach provides good approximations of the Pareto front while requiring small computational time, even for large instances.

Highlights

  • These last years, the field of multicriteria optimization have experienced some significant evolutions

  • This paper aims at extending the Alienor method approach to multiobjective nonlinear programming (MONLP) problems

  • We have proposed in this paper an extended approach to solve multiobjective non linear optimization problems (MONLP)

Read more

Summary

Introduction

These last years, the field of multicriteria optimization have experienced some significant evolutions This have allowed the development of several solutions methods or approaches. This multiplicity of multiobjective optimization methods is perceived like one of the wealth of this field This high number of approaches is explained by the diversity of the problems and the existence of various possible and legitimate solutions to these problems. In the literature on exact algorithms, more attention has been devoted to bicriteria optimization problems by using exact methods such as branch and bound algorithms, A algorithm and dynamic programming. These methods are effective for small size problems. For problems with more than two criteria, there aren’t many effective exact procedures, given the simultaneous difficulties coming from the NP-hard complexity of problems and the multicriteria framework of the problems [2]

Objectives
Methods
Results
Conclusion
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.