Abstract

In this paper we deal with the operational planning of transportation operations in an intermodal network. The objective is to satisfy a given transportation demand by using road vehicles and trains, in order to minimize the total transportation cost and meeting a set of operational constraints. We propose a linear integer programming model and an Ant Colony Optimization metaheuristic approach in a pure and a hybrid version. We present and compare the results obtained testing all the approaches on a benchmark set made of randomly generated problem instances. The tests show the appreciable behavior of the IP model, that however requires a considerable amount of time, and the ability of the hybrid ACO to generate high quality solutions for all the benchmark instances with a quite reduced computational effort.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.