Sciweavers

599 search results - page 61 / 120
» The traveling salesman problem
Sort
View
ICCHP
2004
Springer
14 years 1 months ago
proXimity: Ad-Hoc Networks for Enhanced Mobility
David tries not to use unfamiliar trains and buses, he doesn’t travel to places he doesn’t know, and he doesn’t travel in unusual environments without a companion. David is v...
Simon Harper, Stephen Pettitt, Carole A. Goble
EOR
2006
90views more  EOR 2006»
13 years 8 months ago
A parallelizable dynamic fleet management model with random travel times
In this paper, we present a stochastic model for the dynamic fleet management problem with random travel times. Our approach decomposes the problem into time-staged subproblems by...
Huseyin Topaloglu
MFCS
2001
Springer
14 years 12 days ago
News from the Online Traveling Repairman
In the traveling repairman problem (Trp), a tour must be found through every one of a set of points (cities) in some metric space such that the weighted sum of completion times of ...
Sven Oliver Krumke, Willem de Paepe, Diana Poensge...
EOR
2008
133views more  EOR 2008»
13 years 8 months ago
Vehicle routing with dynamic travel times: A queueing approach
Transportation is an important component of supply chain competitiveness since it plays a major role in the inbound, inter-facility, and outbound logistics. In this context, assig...
Tom Van Woensel, Laoucine Kerbache, Herbert Perema...
GIS
2009
ACM
14 years 17 days ago
Machine learning approach to report prioritization with an application to travel time dissemination
This paper looks at the problem of data prioritization, commonly found in mobile ad-hoc networks. The proposed general solution uses a machine learning approach in order to learn ...
Piotr Szczurek, Bo Xu, Jie Lin, Ouri Wolfson