2016
DOI: 10.1016/j.trpro.2016.02.076
|View full text |Cite
|
Sign up to set email alerts
|

Urban Freight Transport: From Optimized Routes to Robust Routes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
5
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(5 citation statements)
references
References 8 publications
0
5
0
Order By: Relevance
“…In reference [16], two well-known strategies were implemented in delivery routes in urban areas-the first is the application of the capacitated VRP, and the second is the problem of loading plan optimization. This is based on the use of an approximation with a hybrid method of the two strategies and with the concept of robustness introduced into the route to guarantee a level of predefined service, according to vehicle performance.…”
Section: Literature Reviewmentioning
confidence: 99%
“…In reference [16], two well-known strategies were implemented in delivery routes in urban areas-the first is the application of the capacitated VRP, and the second is the problem of loading plan optimization. This is based on the use of an approximation with a hybrid method of the two strategies and with the concept of robustness introduced into the route to guarantee a level of predefined service, according to vehicle performance.…”
Section: Literature Reviewmentioning
confidence: 99%
“…In terms of model construction, Goodarzi and Zegordi [2] established a nonlinear mixed-integer programming (MIP) model to optimize the distribution network, consisting of parts suppliers, cross terminals, and assembly factories. Guedria et al [3] optimized the urban vehicle routing and vehicle loading planning. To minimize the total cost of the collaborative multiple centers VRP (CMCVRP), Wang et al [4] designed an integer programming model that considers the effective transport cost in distribution centers (DC) and that of vehicles from each DC, and solved the model with a self-designed multi-phase hybrid algorithm, which combines the merits of clustering, dynamic planning, and heuristic algorithms.…”
Section: Introductionmentioning
confidence: 99%
“…After that, many scholars at home and abroad have studied it. Mohamed et al [12] proposed a hybrid model for simultaneous optimization of vehicle routing and loading tasks from the overall process of urban distribution. Patrick et al [13] introduced a new concept of expected delivery interval to balance and quantify the difference of demand between enterprises and users in cost, benefit and distribution reliability.…”
Section: Introductionmentioning
confidence: 99%
“…Suppose N = 10, K = 3, the encoding dimension is (10 + 3 − 1) × 1 = 12 × 1, thus a possible encoding can be (0.12, 0.37, 0.22, 0.96, 0.56, 0.35, 0.76, 0.57, 0.38, 0.91, 0.71, 0.26). Using the random key decoding rule, it is easy to get the integer arrangement (1,5,2,12,7,4,10,8,6,11,9,3). The integers 11 and 12 are the so-called sub-path segmentation, and the vehicle routes are:…”
mentioning
confidence: 99%