Use this url to cite publication: https://hdl.handle.net/20.500.12259/41471
Pareto set approximation by the method of adjustable weights and successive lexicographic goal programming
Type of publication
Straipsnis Web of Science ir Scopus duomenų bazėje / Article in Web of Science and Scopus database (S1)
Author(s)
Author | Affiliation | |
---|---|---|
Pardalos, Panos M. | ||
Title [en]
Pareto set approximation by the method of adjustable weights and successive lexicographic goal programming
Is part of
Optimization letters. New York : Springer, 2012, Vol. 6, iss. 4
Date Issued
Date |
---|
2012 |
Publisher
New York : Springer
Publisher (trusted)
Extent
p. 665-678
Abstract (en)
A nonlinear multiobjective optimization problem is considered. Two methods are proposed to generate solutions with an approximately uniform distribution in a Pareto set. The first method is supposed to find the solutions as minimizers of weighted sums of objective functions where the weights are properly selected using a branch and bound type algorithm. The second method is based on lexicographic goal programming. The proposed methods are compared with several metaheuristic methods using two and three-criteria tests and applied problems.
Type of document
type::text::journal::journal article::research article
Language
Anglų / English (en)
Coverage Spatial
Jungtinės Amerikos Valstijos / United States of America (US)
ISSN (of the container)
1862-4472
WOS
WOS:000304624000006
Other Identifier(s)
VDU02-000016233
Journal | IF | AIF | AIF (min) | AIF (max) | Cat | AV | Year | Quartile |
---|---|---|---|---|---|---|---|---|
Optimization Letters | 1.654 | 1.28 | 1.08 | 1.481 | 2 | 1.431 | 2012 | Q1 |
Journal | IF | AIF | AIF (min) | AIF (max) | Cat | AV | Year | Quartile |
---|---|---|---|---|---|---|---|---|
Optimization Letters | 1.654 | 1.28 | 1.08 | 1.481 | 2 | 1.431 | 2012 | Q1 |
Journal | Cite Score | SNIP | SJR | Year | Quartile |
---|---|---|---|---|---|
Optimization Letters | 2 | 1.722 | 1.205 | 2012 | Q2 |