2018
DOI: 10.22237/jmasm/1532525455
|View full text |Cite
|
Sign up to set email alerts
|

A Distance Based Method for Solving Multi-Objective Optimization Problems

Abstract: A new model for the weighted method of goal programming is proposed based on minimizing the distances between ideal objectives to feasible objective space. It provides the best compromised solution for Multi Objective Linear Programming Problems (MOLPP). The proposed model tackles MOLPP by solving a series of single objective subproblems, where the objectives are transformed into constraints. The compromise solution so obtained may be improved by defining priorities in terms of the weight. A criterion is also … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
8
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 13 publications
(8 citation statements)
references
References 28 publications
0
8
0
Order By: Relevance
“…A preference-based method is employed to convert this MOOP into a single objective optimisation problem using preference factors w 1 and w 2 assigned to each objective [14,16,17]. Thus:…”
Section: Defining Cost Functionmentioning
confidence: 99%
See 1 more Smart Citation
“…A preference-based method is employed to convert this MOOP into a single objective optimisation problem using preference factors w 1 and w 2 assigned to each objective [14,16,17]. Thus:…”
Section: Defining Cost Functionmentioning
confidence: 99%
“…This is to choose w 1 and w 2 in Equation ( 27) which may be the same or different. Considering the empirical knowledge regarding the optimisation problem, differential weights are preferable [17]. The weighted sum in Equation ( 27) uses a priori articulation of preferences, with the weights assigned directly based on their relative importance, as per the rating method [18].…”
Section: Objective Function Weightingsmentioning
confidence: 99%
“…Quddoos [13] proposed a method of finding a compromise variant of the route by determining the weight of different possible variants. In [14], multi-objective linear programming is used to minimize the distances between ideal objectives to a possible target space by transforming intermediate targets into constraints. Kamal [14] also uses a balanced method of programming goals and minimizing the distances between ideal goals to a possible target space by solving subtasks of the general problem of linear programming.…”
Section: Introductionmentioning
confidence: 99%
“…In [14], multi-objective linear programming is used to minimize the distances between ideal objectives to a possible target space by transforming intermediate targets into constraints. Kamal [14] also uses a balanced method of programming goals and minimizing the distances between ideal goals to a possible target space by solving subtasks of the general problem of linear programming. In Fleischmann's article [15], various variants of mathematical modeling and a search for optimal solutions of reverse logistics are considered.…”
Section: Introductionmentioning
confidence: 99%
“…FGP technique is used for achieving the highest degree of each of the defined membership goals to the extent possible in the decision-making. Kamal et al (2018) considered a MOTP and developed a new technique called the distance-based method for solving it.…”
Section: Introductionmentioning
confidence: 99%