2017
DOI: 10.1016/j.trb.2017.07.007
|View full text |Cite
|
Sign up to set email alerts
|

A metaheuristic for the multimodal network flow problem with product quality preservation and empty repositioning

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 21 publications
(7 citation statements)
references
References 51 publications
(83 reference statements)
0
7
0
Order By: Relevance
“…In the research stream of network flow models, a variety of models have been presented for global shipping networks or intermodal transport networks, e.g., network optimization model within a decision support system [22], container flow-balancing models [23], stochastic programming models [24,25], time-space network flow models (e.g., [26][27][28]), scenario-based linear programming or mixed-integer programming models [29,30], mixed-integer linear programming model considering purchasing [31], stochastic linear programming model [32], flow-balancing models considering foldable containers [33,34], multicommodity capacitated network flow problem considering perishable products [35], and multi-commodity network flow problem considering combinable containers [36]. In general, network flow models often produce a matrix of empty container flows between nodes (in static situations), or a time-stamped matrix of empty container flows between nodes (in time-dependent situations).…”
Section: Container Logisticsmentioning
confidence: 99%
“…In the research stream of network flow models, a variety of models have been presented for global shipping networks or intermodal transport networks, e.g., network optimization model within a decision support system [22], container flow-balancing models [23], stochastic programming models [24,25], time-space network flow models (e.g., [26][27][28]), scenario-based linear programming or mixed-integer programming models [29,30], mixed-integer linear programming model considering purchasing [31], stochastic linear programming model [32], flow-balancing models considering foldable containers [33,34], multicommodity capacitated network flow problem considering perishable products [35], and multi-commodity network flow problem considering combinable containers [36]. In general, network flow models often produce a matrix of empty container flows between nodes (in static situations), or a time-stamped matrix of empty container flows between nodes (in time-dependent situations).…”
Section: Container Logisticsmentioning
confidence: 99%
“…Since many new constraints about collision avoidance are added, the problem in the paper is more complex and harder to solve. SteadieSeifi [ 34 ] studied the complexity of this kind of problem and stated that even in small instances, the number of decision variables and constraints was huge, and these numbers would grow rapidly as the scale of the instance increases. The research showed that this kind of problem was difficult to obtain the optimality with current Mixed Integer Programming (MIP) solver, and it mattered to propose an algorithm that could get a better solution in a shorter time.…”
Section: Algorithmmentioning
confidence: 99%
“…The vehicle fleet is often considered homogeneous; only two papers discuss a heterogeneous fleet (Dotoli and Epicoco, 2016;Pérez Rivera and Mes, 2017). Multiple vehicle depots can be included (Zhang et al, 2009(Zhang et al, , 2010Nossack and Pesch, 2013;Sterzik and Kopfer, 2013;Reinhardt et al, 2016;Shiri and Huynh, 2016). Moreover, to cope with imbalances between demand and supply of containers at different loca- tions, the allocation of empty containers can be modelled (Francis et al, 2007;Zhang et al, 2009Zhang et al, , 2010Braekers et al, 2013;Nossack and Pesch, 2013;Sterzik and Kopfer, 2013;Reinhardt et al, 2016;Shiri and Huynh, 2016;Pérez Rivera and Mes, 2017).…”
Section: Pre-and End-haulage Transportmentioning
confidence: 99%
“…Although a number of papers include multiple terminals (Francis et al, 2007;Zhang et al, 2010;Sterzik and Kopfer, 2013;Nossack and Pesch, 2013;Braekers et al, 2013;Shiri and Huynh, 2016;Pérez Rivera and Mes, 2017), it is generally assumed that the pickup location (i.e., arrival terminal) of inbound full containers and delivery location (i.e., departure terminal) of outbound full containers are known and fixed. This implies that long-haul routing decisions are assumed to be given.…”
Section: Pre-and End-haulage Transportmentioning
confidence: 99%