Výsledky vyhledávání - "Multiobjective combinatorial optimization"
-
1
Effective anytime algorithm for multiobjective combinatorial optimization problems
ISSN: 0020-0255, 1872-6291Vydáno: Elsevier Inc 01.07.2021Vydáno v Information sciences (01.07.2021)“…In multiobjective optimization, the result of an optimization algorithm is a set of efficient solutions from which the decision maker selects one. It is common…”
Získat plný text
Journal Article -
2
A Random Forest-Assisted Evolutionary Algorithm for Data-Driven Constrained Multiobjective Combinatorial Optimization of Trauma Systems
ISSN: 2168-2267, 2168-2275, 2168-2275Vydáno: United States IEEE 01.02.2020Vydáno v IEEE transactions on cybernetics (01.02.2020)“…Many real-world optimization problems can be solved by using the data-driven approach only, simply because no analytic objective functions are available for…”
Získat plný text
Journal Article -
3
A greedy hypervolume polychotomic scheme for multiobjective combinatorial optimization
ISSN: 0305-0548Vydáno: Elsevier Ltd 01.11.2025Vydáno v Computers & operations research (01.11.2025)“…The usual goal in multiobjective combinatorial optimization is to find the complete set of nondominated points. However, in general, the nondominated set may…”
Získat plný text
Journal Article -
4
New techniques to improve neighborhood exploration in pareto local search
ISSN: 0957-4174Vydáno: Elsevier Ltd 15.11.2024Vydáno v Expert systems with applications (15.11.2024)“…Pareto Local Search (PLS) is an extension of local search to multiobjective combinatorial optimization problems (MCOPs). It is widely used as a building block…”
Získat plný text
Journal Article -
5
PPLS/D: Parallel Pareto Local Search Based on Decomposition
ISSN: 2168-2267, 2168-2275, 2168-2275Vydáno: United States IEEE 01.03.2020Vydáno v IEEE transactions on cybernetics (01.03.2020)“…Pareto local search (PLS) is a basic building block in many metaheuristics for a multiobjective combinatorial optimization problem. In this paper, an enhanced…”
Získat plný text
Journal Article -
6
An exact method for the biobjective shortest path problem for large-scale road networks
ISSN: 0377-2217, 1872-6860Vydáno: Amsterdam Elsevier B.V 01.05.2015Vydáno v European journal of operational research (01.05.2015)“…•Recursive exact algorithm that implicitly enumerates all solutions.•Fast method that works well on graphs of up to 1.2 million nodes and 2.8 million…”
Získat plný text
Journal Article -
7
RM-MOCO: A Fast-Solving Model for Neural Multi-Objective Combinatorial Optimization Based on Retention
ISSN: 2096-9929, 2097-3705Vydáno: Tsinghua University Press 01.06.2025Vydáno v Complex System Modeling and Simulation (01.06.2025)“…Multiobjective combinatorial optimization (MOCO) problems have a wide range of applications in the real world. Recently, learning-based methods have achieved…”
Získat plný text
Journal Article -
8
ccDNCA: A Dual-Neighborhood Search-Based Dual-Population Coevolutionary Algorithm for Multi-UAV Task Allocation Problems With Complex Constraints
ISSN: 2327-4662, 2327-4662Vydáno: Piscataway IEEE 15.10.2025Vydáno v IEEE internet of things journal (15.10.2025)“…Solving the multiple unmanned aerial vehicles task allocation problem with complex constraints (MTAPCc) by means of the constrained multiobjective evolutionary…”
Získat plný text
Journal Article -
9
A hybrid metaheuristic for multiobjective unconstrained binary quadratic programming
ISSN: 1568-4946, 1872-9681Vydáno: Elsevier B.V 01.03.2014Vydáno v Applied soft computing (01.03.2014)“…•We extend conventional single-objective unconstrained binary quadratic programming (UBQP) to the multiobjective case.•We define a flexible model to generate…”
Získat plný text
Journal Article -
10
A Cooperative Hybrid Quantum-Inspired Salp Swarm and Differential Evolution for Solving CEC 2022 Benchmark and Controller Placement Problems in Software Defined Networks
ISSN: 2169-3536, 2169-3536Vydáno: Piscataway IEEE 2024Vydáno v IEEE access (2024)“…This paper introduces a Cooperative Model of Salp Swarm Optimization (CMSSO), which combines four algorithms: Salp Swarm Algorithm (SSA), Elite Opposition…”
Získat plný text
Journal Article -
11
Solving a multiobjective location routing problem with a metaheuristic based on tabu search. Application to a real case in Andalusia
ISSN: 0377-2217, 1872-6860Vydáno: Amsterdam Elsevier B.V 16.03.2007Vydáno v European journal of operational research (16.03.2007)“…In this work we present a multiobjective location routing problem and solve it with a multiobjective metaheuristic procedure. In this type of problem, we have…”
Získat plný text
Journal Article -
12
Using multiobjective optimization for biclustering microarray data
ISSN: 1568-4946, 1872-9681Vydáno: Elsevier B.V 01.08.2015Vydáno v Applied soft computing (01.08.2015)“…[Display omitted] •A new multiobjective modeling for the biclustering problem.•A new hybrid multiobjective algorithm gradually conceived for best…”
Získat plný text
Journal Article -
13
Pareto Ant Colony Optimization: A Metaheuristic Approach to Multiobjective Portfolio Selection
ISSN: 0254-5330, 1572-9338Vydáno: New York Springer Nature B.V 01.10.2004Vydáno v Annals of operations research (01.10.2004)“…Selecting the "best" project portfolio out of a given set of investment proposals is a common and often critical management issue. Decision-makers must…”
Získat plný text
Journal Article -
14
A greedy memetic algorithm for a multiobjective dynamic bin packing problem for storing cooling objects
ISSN: 1381-1231, 1572-9397Vydáno: New York Springer US 01.02.2019Vydáno v Journal of heuristics (01.02.2019)“…In this paper, a multiobjective dynamic bin packing problem for storing cooling objects is introduced along with a metaheuristic designed to work well in…”
Získat plný text
Journal Article -
15
On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem
ISSN: 1432-5217, 1432-2994, 1432-5217Vydáno: Berlin, Heidelberg Springer 01.08.2020Vydáno v Mathematical methods of operations research (Heidelberg, Germany) (01.08.2020)“…In this article, we introduce the rectangular knapsack problem as a special case of the quadratic knapsack problem consisting in the maximization of the…”
Získat plný text
Journal Article -
16
Weight-Specific-Decoder Attention Model to Solve Multiobjective Combinatorial Optimization Problems
ISSN: 2577-1655Vydáno: IEEE 09.10.2022Vydáno v Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics (09.10.2022)“…The multiobjective combinatorial optimization problems (MOCOPs) have a wide range of real-world applications. Designing an effective algorithm has an important…”
Získat plný text
Konferenční příspěvek -
17
Pareto ant colony optimization with ILP preprocessing in multiobjective project portfolio selection
ISSN: 0377-2217, 1872-6860Vydáno: Amsterdam Elsevier B.V 16.06.2006Vydáno v European journal of operational research (16.06.2006)“…One of the most important, common and critical management issues lies in determining the “best” project portfolio out of a given set of investment proposals…”
Získat plný text
Journal Article -
18
Cross entropy for multiobjective combinatorial optimization problems with linear relaxations
ISSN: 0377-2217, 1872-6860Vydáno: Amsterdam Elsevier B.V 01.06.2015Vydáno v European journal of operational research (01.06.2015)“…•A multiobjective optimization cross entropy (MOCE) procedure for MOCO problems.•It benefits of the linear relaxation, that can be solved with modest…”
Získat plný text
Journal Article -
19
Working principles, behavior, and performance of MOEAs on MNK-landscapes
ISSN: 0377-2217, 1872-6860Vydáno: Amsterdam Elsevier B.V 16.09.2007Vydáno v European journal of operational research (16.09.2007)“…This work studies the working principles, behavior, and performance of multiobjective evolutionary algorithms (MOEAs) on multiobjective epistatic fitness…”
Získat plný text
Journal Article -
20
Speed-up techniques for solving large-scale biobjective TSP
ISSN: 0305-0548, 1873-765X, 0305-0548Vydáno: New York Elsevier Ltd 01.03.2010Vydáno v Computers & operations research (01.03.2010)“…In this paper, we present the Two-Phase Pareto Local Search ( 2PPLS) method with speed-up techniques for the heuristic resolution of the biobjective traveling…”
Získat plný text
Journal Article