Anticipatory freight selection in intermodal long-haul round-trips
| Autor: | Martijn R.K. Mes, Arturo Eduardo Perez Rivera |
|---|---|
| Přispěvatelé: | Industrial Engineering & Business Information Systems |
| Jazyk: | angličtina |
| Rok vydání: | 2017 |
| Předmět: |
050210 logistics & transportation
Engineering 021103 operations research business.industry Approximate dynamic programming 05 social sciences Synchromodal planning 0211 other engineering and technologies Probabilistic logic Transportation ComputerApplications_COMPUTERSINOTHERSYSTEMS 02 engineering and technology Service provider Intermodal transport Transport engineering Dynamic programming Anticipatory shipping Planning method 0502 economics and business TRIPS architecture Business and International Management business Selection (genetic algorithm) Long-haul consolidation Civil and Structural Engineering |
| Zdroj: | Transportation research. Part E: Logistics and transportation review, 105, 176-194. Elsevier |
| ISSN: | 1366-5545 |
| Popis: | We consider the planning problem faced by Logistic Service Providers (LSPs) transporting freights periodically, using long-haul round-trips. In each round-trip, freights are delivered and picked up at different locations within one region. Freights have time-windows and become known gradually over time. Using probabilistic knowledge about future freights, the LSP’s objective is to minimize costs over a multi-period horizon. We propose a look-ahead planning method using Approximate Dynamic Programming. Experiments show that our approach reduces costs up to 25.5% compared to a single-period optimization approach. We provide managerial insights for several intermodal long-haul round-trips settings and provide directions for further research. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect