摘要
优化物流配送路径是一个经典的NP问题,构造基于并购算法的物流配送路径优化的模型。经过多次模拟实验,可以快速获取物流配送路径优化问题的最优解或近似最优解。由此得出并购算法在求解物流配路径优化方面有较强的优越性。
Optimizing physical distribution routing is a classic NP problem; it constructs the model of optimizing physical distribution routing based on M & A algorithm. After making some experiments, it obtains quickly the optimal or nearly optimal solutions to the problem of optimizing physical distribution routing. Thus, M&A algorithm has its own superiority in solving the problem of optimizing physical distribution routing.
出处
《计算机与数字工程》
2009年第8期25-28,共4页
Computer & Digital Engineering
基金
浙江省科技计划项目(编号:2008C11106-2)资助
关键词
并购算法
物流配送
劣信度
路径优化
mergers&acquisitions algorithm, physical distribution, bad credit, optimizing routing