Show Less

Operational Planning Problems in Intermodal Freight Transportation

Series:

Jenny Nossak

This book addresses logistics problems (e.g., routing and partitioning problems) that are encountered in intermodal freight transportation. The reader is given an overview of the relevant literature, as well as of different mathematical formulations. Moreover, algorithmic solution approaches are suggested which are specially designed for problems that arise in the context of intermodal freight transportation, but can be applied to other areas as well.

Prices

Show Summary Details
Restricted access

Chapter 5 Conclusions and Future Research

Extract

In the context of intermodal transportation, various optimization problems arise. This dissertation makes several contributions to operational planning problems that are, e.g., encountered in the pre- and end-haulage and at transshipment yards of intermodal freight transportation. For each problem class, we propose different model formulations and de- velop solution approaches that capture the basic aspects of the problem. The quality of our solution methods is assessed on several computational studies. A truck scheduling problem that arises in the pre- and end-haulage of intermodal freight transportation is considered in Chapter 2. This problem addresses the routing and scheduling of container movements between cus- tomers and terminals and the repositioning of empty containers. We model this truck scheduling problem as full-truckload pickup-and-delivery problem and develop a two-stage heuristic solution approach. The performance of our method is analyzed and compared to a window-partitioning approach known from the literature. The results of the computational study indicate that the 2-stage heuristic outperforms the window-partitioning method in terms of the solution quality and the computational time. Future research could access the design of exact solution algorithms for small and medium-scaled instances. The nature of the problem points to decomposition approaches that partition the entire problem into a reduced truck scheduling problem and into a problem that solely handles the empty container repositioning. 124 Chapter 5. Conclusions and Future Research In Chapter 3 we address a generalization of the traveling salesman prob- lem, namely the one-commodity full-truckload pickup-and-delivery problem. This problem class may either be modeled...

You are not authenticated to view the full text of this chapter or article.

This site requires a subscription or purchase to access the full text of books or journals.

Do you have any questions? Contact us.

Or login to access all content.