2023
DOI: 10.1007/s12351-023-00751-3
|View full text |Cite
|
Sign up to set email alerts
|

Time-dependent vehicle routing problem of perishable product delivery considering the differences among paths on the congested road

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 35 publications
0
1
0
Order By: Relevance
“…Specifically, Huang et al [22] combine route flexibility with the time-dependent travel time by adopting a route path selection method. Zhao et al [23] propose a model to obtain the time-dependent travel time based on historical traffic indices. In the dynamic VRP model, many scholars have designed both exact algorithms such as benders decomposition [24] and column generation [25] and other heuristic algorithms such as the improved particle swarm optimization algorithm [26] and taboo search [27,28] to solve the problem.…”
Section: Introductionmentioning
confidence: 99%
“…Specifically, Huang et al [22] combine route flexibility with the time-dependent travel time by adopting a route path selection method. Zhao et al [23] propose a model to obtain the time-dependent travel time based on historical traffic indices. In the dynamic VRP model, many scholars have designed both exact algorithms such as benders decomposition [24] and column generation [25] and other heuristic algorithms such as the improved particle swarm optimization algorithm [26] and taboo search [27,28] to solve the problem.…”
Section: Introductionmentioning
confidence: 99%