Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/24845
Title: | An efficient heuristic for multi-objective train load planning: a parameter sensitivity analysis | Authors: | HEGGEN, Hilde BRAEKERS, Kris CARIS, An |
Issue Date: | 2017 | Source: | Bottani, Eleonora; Bruzzone, Agostino G.; Longo, Francesco; Merkuryev, Yury; Piera, Miquel Angel (Ed.). Proceedings of the International Conference on Harbor Maritime and Multimodal Logistics Modelling and Simulation, 2017,p. 1-10 (Art N° 1) | Abstract: | Intermodal transportation is evolving towards a synchromodal system with real-time switching, in which most assignment decisions are postponed until the final planning phase. In such environment, it is important to assist train planners by providing decision support in the operational environment in which they operate. One important task for train planners concerns train load planning, which is concerned with the assignment of load units to the available slots on a train. In this paper, a sensitivity analysis of the parameters of a multi-objective heuristic algorithm for train load planning is presented, which accounts for different aspects of train capacity utilization. The tuned heuristic algorithm provides a number of load plans from which planners can choose the most relevant plan for the specific circumstances they are operating in at that moment. | Keywords: | train load planning; intermodal transportation; multi-directional local search | Document URI: | http://hdl.handle.net/1942/24845 | ISBN: | 9788897999874 | Category: | C1 | Type: | Proceedings Paper | Validations: | vabb 2020 |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
HMS2017 Final paper HeggenBraekersCaris.pdf Restricted Access | Published version | 1.49 MB | Adobe PDF | View/Open Request a copy |
Page view(s)
54
checked on Sep 6, 2022
Download(s)
4
checked on Sep 6, 2022
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.