Sciweavers

303 search results - page 43 / 61
» Traveling Salesman Problem with Transportation
Sort
View
TRANSCI
2008
122views more  TRANSCI 2008»
15 years 1 months ago
Scheduling Locomotives and Car Transfers in Freight Transport
Abstract. We present a new model for a strategic locomotive scheduling problem arising at the Deutsche Bahn AG. The model is based on a multi-commodity min-cost flow formulation th...
Armin Fügenschuh, Henning Homfeld, Andreas Hu...
DCOSS
2011
Springer
14 years 1 months ago
STARS: Static relays for multi-robot real-time search and monitoring
Abstract—We first present a problem called precedence constrained two traveling salesman (PC2TSP). We propose a nearoptimal heuristic to PC2TSP to generate tours by clustering p...
Yuanteng Pei, Matt W. Mutka
SODA
2010
ACM
397views Algorithms» more  SODA 2010»
15 years 11 months ago
Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
Aaron Archer, Anna Blasiak
AVI
2006
15 years 3 months ago
Mobility agents: guiding and tracking public transportation users
Increasingly, public transportation systems are equipped with Global Positioning Systems (GPS) connected to control centers through wireless networks. Controllers use this infrast...
Alexander Repenning, Andri Ioannidou
WEA
2009
Springer
103views Algorithms» more  WEA 2009»
15 years 8 months ago
Pareto Paths with SHARC
Abstract. Up to now, research on speed-up techniques for DIJKSTRA’s algorithm focused on single-criteria scenarios. The goal was to find the quickest route within a transportati...
Daniel Delling, Dorothea Wagner