Iterative improvement to solve the parcel hub scheduling problem

McWilliams, Douglas L.

doi:10.1016/j.cie.2010.03.010

Cited by 32 publications

(14 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To reduce the demand for simulation evaluations, McWilliams (2009) proposed a 0-1 minimax programming model resembling a multi-kanpsack problem, and used a genetic algorithm to solve the large scale PHSP. In the third work, McWilliams (2010) proposed local search and simulated annealing algorithms and showed that both algorithms outperform GA. The operational policy employed in the current paper requires that outbound trucks must stay in shipping dock until they finish their task once they come into shipping dock, but the inbound trucks are allowed to enter and leave the dock, repeatedly to unload their products.…”

Section: Introductionmentioning

confidence: 99%

A novel dynamic genetic algorithm-based method for vehicle scheduling in cross docking systems with frequent unloading operation

Mohtashami

2015

Computers & Industrial Engineering

View full text Add to dashboard Cite

Section: Introductionmentioning

confidence: 99%

A novel dynamic genetic algorithm-based method for vehicle scheduling in cross docking systems with frequent unloading operation

Mohtashami

2015

Computers & Industrial Engineering

View full text Add to dashboard Cite

“…This research aimed to process the trucks close to their due date and minimize the total deviation. McWilliams and his co-authors presented several studies related to truck-to-door sequencing (McWilliams, 2005(McWilliams, , 2010D. L. McWilliams, 2009;McWilliams.…”

Section: Introductionmentioning

confidence: 99%

Truck-to-door sequencing in multi-door cross-docking system with dock repeat truck holding patter

Ardakani¹,

Fei²,

Beldar³

2020

10.5267/j.ijiec

View full text Add to dashboard Cite

Cross-docking is a logistics strategy that consolidates the products of different inbound trucks according to their destinations in order to reduce the inventory, order picking, and transportation costs. It requires a high level of collaboration between inbound trucks, internal operations, and outbound trucks. This article addresses the truck-to-door sequencing problem. Truck-to-door sequencing has been studied by some researchers in different titles such as scheduling and sequencing of inbound and outbound trucks of the cross-dock center. However, previous studies have not considered repeat truck holding pattern. Therefore, it is important to determine the doors and the sequence of the inbound and outbound trucks that should be assigned in a cross-dock center. This paper focuses on optimizing truck-to-door sequencing with consideration of repeat truck holding pattern in inbound trucks in order to minimize makespan. Two methods are considered to solve this problem, including mathematical modeling and a heuristic algorithm. In the first method, a mixed integer-programming model is developed to minimize the makespan. Then, GAMS software is used to solve small-scale problems. In the second approach, a heuristic algorithm is developed to find near-optimal solutions within the shortest time possible and the algorithm is used to solve large-scale problems. The results of the mathematical model and the heuristic algorithm are slightly different and show the good quality of the presented heuristic algorithm.

show abstract

“…Assignment constraints: these sets of constraints are similar to the ones proposed by McWilliams (2010), except for the addition of the index for the infeeds. The combination of the following two sets of constraints ensures that each container segment is assigned exactly once and that a container is emptied in successive time buckets.…”

mentioning

confidence: 97%

“…He finds that the DLBA performs much better than random assignments (makespan reduction of 15%). Furthermore, the DLBA is generally better (makespan reduction of 8%) in large complex problems than the approach of McWilliams (2010).…”

Section: Parcel and Postal Sortingmentioning

confidence: 99%

“…A drawback of this approach is that due to the minimax problem, there may exist many optimal solutions in a large non-convex solution space. In further research, McWilliams (2010) shows that iterative approaches, such as simulated annealing, provide solutions that are on average 6% better than the solutions provided by the genetic algorithm, although large problems require more time to solve.…”

Section: Parcel and Postal Sortingmentioning

confidence: 99%

See 1 more Smart Citation

Generic control of material handling systems

Haneyah¹

View full text Add to dashboard Cite

Iterative improvement to solve the parcel hub scheduling problem

Cited by 32 publications

References 18 publications

A novel dynamic genetic algorithm-based method for vehicle scheduling in cross docking systems with frequent unloading operation

A novel dynamic genetic algorithm-based method for vehicle scheduling in cross docking systems with frequent unloading operation

Truck-to-door sequencing in multi-door cross-docking system with dock repeat truck holding patter

Generic control of material handling systems

Contact Info

Product

Resources

About