Sciweavers

424 search results - page 52 / 85
» Scheduled Hot-Potato Routing
Sort
View
ISAAC
2001
Springer
112views Algorithms» more  ISAAC 2001»
15 years 4 months ago
On the Complexity of Train Assignment Problems
We consider a problem faced by train companies: How can trains be assigned to satisfy scheduled routes in a cost efficient way? Currently, many railway companies create solutions b...
Thomas Erlebach, Martin Gantenbein, Daniel Hü...
FLAIRS
2007
15 years 2 months ago
Temporal Networks with Alternatives: Complexity and Model
Temporal Networks play an important role in solving planning problems and they are also used, though not as frequently, when solving scheduling problems. In this paper we propose ...
Roman Barták, Ondrej Cepek
WSC
2008
15 years 2 months ago
Approximate dynamic programming: Lessons from the field
Approximate dynamic programming is emerging as a powerful tool for certain classes of multistage stochastic, dynamic problems that arise in operations research. It has been applie...
Warren B. Powell
JUCS
2008
153views more  JUCS 2008»
14 years 11 months ago
Bus Network Optimization with a Time-Dependent Hybrid Algorithm
: This paper describes a new hybrid technique that combines a Greedy Randomized Adaptive Search Procedure (GRASP) and a genetic algorithm with simulation features in order to solve...
Ana C. Olivera, Mariano Frutos, Jessica Andrea Car...
ORL
2002
92views more  ORL 2002»
14 years 11 months ago
Efficient feasibility testing for dial-a-ride problems
Dial-a-Ride systems involve dispatching a vehicle to satisfy demands from a set of customers who call a vehicle operating agency requesting that an item be picked up from a specif...
Brady Hunsaker, Martin W. P. Savelsbergh