客户订单合成配送问题的建模与启发式算法  

Modelling and Heuristics Algorithm of Customer Order Consolidation Delivery Problem

作　　者：代红艳[1] 恩莉[1] 李彦平[1] 

机构地区：[1]沈阳大学信息科学与工程学院,辽宁沈阳110044

出　　处：《控制工程》2004年第3期267-270,共4页Control Engineering of China

基　　金：国家自然科学基金资助项目(60274027)

摘　　要：在一些模型假设的基础上,建立了客户订单合成配送问题的数学模型;然后提出了求解该问题的以最小化运输费用为目标函数的两阶段启发式算法;最后给出一个用此算法求解该问题的实例。实验结果表明,该算法对于2×30×2规模能够在较短时间内有效地求得问题的近优解,算法的运行时间取决于源批发商数、订单数和交货组数。此算法为实现客户订单合成配送问题的自动化提供了一个基本方法。A mathematical model of customer order consolidation delivery problem under some model assumption is developed. A two-stage heuristics algorithm is proposed to solve this problem with the minimum objective function of transformation cost.An example is given to illustrate the algorithm. For 2×30×2 scale,many experimental results indicate this algorithm can obtain nearly optimization solution to customer order consolidation delivery problem effectively within shorter time. The algorithm running time is decided by wholesalers number,order number and delivery groups. the algorithm provides basic method for realizing The automation of customer order consolidation delivery.

关 键 词：客户订单合成配送问题 启发式算法 运输费用 数学模型 物流配送系统 

分 类 号：F252[经济管理—国民经济]