94 search results - page 3 / 19 » Competitive Memetic Algorithms for Arc Routing Problems |
CEC
2009
IEEE
13 years 10 months ago
2009
IEEE
Abstract— Memetic algorithms arise as very effective algorithms to obtain reliable and high accurate solutions for complex continuous optimization problems. Nowadays, high dimens...
HM
2007
Springer
13 years 11 months ago
2007
Springer
For the NP-hard Optimum Communication Spanning Tree (OCST) problem a cost minimizing spanning tree has to be found, where the cost depends on the communication volume between each ...
EVOW
2008
Springer
13 years 7 months ago
2008
Springer
In this paper we examine five different strategies for limiting the local search neighborhoods in the context of vehicle routing problems. The vehicle routing problem deals with th...
MEMETIC
2010
13 years 7 days ago
2010
In combinatorial solution spaces Iterated Local Search (ILS) turns out to be exceptionally successful. The question arises: is ILS also capable of improving the optimization proces...
HEURISTICS
2008
13 years 5 months ago
2008
In this talk we present a unified Variable Neighborhood Search (VNS) algorithm for the Capacitated Arc Routing Problem (CARP) and some of its variants - the Capacitated Arc Routin...