151 search results - page 25 / 31 » Ant Colony Optimization for the Ship Berthing Problem |
GECCO
2003
Springer
15 years 4 months ago
2003
Springer
The aim of the paper is to investigate methods for deriving a suitable set of test paths for a software system. The design and the possible uses of the software system are modelled...
103
click to vote
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
Model Checking is a well-known and fully automatic technique for checking software properties, usually given as temporal logic formulae on the program variables. Most model checke...
102
click to vote
GECCO
2006
Springer
15 years 3 months ago
2006
Springer
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...
108
click to vote
LION
2009
Springer
15 years 6 months ago
2009
Springer
Beam-ACO algorithms are hybrid methods that combine the metaheuristic ant colony optimization with beam search. They heavily rely on accurate and computationally inexpensive boundi...
89
Voted
JGO
2010
14 years 10 months ago
2010
A new and universal penalty method is introduced in this contribution. It is especially intended to be applied in stochastic metaheuristics like genetic algorithms, particle swarm...