Skip to main content
Article thumbnail
Location of Repository

Simulation Optimization of the Crossdock Door Assignmnet Problem

By Uwe Aickelin and Adrian Adewunmi

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

Year: 2006
OAI identifier: oai:eprints.nottingham.ac.uk:391
Provided by: Nottingham ePrints

Suggested articles

Citations

  1. (2004). [5] Mesut Korhan Acar
  2. (1999). A comparison of memetic algorithms, tabu search, and ant colonies for the quadratic assignment problem.
  3. (2000). A Genetic Algorithm Approach to Door Assignments in Break-bulk Terminals.
  4. (1990). A Microcomputer based Decision Support Tool for Assigning Dock Doors in Freight Yards. Computers ind. Engng Vol.19, Nos 1-4, doi
  5. Andrei Andradóttir Sigrún (2005). Two Simulated Annealing Algorithms For Noisy Objective Functions.
  6. (2001). Cross docking: Just In Time fo r Distribution.
  7. (2000). Reducing Labour Costs in an LTL Crossdocking Terminal. Operational Research; Nov/Dec doi
  8. UWE AICKELIN is a Senior Lecturer in Computer Science at the School of Computer Science and IT, University of Nottingham and a member of Automated Scheduling, Optimisation & Planning Research group (ASAP)

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.