EUVIMEDEUVIMED entdecken
Open Access · CC BY-NC-ND 4.0

New ϵ − constraint methods for multi-objective integer linear programming: A Pareto front representation approach

Mariana Mesquita-Cunha, José Rui Figueira, Ana Paula Barbosa-Póvoa

European Journal of Operational Research · 2023-04 · 306 (1) · 286-307

DOI: 10.1016/j.ejor.2022.07.044 ↗

Kurz gefasst

Fachartikel in der Zeitschrift European Journal of Operational Research, 2023-04. Verfasst von Mariana Mesquita-Cunha und 2 weiteren Autor:innen. Die Arbeit wurde bisher 94-mal zitiert (Crossref) und nennt 36 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-ND 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Dealing with multi-objective problems by using generation methods has some interesting ad-vantages since it provides the decision-maker with the complete information about the set of non-dominated points (Pareto front) and a clear overview of the problem. However, providing many solutions to the decision-maker might also be overwhelming. As an alternative approach, presenting a representative set of solutions of the Pareto front may be advantageous. Choos-ing such a representative set is by itself also a multi-objective problem that must consider the number of solutions to present, the uniformity, and/or the coverage of the representation, to guarantee its quality. This paper proposes three algorithms for the representation problem for multi-objective integer linear programming problems with two or more objective functions, each one of them dealing with each dimension of the problem (cardinality, coverage, and uniformity). Such algorithms are all based on the (cid:15) -constraint approach. In addition, the paper also presents strategies to overcome poor estimations of the Pareto front bounds. The algorithms were tested on the ability to efficiently generate the whole Pareto front or its representation. The uniformity and cardinality algorithms proved to be very efficient both in binary and integer problems, being amongst the best in the literature. Both coverage and uniformity algorithms provide good quality representations on their targeted objective, while the cardinality algorithm appears to be the most flexible, privileging uniformity for lower cardinality representations and coverage on higher cardinality.

Zitieren

APA

Mesquita-Cunha, M., Figueira, J. R., & Barbosa-Póvoa, A. P. (2023). New ϵ − constraint methods for multi-objective integer linear programming: A Pareto front representation approach. European Journal of Operational Research, 306(1), 286-307. https://doi.org/10.1016/j.ejor.2022.07.044

Vancouver

Mesquita-Cunha M, Figueira JR, Barbosa-Póvoa AP. New ϵ − constraint methods for multi-objective integer linear programming: A Pareto front representation approach. European Journal of Operational Research. 2023;306(1):286-307. doi:10.1016/j.ejor.2022.07.044

BibTeX
@article{MesquitaCunha2023,
  author = {Mesquita-Cunha, Mariana and Figueira, José Rui and Barbosa-Póvoa, Ana Paula},
  title = {New ϵ − constraint methods for multi-objective integer linear programming: A Pareto front representation approach},
  journal = {European Journal of Operational Research},
  year = {2023},
  volume = {306},
  number = {1},
  pages = {286--307},
  doi = {10.1016/j.ejor.2022.07.044}
}
Kostenlos starten →