Optimization of control parameters for genetic algorithms
IEEE Transactions on Systems, Man and Cybernetics
The break-bulk role of terminals in many-to-many logistic networks
Operations Research
The shifting bottleneck procedure for job shop scheduling
Management Science
Genetic algorithms: foundations and applications
Annals of Operations Research
An optimal solution to a dock door assignment problem
Proceedings of the 14th annual conference on Computers and industrial engineering
Using a simulation model to evaluate the configuration of a sortation facility
Proceedings of the 29th conference on Winter simulation
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Reducing Labor Costs in an LTL Crossdocking Terminal
Operations Research
An analysis of the behavior of a class of genetic adaptive systems.
An analysis of the behavior of a class of genetic adaptive systems.
An evolutionary lagrangian method for the 0/1 multiple knapsack problem
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
The parcel hub scheduling problem: a simulation-based solution approach
Computers and Industrial Engineering
The quadratic multiple knapsack problem and three heuristic approaches to it
Proceedings of the 8th annual conference on Genetic and evolutionary computation
A dock-door assignment problem for the Korean mail distribution center
Computers and Industrial Engineering - Special issue: Logistics and supply chain management
Computers and Industrial Engineering
Iterative improvement to solve the parcel hub scheduling problem
Computers and Industrial Engineering
Robust door assignment in less-than-truckload terminals
Computers and Industrial Engineering
A tabu search approach to the truck scheduling problem with multiple docks and time windows
Computers and Industrial Engineering
Hi-index | 0.00 |
The parcel hub scheduling problem (PHSP) is scheduling problem that is common in the parcel delivery industry. The PHSP consists of scheduling a set of inbound trailers containing a batch of heterogeneous parcels to a set of unload docks with the objective of minimizing the time span of the transfer operation. The transfer operation involves unloading the inbound trailers and sorting and loading the parcels onto outbound trailers. The unload schedule can have a significant impact on the amount of time required to complete the transfer operation. In this paper, a mathematical model is proposed to solve small-size problems and a genetic algorithm is presented to solve the large-size problems with minimum computational time compared to other competing approaches.