In the container pre-marshalling problem (CPMP) n items are given that belong to G different item groups (g=1,…,G) and that are piled up in up to S stacks with a maximum stack height H. A move can shift one item from one stack to another one. A sequence of moves of minimum length has to be...

In this paper we survey the main studies dealing with the train timetabling problem in its nominal and robust versions. Roughly speaking, the nominal version of the problem amounts of determining “good” timetables for a set of trains (on a railway network or on a single one-way line),...

This paper illustrates a new approach to model and forecast the transport energy demand of Jordan based on Adaptive Neuro-Fuzzy Inference System (ANFIS) and the double exponential smoothing techniques. The ANFIS model has been developed using socio-economic and transport related indicators based...