94 search results - page 7 / 19 » Competitive Memetic Algorithms for Arc Routing Problems |
ARCS
2004
Springer
14 years 23 days ago
2004
Springer
: This paper addresses the optimization of a dynamic Traveling Salesman Problem using the Ant Colony Optimization algorithm. Ants are social insects with limited skills that live i...
SODA
1998
ACM
13 years 8 months ago
1998
ACM
We present the first polylog-competitive online algorithm for the general multicast admission control and routing problem in the throughput model. The ratio of the number of reque...
NETWORKS
2007
13 years 6 months ago
2007
Internet protocol (IP) traffic follows rules established by routing protocols. Shortest path based protocols, such as Open Shortest Path First (OSPF), direct traffic based on arc w...
COR
2008
13 years 6 months ago
2008
In this paper we review the exact algorithms proposed in the last three decades for the solution of the vehicle routing problem with time windows (VRPTW). The exact algorithms for...
CIAC
2010
Springer
13 years 10 months ago
2010
Springer
A flow on a directed network is said to be confluent if the flow uses at most one outgoing arc at each node. Confluent flows arise naturally from destination-based routing. We stud...