Sciweavers

2343 search results - page 15 / 469
» The Locomotive Routing Problem
Sort
View
INFOCOM
2007
IEEE
14 years 1 months ago
On the Routing Problem in Disconnected Vehicular Ad-hoc Networks
Abstract— Vehicular Ad Hoc Wireless Network (VANET) exhibits a bipolar behavior in terms of network topology: fully connected topology with high traffic volume or sparsely conne...
Nawaporn Wisitpongphan, Fan Bai, Priyantha Mudalig...
ICNP
1999
IEEE
13 years 12 months ago
Fault Detection in Routing Protocols
Routing protocol faults cause problems ranging from an inability to communicate to excessive routing overhead. This paper proposes a system for detecting a wide range of routing p...
Daniel Massey, Bill Fenner
TAMC
2009
Springer
14 years 2 months ago
A Simple Greedy Algorithm for the k-Disjoint Flow Problem
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
Maren Martens
PDP
2002
IEEE
14 years 14 days ago
Parallel Simulated Annealing for the Vehicle Routing Problem with Time Windows
A parallel simulated annealing algorithm to solve the vehicle routing problem with time windows is presented. The objective is to find the best possible solutions to some wellkno...
Zbigniew J. Czech, Piotr Czarnas
COR
2006
93views more  COR 2006»
13 years 7 months ago
Solving capacitated arc routing problems using a transformation to the CVRP
A well known transformation by Pearn, Assad and Golden reduces a Capacitated Arc Routing Problem (CARP) into an equivalent Capacitated Vehicle Routing Problem (CVRP). However, tha...
Humberto Longo, Marcus Poggi de Aragão, Edu...