82 search results - page 2 / 17 » Solving a Real-World Train Unit Assignment Problem |
ICCSA
2007
Springer
13 years 11 months ago
2007
Springer
This paper presents a Greedy-Least Saturation Degree (G-LSD) heuristic (which is an adaptation of the least saturation degree heuristic) to solve a real-world examination timetabli...
ISAAC
2001
Springer
13 years 9 months ago
2001
Springer
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...
TRANSCI
2008
13 years 4 months ago
2008
In this paper, we describe a new model for the Train Unit Shunting Problem. This model is capable of solving the matching and parking subproblems in an integrated manner, requirin...
ESANN
2004
13 years 6 months ago
2004
Abstract. Many real world problems are given in the form of multiple measurements comprising local descriptions or tasks. We propose that a dynamical organization of a population o...
ACL
2010
13 years 2 months ago
2010
We consider the search for a maximum likelihood assignment of hidden derivations and grammar weights for a probabilistic context-free grammar, the problem approximately solved by ...