Many problems of combinatorial optimization belong to the class of NP-complete problems and can be solved efficiently only by heuristics. Both, Genetic Algorithms and Evolution Strategies have a number of drawbacks that reduce their applicability to that kind of problems. During the last decades plenty of work has been investigated in order to introduce new coding standards and operators especi...

a compact formulation of the set of tours neither in a graph nor its complement is presented and illustrates a general methodology proposed for constructing polyhedral models of decision problems based upon permutations, projection and lifting techniques. directed hamilton tours on n vertex graphs are interpreted as (n-1)- permutations. sets of extrema of birkhoff polyhedra are mapped to tours ...

Many problems involve not structured environments which can be solved from the perspective of Bioinspired Algorithms (Cultural Algorithms). In this paper, a proposed algorithm is used to resolve a famous game known as Japanese puzzles, which are analyzed for obtain the optimal solution. The authors show that Japanese Puzzles are constrained combinatorial optimization problems, which can be solv...

Scope and Purpose There are a vast number of practical design and resource-allocation problems, in many different fields, where the decision to be made is a matching (or assignment) of items in one set to items in another, disjoint set. If the costs associated are simply constants for each possible pairing, this is the classical " Assignment Problem " , for which good algorithms have been known...

Many combinatorial optimization problems over graphs are NP-hard, and require significant specialized knowledge and trial-and-error to design good heuristics or approximation algorithms. Can we automate this challenging and tedious process, and learn the algorithms instead? In many real world applications, it is typically the case that the same type of optimization problem is solved again and a...

In the recently published book on the Traveling Salesman Problem, half of Chapter 6 [18] is devoted to domination analysis (DA) of heuristics for the Traveling Salesman Problem. Another chapter [16] is a detailed overview of the whole area of DA. Both chapters are of considerable length. The purpose of this paper is to give a short introduction to results and applications of DA. While we do not...

It is very common in an enterprise daily operation to solve Container Loading Problem (CLP). Especially, it is an important issue in the logistic management. The problem aims to determine the arrangement of objects with the best utilization ratio in a container. It belongs to the combinatorial optimization problem. In this paper, a two-phased method focusing on the improvement of the efficiency...

Consider a complete graph G = (V,E), in which each node is present with probability pi. We are interested in solving combinatorial optimization problems on subsets of nodes present with a certain probability. We introduce the idea of a priori optimization as a strategy competitive to the strategy of re-optimization, under which the combinatorial optimization problem is solved optimally for ever...