Sciweavers

2343 search results - page 103 / 469
» The Locomotive Routing Problem
Sort
View
CIKM
2007
Springer
14 years 2 months ago
A fast unified optimal route query evaluation algorithm
We investigate the problem of how to evaluate, fast and efficiently, classes of optimal route queries on a massive graph in a unified framework. To evaluate a route query effectiv...
Edward P. F. Chan, Jie Zhang
CCR
2002
99views more  CCR 2002»
13 years 10 months ago
Implementation experience with MANET routing protocols
This paper outlines our experience with the implementation and deployment of two MANET routing protocols on a five node, four hop, network. The work was prompted by the lack of pu...
Kwan Wu Chin, John Judge, Aidan Williams, Roger Ke...
TRANSCI
1998
78views more  TRANSCI 1998»
13 years 9 months ago
Queue Spillovers in Transportation Networks with a Route Choice
This paper explores some of the traffic phenomena that arise when drivers have to navigate a network in which queues back up past diverge intersections. If a diverge provides two ...
Carlos F. Daganzo
IJAIT
2010
167views more  IJAIT 2010»
13 years 8 months ago
Bee Colony Optimization with Local Search for Traveling Salesman Problem
Many real world industrial applications involve finding a Hamiltonian path with minimum cost. Some instances that belong to this category are transportation routing problem, scan c...
Li-Pei Wong, Malcolm Yoke-Hean Low, Chin Soon Chon...
CORR
2007
Springer
76views Education» more  CORR 2007»
13 years 10 months ago
A Light-Based Device for Solving the Hamiltonian Path Problem
In this paper we suggest the use of light for performing useful computations. Namely, we propose a special device which uses light rays for solving the Hamiltonian path problem on ...
Mihai Oltean