2017
DOI: 10.1007/s00291-017-0503-1
|View full text |Cite
|
Sign up to set email alerts
|

A multi-objective approach for intermodal train load planning

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 8 publications
(7 citation statements)
references
References 34 publications
0
7
0
Order By: Relevance
“…For own long-haul services, constraints (4) and (5) impose a maximum length and weight respectively. It is assumed that a feasible assignment of containers to the specific locations on wagons can be found using a detailed train load planning algorithm as for example proposed in Heggen et al [13]. Furthermore, each container r can only be assigned to a specific rail service if its release time a r at the customer increased with the time needed to arrive at the considered terminal allows the container to arrive before the service departure (6).…”
Section: Elsementioning
confidence: 99%
See 2 more Smart Citations
“…For own long-haul services, constraints (4) and (5) impose a maximum length and weight respectively. It is assumed that a feasible assignment of containers to the specific locations on wagons can be found using a detailed train load planning algorithm as for example proposed in Heggen et al [13]. Furthermore, each container r can only be assigned to a specific rail service if its release time a r at the customer increased with the time needed to arrive at the considered terminal allows the container to arrive before the service departure (6).…”
Section: Elsementioning
confidence: 99%
“…Algorithm 1 provides the general heuristic structure. It includes a constructive heuristic (lines 2-4) as well as a framework with several removal operators (lines 9-12) and insertion operators (lines [13][14][15].…”
Section: General Structure Of the Lnsmentioning
confidence: 99%
See 1 more Smart Citation
“…In Tricoire (2012), MDLS has been applied to several multi-objective problems such as the multi-objective multi-dimensional knapsack problem, the bi-objective set packing problem and the bi-objective orienteering problem. It has been later applied to intermodal train loading planning (Heggen et al, 2018) and several variants of the travelling salesman problem 60 (Defryn and Sörensen, 2018) and vehicle routing problems (Kovacs et al, 2015;Molenbruch et al, 2017;Lehuédé et al, 2019). A variant of the original MDLS, called Improved Multi-Directional Local Search (IMDLS) was proposed by Lian et al (2016).…”
Section: Meta-heuristic Reference Papersmentioning
confidence: 99%
“…From the eleven paper submitted to this special issue, the following three papers have been selected: Heggen et al (2018) consider train load planning problems in intermodal terminals and develop a multi-objective model including several practical constraints. The problem is solved exactly by an -constraint method and heuristically by a multi-directional local search procedure.…”
mentioning
confidence: 99%