2021
DOI: 10.1016/j.cie.2021.107299
|View full text |Cite
|
Sign up to set email alerts
|

A routing and scheduling problem for cross-docking networks with perishable products, heterogeneous vehicles and split delivery

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
5
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 31 publications
(9 citation statements)
references
References 78 publications
0
5
0
Order By: Relevance
“…Multiobjective methods for vehicle routing and scheduling problems within supply chain problems have been studied recently by Rahbari et al ( 2019 ), Goodarzi et al ( 2020 ), and Shahabi-Shahmiri et al ( 2021 ). A bi-objective MILP model for the vehicle routing and scheduling problem with cross-docking for perishable products has been studied by Rahbari et al ( 2019 ).…”
Section: Literature Reviewmentioning
confidence: 99%
“…Multiobjective methods for vehicle routing and scheduling problems within supply chain problems have been studied recently by Rahbari et al ( 2019 ), Goodarzi et al ( 2020 ), and Shahabi-Shahmiri et al ( 2021 ). A bi-objective MILP model for the vehicle routing and scheduling problem with cross-docking for perishable products has been studied by Rahbari et al ( 2019 ).…”
Section: Literature Reviewmentioning
confidence: 99%
“…The transportation problem for agricultural products has been widely studied by many researchers [20][21][22][23][24][25][26][27][28]. Agricultural products are typically perishable.…”
Section: Literature Reviewmentioning
confidence: 99%
“…However, heterogeneous vehicles and numerous route combinations make manual scheduling difficult. In order to solve this problem, Shahabi-Shahmiri et al (2021) propose a new multi-objective mixed-integer programming model to minimize the transportation cost. In Zlot and Stentz's (2005) research, the scheduling problem of coupled tasks that need two types of robots' cooperation is simplified by a task tree based decomposition algorithm.…”
Section: Introductionmentioning
confidence: 99%