Sciweavers

178 search results - page 16 / 36
» Improving Ant Colony Optimization Algorithms for Solving Tra...
Sort
View
CEC
2011
IEEE
12 years 7 months ago
Oppositional biogeography-based optimization for combinatorial problems
Abstract—In this paper, we propose a framework for employing opposition-based learning to assist evolutionary algorithms in solving discrete and combinatorial optimization proble...
Mehmet Ergezer, Dan Simon
TEC
2002
152views more  TEC 2002»
13 years 7 months ago
Ant colony optimization for resource-constrained project scheduling
An ant colony optimization (ACO) approach for the resource-constrained project scheduling problem (RCPSP) is presented. Several new features that are interesting for ACO in general...
Daniel Merkle, Martin Middendorf, Hartmut Schmeck
GECCO
2009
Springer
107views Optimization» more  GECCO 2009»
14 years 2 months ago
Swarming along the evolutionary branches sheds light on genome rearrangement scenarios
A genome rearrangement scenario describes a series of chromosome fusion, fission, and translocation operations that suffice to rewrite one genome into another. Exact algorithmic ...
Nikolay Vyahhi, Adrien Goëffon, Macha Nikolsk...
IPL
2002
118views more  IPL 2002»
13 years 7 months ago
Differential approximation results for the traveling salesman and related problems
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...
Jérôme Monnot
SODA
2010
ACM
231views Algorithms» more  SODA 2010»
14 years 4 months ago
Asymmetric Traveling Salesman Path and Directed Latency Problems
We study integrality gaps and approximability of two closely related problems on directed graphs. Given a set V of n nodes in an underlying asymmetric metric and two specified nod...
Zachary Friggstad, Mohammad R. Salavatipour, Zoya ...