94 search results - page 10 / 19 » Competitive Memetic Algorithms for Arc Routing Problems |
CAAN
2007
Springer
13 years 11 months ago
2007
Springer
We study the efficiency of selfish routing problems in which traffic demands are revealed online. We go beyond the common Nash equilibrium concept in which possibly all players rer...
COR
2011
2011
An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows
13 years 2 months ago
The Vehicle Routing Problem with Time Windows is a complex combinatorial problem with many real-world applications in transportation and distribution logistics. Its main objective...
NETWORKS
2006
13 years 7 months ago
2006
We are given a directed network G = (V, A, u) with vertex set V , arc set A, a source vertex s V , a destination vertex t V , a finite capacity vector u = {uij}ijA, and a positi...
ARCS
2006
Springer
13 years 11 months ago
2006
Springer
An n-node tree has to be explored by a group of k mobile robots deployed initially at the root. Robots traverse the edges of the tree until all nodes are visited. We would like to ...
ICALP
2001
Springer
13 years 12 months ago
2001
Springer
In contrast to classical offline k-k routing, the online packet routing problem allows for an arbitrary number of packets with arbitrary end points and release times. We study this...