Suchergebnisse - Multiple objective programming Metaheuristics Set packing problems Hybrid method
-
1
Using metaheuristic compromise programming for the solution of multiple-objective scheduling problems
ISSN: 0160-5682, 1476-9360Veröffentlicht: Basingstoke Taylor & Francis 01.06.2005Veröffentlicht in The Journal of the Operational Research Society (01.06.2005)“… In this paper, we propose a generic approach to find compromise solutions for multiple-objective scheduling problems using metaheuristics …”
Volltext
Journal Article -
2
Solving a multiobjective location routing problem with a metaheuristic based on tabu search. Application to a real case in Andalusia : Multiple objective programming and goal programming: New trends and applications
ISSN: 0377-2217Veröffentlicht: Amsterdam Elsevier 2007Veröffentlicht in European journal of operational research (2007)Volltext
Tagungsbericht -
3
Do multiple-objective metaheuristics deliver on their promises? A computational experiment on the set-covering problem: Evolutionary multiobjective optimization
ISSN: 1089-778X, 1941-0026Veröffentlicht: New York, NY Institute of Electrical and Electronics Engineers 2003Veröffentlicht in IEEE transactions on evolutionary computation (2003)Volltext
Journal Article -
4
Do multiple-objective metaheuristics deliver on their promises? A computational experiment on the set-covering problem
ISSN: 1089-778X, 1941-0026Veröffentlicht: New York IEEE 01.04.2003Veröffentlicht in IEEE transactions on evolutionary computation (01.04.2003)“… ) and their single-objective counterparts on the multiple-objective set-covering problem (MOSCP). We use a methodology that allows consistent evaluation of the quality …”
Volltext
Journal Article -
5
A Comparative Study of Multiple-Objective Metaheuristics on the Bi-Objective Set Covering Problem and the Pareto Memetic Algorithm
ISSN: 0254-5330, 1572-9338Veröffentlicht: New York Springer Nature B.V 01.10.2004Veröffentlicht in Annals of operations research (01.10.2004)“… The paper describes a comparative study of multiple-objective metaheuristics on the bi-objective set covering problem …”
Volltext
Journal Article -
6
A LINEAR MULTIPLE OBJECTIVE PROGRAMMING FOR ASSORTMENT AND PACKING PROBLEMS
ISSN: 1017-0669, 2151-7606Veröffentlicht: Taylor & Francis Group 01.01.2009Veröffentlicht in Journal of the Chinese Institute of Industrial Engineers (01.01.2009)“… This study proposed a multiple objective programming method to solve assortment and packing problems …”
Volltext
Journal Article -
7
On Optimization Over the Efficient Set of a Multiple Objective Linear Programming Problem
ISSN: 0022-3239, 1573-2878Veröffentlicht: New York Springer US 01.01.2017Veröffentlicht in Journal of optimization theory and applications (01.01.2017)“… In this paper, we provide a mixed-integer programming approach for solving the problem of minimizing a real-valued function over the efficient set of a multiple objective linear program problem …”
Volltext
Journal Article -
8
Optimization over the efficient set of a parametric multiple objective linear programming problem
ISSN: 0377-2217, 1872-6860Veröffentlicht: Amsterdam Elsevier B.V 01.05.2000Veröffentlicht in European journal of operational research (01.05.2000)“… In this paper we consider the problem ( P) for optimizing a function over the efficient set of a multiple objective linear programming (MOLP …”
Volltext
Journal Article -
9
Interactive partitioning criteria set algorithms for multiple objective linear programming problems
ISBN: 9798207249537Veröffentlicht: ProQuest Dissertations & Theses 01.01.1991“… The purpose of the dissertation is to provide an appropriate solution strategy for multicriteria linear programming problems where a heavy cognitive burden on the DM is expected when the entire …”
Volltext
Dissertation -
10
On a fuzzy set approach to solving multiple objective linear fractional programming problem
ISSN: 0165-0114, 1872-6801Veröffentlicht: Amsterdam Elsevier B.V 16.03.2003Veröffentlicht in Fuzzy sets and systems (16.03.2003)“… In 1984, Luhandjula used a linguistic variable approach in order to present a procedure for solving multiple objective linear fractional programming problem (MOLFPP …”
Volltext
Journal Article -
11
Biconvex programming approach to optimization over the weakly efficient set of a multiple objective affine fractional problem
ISSN: 0167-6377, 1872-7468Veröffentlicht: Elsevier B.V 01.03.2001Veröffentlicht in Operations research letters (01.03.2001)“… We formulate the problem of optimizing a convex function over the weakly efficient set of a multicriteria affine fractional program as a special biconvex problem …”
Volltext
Journal Article -
12
A common formula to compute the efficient sets of a class of multiple objective linear programming problems
ISSN: 0233-1934, 1029-4945Veröffentlicht: Philadelphia Taylor & Francis 03.10.2015Veröffentlicht in Optimization (03.10.2015)“… Finding the efficient set of a multiple objective linear programming (MOLP) problem is difficult and finding the efficient sets of many MOLP problems is still more difficult …”
Volltext
Journal Article -
13
A Bilinear Algorithm for Optimizing a Linear Function over the Efficient Set of a Multiple Objective Linear Programming Problem
ISSN: 0925-5001, 1573-2916Veröffentlicht: Dordrecht Springer Nature B.V 01.01.2005Veröffentlicht in Journal of global optimization (01.01.2005)“… The problem Q of optimizing a linear function over the efficient set of a multiple objective linear program serves several useful purposes in multiple criteria decision making …”
Volltext
Journal Article -
14
An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem
ISSN: 0925-5001, 1573-2916Veröffentlicht: Boston Springer US 01.03.2012Veröffentlicht in Journal of global optimization (01.03.2012)“… This article presents for the first time an algorithm specifically designed for globally minimizing a finite, convex function over the weakly efficient set of a multiple objective nonlinear programming problem (V1 …”
Volltext
Journal Article -
15
An interactive method by founding weights via bargaining sets to solve the multiple objective linear programming problems
ISBN: 1890843067, 9781890843069Veröffentlicht: IEEE 2001Veröffentlicht in Portland International Conference on Management of Engineering and Technology (PICMET), 2001 (2001)“… In this paper, the authors consider the multiple objective linear programming (MOLP) problem which is defined as a linear type of the multiple objective mathematical programming …”
Volltext
Tagungsbericht -
16
An Outer Approximation Algorithm for Generating All Efficient Extreme Points in the Outcome Set of a Multiple Objective Linear Programming Problem
ISSN: 0925-5001, 1573-2916Veröffentlicht: Dordrecht Springer Nature B.V 1998Veröffentlicht in Journal of global optimization (1998)“… Various difficulties have been encountered in using decision set-based vector maximization methods to solve a multiple objective linear programming problem (MOLP …”
Volltext
Journal Article -
17
Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem
ISSN: 0377-2217, 1872-6860Veröffentlicht: Amsterdam Elsevier B.V 16.07.2010Veröffentlicht in European journal of operational research (16.07.2010)“… The bi-objective set packing problem is a multi-objective combinatorial optimization problem similar to the well-known set covering/partitioning problems …”
Volltext
Journal Article

