On Transport Service Selection in Intermodal Rail/Road Distribution Networks

Intermodal rail/road freight transport constitutes an alternative to long-haul road transport for the distribution of large volumes of goods. The paper introduces the intermodal transportation problem for the tactical planning of mode and service selection. In rail mode, shippers either book train capacity on a per-unit basis or charter block trains completely. Road mode is used for short-distance haulage to intermodal terminals and for direct shipments to customers. We analyze the competition of road and intermodal transportation with regard to freight consolidation and service cost on a model basis. The approach is applied to a distribution system of an industrial company serving customers in eastern Europe. The case study investigates the impact of transport cost and consolidation on the optimal modal split.

Größenentwicklung von Containerschiffen und Auswirkung auf die intermodale Transportkette

Gegenstand des vorliegenden Beitrages ist eine Methode zur Kosten- und Leistungsbewertung von Containerschiffen als Transportmittel des Hauptlaufes in intermodalen Transportketten für ISO-Container. Anlass bildet die permanente Größenentwicklung der Containerschiffe und die daraufhin ausgerichtete Infrastruktur- und Transportkettenentwicklung im Vor- und Nachlauf, die nicht risikofrei zu beurteilen ist. Mit der vorgestellten Methode wird deutlich, dass die Erfolgs- bzw. Misserfolgsfaktoren der Großcontainerschiffe fast nur noch in den Häfen und deren Hinterlandanbindungen zu suchen sind.

GRASP with Hybrid Path Relinking for Bi-Objective Winner Determination in Combinatorial Transportation Auctions

The procurement of transportation services via large-scale combinatorial auctions involves a couple of complex decisions whose outcome highly influences the performance of the tender process. This paper examines the shipper's task of selecting a subset of the submitted bids which efficiently trades off total procurement cost against expected carrier performance. To solve this bi-objective winner determination problem, we propose a Pareto-based greedy randomized adaptive search procedure (GRASP). As a post-optimizer we use a path relinking procedure which is hybridized with branch-and-bound. Several variants of this algorithm are evaluated by means of artificial test instances which comply with important real-world characteristics. The two best variants prove superior to a previously published Pareto-based evolutionary algorithm.