2017
DOI: 10.1016/j.knosys.2017.05.006
|View full text |Cite
|
Sign up to set email alerts
|

Developing a lower bound and strong heuristics for a truck scheduling problem in a cross-docking center

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
31
0

Year Published

2019
2019
2021
2021

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 59 publications
(31 citation statements)
references
References 38 publications
0
31
0
Order By: Relevance
“…Golshahi-Roudbaneh et al [28] conducted a study on the truck scheduling problem at a CDT. The objective of the study was to determine the optimal truck sequence for both ITs and OTs, minimizing the makespan.…”
Section: General Cdt Truck Schedulingmentioning
confidence: 99%
See 1 more Smart Citation
“…Golshahi-Roudbaneh et al [28] conducted a study on the truck scheduling problem at a CDT. The objective of the study was to determine the optimal truck sequence for both ITs and OTs, minimizing the makespan.…”
Section: General Cdt Truck Schedulingmentioning
confidence: 99%
“…The computational experiments were conducted using 20 problem instances, previously developed by Yu [42]. In addition, 15 medium-and large-size problem instances, previously used by Golshahi-Roudbaneh et al [28], were considered as well. The results demonstrated that the proposed heuristics were able to find good-quality solutions within a reasonable computational time.…”
Section: General Cdt Truck Schedulingmentioning
confidence: 99%
“…To solve the developed model based on the encoding plan of [16], we have utilized not only the simulated annealing (SA) and differential evolution (DE) as the successful traditional metaheuristics from the literature, but also the Keshtel algorithm (KA) as a recent natureinspired algorithm is applied to solve the proposed problem. At the last but not the least, the main innovation for solving the proposed problem is to introduce a new hybrid metaheuristic formulated by KA and SA to better solve the proposed problem.…”
Section: Metaheuristicsmentioning
confidence: 99%
“…They used three multi-objective meta-heuristic algorithms to solve the problem. In 2017, Golshahi-Roudbaneh et al [16] proposed heuristics and metaheuristics to find the optimal for receiving and shipping trucks sequence, based on Yu [10]. In another similar research, Serrano et al [17] proposed a mixed integer linear programming model to schedule inbound trucks' arrival times (considering given soft time windows), shop-floor repackaging operations and outbound trucks' departure times.…”
Section: Introduction and Literature Reviewmentioning
confidence: 99%
See 1 more Smart Citation