Combinatorial optimization problems appear in many real life applications as timetabling, planning and scheduling. However, they are often NP-hard. This means that there is no general and efficient algorithm ... solving…
those made by D-Wave Systems can be used for solving complex combinatorial optimization problems, which makes them increasingly attractive for researchers in this domain. For the author, coming from
Abstract Routing problems are classical combinatorial optimization tasks that find much applicability in numerous industrial and real-world scenarios. One challenging variant of the routing problem is the Fuel…
Packing Problem (BPP) is one of the most known combinatorial optimization problems. The main objective of the problem is to minimize the number of bins used and pack the items
evolutionary algorithms since the mid1990s (EAs). The earliest findings were based on toy problems using extremely simple algorithms like the (1+1)-EA. This work resulted in a better knowledge ... reality, it has been…
approximate optimization algorithm (QAOA) is a hybrid variational quantum-classical algorithm that solves combinatorial optimization problems. While there is evidence suggesting that the fixed form of the standard QAOA…
Colony Optimization is a new meta-heuristic technique used for solving different combinatorial optimization problems. ACO is based on the behaviors of ant colony and this method has strong robustness ... calculative…
Many problems can be expreesed as global or combinatorial optimization problems, however due the vast increase in the availability of data bases, realistically sized instances cannot be solved in reasonnable
jobs and „m‟ operations on each of the jobs and it is hardest combinatorial optimization problems for which it is extremely difficult to find optimal solutions. Past two decades, much ... Colony Optimization, Tabu…
hard problem in combinatorial optimization, important in research and theoretical computer science. Bio- inspired algorithms such as Ant colony Optimization, Bee Colony Optimization, cuckoo Search Optimization three…
algorithm. A meta-heuristic algorithm Ant Colony optimization which is applied on the combinatorial optimized problems to get the optimal solution. Among common combinatorial problems one is Travelling-Salesman Problem…
University course timetabling is known to be hard combinatorial optimization problem. It is difficult to tackle the constraints including the classroom, course and the teacher requirement. Some optimization approaches…
most popular scheduling models existing in practice, which is among the hardest combinatorial optimization problems . Particle Swarm Optimization (PSO) is a population based metaheuristic that takes advantage of…
decision trees by construction of the set of Pareto-optimal points for the corresponding bi-criteria optimization problem. The applications include study of totally optimal (simultaneously optimal relative…
genetic algorithm is one of the best algorithms in order to solve many combinatorial optimization problems, especially traveling salesman problem. Genetic algorithm application produces quickly convergent results when
This paper presents a new method to solve the network reconfiguration problem. The uncertainty of system loads on different feeders which vary from time to time makes the distribution system ... prevent overload in the…
technology of the coming decades, is expected to excel in solving combinatorial optimization problems better than traditional methods. This study reviews current quantum optimization applications in logistics and…
resource allocation, virtual machine placement (VMP) is one of the most studied combinatorial optimization problems with several possible formulations and a large number of existing optimization criteria. In this invited
After proposing the first quantum algorithm for multiobjective combinatorial optimization problems using a convex combination of different objective functions, using the well-known two parabola problem as a simple…
Objective function-based clustering is here looked as a maximum-weight set partitioning combinatorial optimization problem, with the instance given by a pseudo-Boolean (set) function assigning real-valued cluster
Many combinatorial optimization problems can be mapped onto ground-state-search problems of the Ising model or more general neural network. However, physical Ising machines are often based on localized
Assembly sequence planning is a typical of representative combinatorial optimization problems in manufacturing. The general methods are used to generate a large number of feasible assembly sequences and find
principles of ant colony optimization (ACO), and developed to solve the binary and combinatorial optimization problems. It simulates restructured electricity markets, to explore the impact of consumers’ price elasticity
For authors and organisers
Publish, present and keep up with your field
Find the right journal for your paper and submit your manuscript.