交叉坞门分配问题的仿真优化
Simulation Optimization of the Crossdock Door Assignment Problem
摘要：
本报告的目的是提出交叉坞门分配问题，它涉及到分配目的地到交叉坞中心的出站坞门，使材料处理设备的行程距离最小化。我们提出了一个双重的解决方案：仿真和优化的仿真模型仿真优化。我们的解决方案的新颖之处在于，我们打算使用模拟来获得一个更现实的目标函数，并使用Memetic算法来找到一个最佳的解决方案。使用Memetic算法的主要优点是它将局部搜索与遗传算法相结合。Crossdock Door Assignment Problem是Memetic算法的一个新的应用领域，目前还不清楚它将如何执行。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
