Many real world industrial applications involve finding a Hamiltonian path with minimum cost. Some instances that belong to this category are transportation routing problem, scan c...
This paper experimentally investigates the dynamical behavior of a search process in a local heuristic search system for a combinatorial optimization problem. Or-opt heuristic algo...
This paper deals with the problem of constructing a Hamiltonian cycle of optimal weight, called TSP. We show that TSP is 2/3-differential approximable and can not be differential a...
We consider traveling salesman problems (TSPs) with a permuted Monge matrix as cost matrix where the associated patching graph has a specially simple structure: a multistar, a mult...
Rainer E. Burkard, Vladimir G. Deineko, Gerhard J....
Biogeography-based optimization (BBO) is a new evolutionary algorithm based on the science of biogeography. We propose two extensions to BBO. First, we propose blended migration. ...