2005
DOI: 10.1016/j.tre.2004.03.003
|View full text |Cite
|
Sign up to set email alerts
|

Container movement by trucks in metropolitan networks: modeling and optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
59
0
1

Year Published

2012
2012
2023
2023

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 114 publications
(61 citation statements)
references
References 20 publications
1
59
0
1
Order By: Relevance
“…This may be contrasted with previous methodological approaches to problems of a similar structure in freight transport, which are limited by the fact that they aim to incorporate conflicting objectives of the actors into a single level optimization problem, either by constraints (e.g. Hu et al, 2002;Nozick, 2001;Jula et al, 2005), weighted optimization (e.g. Korpela et al, 2001), or a (single-level) multiobjective optimization (Tzeng et al, 2007).…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…This may be contrasted with previous methodological approaches to problems of a similar structure in freight transport, which are limited by the fact that they aim to incorporate conflicting objectives of the actors into a single level optimization problem, either by constraints (e.g. Hu et al, 2002;Nozick, 2001;Jula et al, 2005), weighted optimization (e.g. Korpela et al, 2001), or a (single-level) multiobjective optimization (Tzeng et al, 2007).…”
Section: Discussionmentioning
confidence: 99%
“…Likewise, Jula et al (2005) considered optimal routing of container lorries including so-called 'social constraints', which are enforced by the carriers to ensure that drivers do not work beyond a certain amount of hours per shift. Chang et al (2007) proposed a stochastic programming problem with capacity constraints for emergency logistics planning.…”
Section: Problem Formulationmentioning
confidence: 99%
“…Mes et al (2007; propose an agent-based approach for a dynamic version of the FT-PDPTW. Jula et al (2005) and Wang and Regan (2002) show that a FT-PDPTW may be transformed to an asymmetric multiple vehicle Travelling Salesman Problem with Time Windows (am-TSPTW) by collapsing each transport request into a single node. Wang and Regan (2002) use a time window partitioning method to solve the problem.…”
Section: Full Truckload Routingmentioning
confidence: 99%
“…First, in most of the related studies containers are supposed to be left at customer locations, and drivers can move to other customers, thereby bypassing packing and unpacking operations (Wang et al 2002;Jula et al 2005;Chung et al 2007;Zhang et al 2010Zhang et al , 2011Vidovic et al 2011;Braekers et al 2013;Nossack and Pesch 2013). Conversely, in this case study trucks move loaded containers to import customers and drivers wait for the empty containers, while unpacking operations are performed.…”
Section: Introductionmentioning
confidence: 99%
“…Second, in this case study routes are performed by two types of trucks carrying one or two containers, respectively, whereas most of the related literature concerns one container per truck (Wang et al 2002;Jula et al 2005;Zhang et al 2011Zhang et al , 2010Braekers et al 2013;Nossack and Pesch 2013). The case more than one container has been dealt with only recently (Vidovic et al 2017;Funke and Kopfer 2016).…”
Section: Introductionmentioning
confidence: 99%