Results 31 to 40 of about 167,714 (331)
Ant colony optimization and its application to the vehicle routing problem with pickups and deliveries [PDF]
, 2009 Ant Colony Optimization (ACO) is a population-based metaheuristic that can be used to find approximate solutions to difficult optimization problems. It was first introduced for solving the Traveling Salesperson Problem. Since then many implementations of
Catay, Bulent, Çatay, Bülent
core +1 more source
A Systematic Review of Hyper-Heuristics on Combinatorial Optimization Problems
IEEE Access, 2020 Hyper-heuristics aim at interchanging different solvers while solving a problem. The idea is to determine the best approach for solving a problem at its current state. This way, every time we make a move it gets us closer to a solution.
Melissa Sanchez +5 more
doaj +1 more source
Algorithms, 2018 We consider one approach to formalize the Resource-Constrained Project Scheduling Problem (RCPSP) in terms of combinatorial optimization theory. The transformation of the original problem into combinatorial setting is based on interpreting each operation
Alexander A. Lazarev +2 more
doaj +1 more source
An improved approach to resolve a combinatorial optimization problem based CoronaVirus Optimization Algorithm [PDF]
E3S Web of Conferences, 2022 Combinatorial optimization problems refer to intractable problems that can’t be performed using exact methods. The resolution of combinatorial problems geared towards the application of heuristics, metaheuristics also matheuristics, in order to provide ...
El Majdoubi Omayma +2 more
doaj +1 more source
An Active Set Algorithm for Robust Combinatorial Optimization Based on Separation Oracles [PDF]
, 2018 We address combinatorial optimization problems with uncertain coefficients varying over ellipsoidal uncertainty sets. The robust counterpart of such a problem can be rewritten as a second-oder cone program (SOCP) with integrality constraints.
Buchheim, Christoph, De Santis, Marianna
core +2 more sources
Statistical Mechanics of Steiner trees [PDF]
, 2008 The Minimum Weight Steiner Tree (MST) is an important combinatorial optimization problem over networks that has applications in a wide range of fields. Here we discuss a general technique to translate the imposed global connectivity constrain into many ...
A. Braunstein +10 more
core +2 more sources
Review of Nature Inspired Metaheuristic Algorithm Selection for Combinatorial t-Way Testing
IEEE Access, 2022 The metaheuristic algorithm is a very important area of research that continuously improves in solving optimization problems. Nature-inspired is one of the metaheuristic algorithm classifications that has grown in popularity among researchers over the ...
Aminu Aminu Muazu +2 more
doaj +1 more source
Hybrid Particle Swarm Optimization Algorithm for Process Planning
Mathematics, 2020 Process planning is a typical combinatorial optimization problem. When the scale of the problem increases, combinatorial explosion occurs, which makes it difficult for traditional precise algorithms to solve the problem.
Xu Zhang, Pan Guo, Hua Zhang, Jin Yao
doaj +1 more source
Nuevas técnicas de particionamiento en clasificación automática
Revista de Matemática: Teoría y Aplicaciones, 2009 In this article there are exposed some new thechniques for hte search of global optima inthe partitioning problem in Cluster Analysis. With these thechniques the results are sensibly improved with respect to the traditional methods. The methods developed
Eduardo Piza Volio +2 more
doaj +1 more source
Short Paper - A Note on Robust Combinatorial Optimization with Generalized Interval Uncertainty
Open Journal of Mathematical Optimization, 2023 In this paper, we consider a robust combinatorial optimization problem with uncertain weights and propose an uncertainty set that generalizes interval uncertainty by imposing lower and upper bounds on deviations of subsets of items.
Yaman, Hande
doaj +1 more source