Sciweavers

2343 search results - page 289 / 469
» The Locomotive Routing Problem
Sort
View
ATMOS
2010
150views Optimization» more  ATMOS 2010»
15 years 5 months ago
Dynamic Graph Generation and Dynamic Rolling Horizon Techniques in Large Scale Train Timetabling
The aim of the train timetabling problem is to find a conflict free timetable for a set of passenger and freight trains along their routes in an infrastructure network. Several ...
Frank Fischer, Christoph Helmberg
IMCSIT
2010
15 years 4 months ago
ACO with semi-random start applied on MKP
Ant Colony Optimization (ACO) is a stochastic search method that mimics the social behavior of real ants colonies, which manage to establish the shortest route to feeding sources a...
Stefka Fidanova, Pencho Marinov, Krassimir T. Atan...
NETWORKS
2011
15 years 1 months ago
Line planning, path constrained network flow and inapproximability
Abstract. We consider a basic subproblem which arises in line planning, and is of particular importance in the context of a high system load or robustness: How much can be routed m...
Christina Büsing, Sebastian Stiller
NETWORK
2010
158views more  NETWORK 2010»
15 years 28 days ago
Broadcasting safety information in vehicular networks: issues and approaches
A primary goal of intelligent transportation systems is to improve road safety. The ability of vehicles to communicate is a promising way to alleviate traffic accidents by reducin...
R. Chen, Wen-Long Jin, A. Regan
SODA
2010
ACM
215views Algorithms» more  SODA 2010»
16 years 3 months ago
Approximability of Robust Network Design
We consider robust network design problems where the set of feasible demands may be given by an arbitrary polytope or convex body more generally. This model, introduced by BenAmeu...
Neil Olver, F. Bruce Shepherd