Sciweavers

HEURISTICS
2008
124views more  HEURISTICS 2008»
13 years 4 months ago
A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
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...
Michael Polacek, Karl F. Doerner, Richard F. Hartl...
NGC
2000
Springer
13 years 8 months ago
The use of hop-limits to provide survivable ATM group communications
We examine the use of a hop-limit constraint with techniques to provide survivability for connection-oriented ATM group communications. A hop-limit constraint is an approach that ...
William Yurcik, David Tipper, Deep Medhi
CP
1997
Springer
13 years 9 months ago
GENIUS-CP: a Generic Single-Vehicle Routing Algorithm
This paper describes the combination of a well-known tsp heuristic, genius, with a constraint programming model for routing problems. The result, genius-cp, is an e cient heuristic...
Gilles Pesant, Michel Gendreau, Jean-Marc Rousseau
ICCSA
2009
Springer
13 years 11 months ago
A Performance Comparison of Swarm Intelligence Inspired Routing Algorithms for MANETs
Swarm Intelligence (SI) inspired routing algorithms have become a research focus in recent years due to their self-organizing nature, which is very suitable to the routing problems...
Jin Wang, Sungyoung Lee