【Key words】 Container Loading Problem; Multi-drop Constraint; Construction Heuristic; Greedy Arithmetic; Tree Search;
基于1个网页-相关网页
Faced with the multi-drop constraint in practice, this thesis uses the construction heuristic arithmetic, greedy solutions and tree search framework to increase the volume of the packed boxes and improve the efficiency of delivery.
针对目前在实际操作中存在多配送点限制,本文采用构造启发式算法、贪心算法以及搜索树算法相结合,以提高集装箱装载货物的空间利用率的问题,提高货物装载的优化程度、提高配送业务的工作效率。
参考来源 - 基于多配送点限制集装箱装载问题研究及应用·2,447,543篇论文数据,部分数据来源于NoteExpress
应用推荐