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
并且给出了该算法和第二章给出的构造启发式算法的性能比较。
Comparable performance of this hybrid algorithm and the construction heuristic algorithm which is described in chapter 2 is presented.
该问题属于一个NP -完全问题，因此设计了构造启发式算法对模型近似求解。
Because the problem was a NP-complete problem, a construction heuristic algorithm was designed to solve the model.
详细研究了启发式搜索算法的产生、构造方法、基本类型等几个方面。
The study includes the generation, construction methods and basic types of heuristics search algorithms.
应用推荐