Simulation Optimization of the Crossdock Door Assignment Problem
Uwe Aickelin, Adrian Adewunmi

TL;DR
This paper introduces a simulation optimization approach for the Crossdock Door Assignment Problem, combining simulation-based objective function derivation with Memetic algorithms to improve door assignment efficiency.
Contribution
It presents a novel application of simulation and Memetic algorithms to optimize door assignments in Crossdock centers, a new domain for these methods.
Findings
First application of Memetic algorithms to this problem domain
Simulation-based objective function enhances realism
Potential for improved door assignment efficiency
Abstract
The purpose of this report is to present the Crossdock Door Assignment Problem, which involves assigning destinations to outbound dock doors of Crossdock centres such that travel distance by material handling equipment is minimized. We propose a two fold solution; simulation and optimization of the simulation model simulation optimization. The novel aspect of our solution approach is that we intend to use simulation to derive a more realistic objective function and use Memetic algorithms to find an optimal solution. The main advantage of using Memetic algorithms is that it combines a local search with Genetic Algorithms. The Crossdock Door Assignment Problem is a new domain application to Memetic Algorithms and it is yet unknown how it will perform.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Manufacturing and Logistics Optimization · Optimization and Packing Problems · Assembly Line Balancing Optimization
