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

Differential evolution and Population-based simulated annealing for truck scheduling problem in multiple door cross-docking systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
21
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 52 publications
(21 citation statements)
references
References 56 publications
0
21
0
Order By: Relevance
“…Constraints (8)- (9) guarantee the inbound truck or outbound truck occurs only once. Constraint (10) confirms the relationship between and ; similarly, the relationship between and is ensured by constraint (11). Constraint (12) ensures that the start time of the next inbound truck is equal to the finished time of the former inbound truck plus the delay time of truck change.…”
Section: The Mathematicalmentioning
confidence: 61%
See 1 more Smart Citation
“…Constraints (8)- (9) guarantee the inbound truck or outbound truck occurs only once. Constraint (10) confirms the relationship between and ; similarly, the relationship between and is ensured by constraint (11). Constraint (12) ensures that the start time of the next inbound truck is equal to the finished time of the former inbound truck plus the delay time of truck change.…”
Section: The Mathematicalmentioning
confidence: 61%
“…Assadi and Bagheri [9] considered a cross-docking terminal with multiple doors and temporary storage, assuming the ready time of inbound trucks were uncertain. Assadi and Bagheri [10] proposed two algorithms, namely, differential evolution and population-based simulated annealing to solve the multiple-door cross-docking system.…”
Section: Introductionmentioning
confidence: 99%
“…Assadi and Bagheri [25] used the just-in-time (JIT) approach to address the truck scheduling problem at a CDT. The authors specifically considered the ready times for ITs and OTs, different transshipment times between receiving and shipping doors, and the interchangeability of products.…”
Section: General Cdt Truck Schedulingmentioning
confidence: 99%
“…They proposed a branch-and-cut method for solving the mentioned problem in an acceptable time. Just-in-time (JIT) philosophy was utilized in truck scheduling problem to deliver the customers' demands on-time by Assadi and Bagheri [3], who considered ready time for trucks and transshipment time between receiving and shipping doors. A mixed integer programming (MIP) model was presented to minimize total earliness and tardiness of outbound trucks.…”
Section: Literature Reviewmentioning
confidence: 99%