关键词: 快递车辆配装问题, 背包问题, 分支限界算法

Abstract:

Express vehicle assembling problem refers to the fact that vehicles bring the goods with the greatest value back to the distribution center when delivering goods at each express station. A branch and bound algorithm with bound function is proposed to solve the problem. The nodes to be processed in the search tree are stored in a heap structure， and the search paths are stored in the nodes. The lower bound of search is used to prune the search tree， and the experimental results verify the effectiveness of the algorithm.

Key words:

express vehicle assembling problem, knapsack problem, branch and bound algorithm