A goal programming-based algorithm for solving multi objective optimization problems

Abstract In multiobjective optimization scenarios, the challenge lies in balancing several conflicting objectives; classic optimization methods, which focus on a single measurable criterion, do not adequately address this issue. The existing approaches have aimed to improve the efficiency of solving such problems, but finding an optimal solution across multiple objectives remains complex. This paper proposes a new algorithm that first optimizes each objective function individually, using the resulting solutions as targets for further refinement. Through an ideal programming scheme, the algorithm minimizes deviations from these set goals. The proposed algorithm is used to solve a case study. The results derived from testing the algorithm demonstrate its superior performance relative to that of the other compared methods across all the objectives.

Authors

Institutions

Publication Details

Journal
Annals of Operations Research
Published
2025-06-02
DOI
https://doi.org/10.1007/s10479-025-06646-0
Citations
2
Primary Topic
Optimization and Mathematical Programming
Type
article
Field-Weighted Citation Impact
2.43

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A goal programming-based algorithm for solving multi objective optimization problems

Václav Snåšel, Sara Fanati Rashidi, Pavel Krömer, Maryam Olfati et al.
2 citations
Annals of Operations Research
Optimization and Mathematical Programming
2.43
article

A goal programming-based algorithm for solving multi objective optimization problems

Václav Snåšel, Sara Fanati Rashidi, Pavel Krömer, Maryam Olfati, Seyedali Mirjalili
article en
2 citations

Abstract

Abstract In multiobjective optimization scenarios, the challenge lies in balancing several conflicting objectives; classic optimization methods, which focus on a single measurable criterion, do not adequately address this issue. The existing approaches have aimed to improve the efficiency of solving such problems, but finding an optimal solution across multiple objectives remains complex. This paper proposes a new algorithm that first optimizes each objective function individually, using the resulting solutions as targets for further refinement. Through an ideal programming scheme, the algorithm minimizes deviations from these set goals. The proposed algorithm is used to solve a case study. The results derived from testing the algorithm demonstrate its superior performance relative to that of the other compared methods across all the objectives.

Annals of Operations Research
Obuda University (HU), VSB - Technical University of Ostrava (CZ), Torrens University Australia (AU), Innova (Hungary) (HU)
Ostravská Univerzita v Ostravě, Fakulta Elektrotechniky a Informatiky, Vysoká Škola Bánská - Technická Univerzita Ostrava
Openalex Percentile: Top 11%
Optimization and Mathematical Programming
2.43
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.