Výsledky vyhledávání - Multiple objective programming Metaheuristics Set packing problem Hybrid method*
-
1
Using metaheuristic compromise programming for the solution of multiple-objective scheduling problems
ISSN: 0160-5682, 1476-9360Vydáno: Basingstoke Taylor & Francis 01.06.2005Vydáno v 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…”
Získat plný text
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-2217Vydáno: Amsterdam Elsevier 2007Vydáno v European journal of operational research (2007)Získat plný text
Konferenční příspěvek -
3
Do multiple-objective metaheuristics deliver on their promises? A computational experiment on the set-covering problem: Evolutionary multiobjective optimization
ISSN: 1089-778X, 1941-0026Vydáno: New York, NY Institute of Electrical and Electronics Engineers 2003Vydáno v IEEE transactions on evolutionary computation (2003)Získat plný text
Journal Article -
4
Do multiple-objective metaheuristics deliver on their promises? A computational experiment on the set-covering problem
ISSN: 1089-778X, 1941-0026Vydáno: New York IEEE 01.04.2003Vydáno v 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…”
Získat plný text
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-9338Vydáno: New York Springer Nature B.V 01.10.2004Vydáno v Annals of operations research (01.10.2004)“…The paper describes a comparative study of multiple-objective metaheuristics on the bi-objective set covering problem…”
Získat plný text
Journal Article -
6
A LINEAR MULTIPLE OBJECTIVE PROGRAMMING FOR ASSORTMENT AND PACKING PROBLEMS
ISSN: 1017-0669, 2151-7606Vydáno: Taylor & Francis Group 01.01.2009Vydáno v 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…”
Získat plný text
Journal Article -
7
On Optimization Over the Efficient Set of a Multiple Objective Linear Programming Problem
ISSN: 0022-3239, 1573-2878Vydáno: New York Springer US 01.01.2017Vydáno v 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…”
Získat plný text
Journal Article -
8
Optimization over the efficient set of a parametric multiple objective linear programming problem
ISSN: 0377-2217, 1872-6860Vydáno: Amsterdam Elsevier B.V 01.05.2000Vydáno v 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…”
Získat plný text
Journal Article -
9
Interactive partitioning criteria set algorithms for multiple objective linear programming problems
ISBN: 9798207249537Vydáno: 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…”
Získat plný text
Dissertation -
10
On a fuzzy set approach to solving multiple objective linear fractional programming problem
ISSN: 0165-0114, 1872-6801Vydáno: Amsterdam Elsevier B.V 16.03.2003Vydáno v 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…”
Získat plný text
Journal Article -
11
Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem
ISSN: 0377-2217, 1872-6860Vydáno: Amsterdam Elsevier B.V 16.07.2010Vydáno v 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…”
Získat plný text
Journal Article -
12
Biconvex programming approach to optimization over the weakly efficient set of a multiple objective affine fractional problem
ISSN: 0167-6377, 1872-7468Vydáno: Elsevier B.V 01.03.2001Vydáno v 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…”
Získat plný text
Journal Article -
13
A common formula to compute the efficient sets of a class of multiple objective linear programming problems
ISSN: 0233-1934, 1029-4945Vydáno: Philadelphia Taylor & Francis 03.10.2015Vydáno v 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…”
Získat plný text
Journal Article -
14
A Bilinear Algorithm for Optimizing a Linear Function over the Efficient Set of a Multiple Objective Linear Programming Problem
ISSN: 0925-5001, 1573-2916Vydáno: Dordrecht Springer Nature B.V 01.01.2005Vydáno v 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…”
Získat plný text
Journal Article -
15
An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem
ISSN: 0925-5001, 1573-2916Vydáno: Boston Springer US 01.03.2012Vydáno v 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…”
Získat plný text
Journal Article -
16
An interactive method by founding weights via bargaining sets to solve the multiple objective linear programming problems
ISBN: 1890843067, 9781890843069Vydáno: IEEE 2001Vydáno v 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…”
Získat plný text
Konferenční příspěvek -
17
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-2916Vydáno: Dordrecht Springer Nature B.V 1998Vydáno v 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…”
Získat plný text
Journal Article

