摘要: 在BtoC电子商务物流配送活动中,配送公司外包车辆和配送人员上班具有时间限制。为求解带工作时间与时间窗约束的开放式车辆路径问题(OVRPTWWT),构建其混合整数规划模型,给出一种求解该问题的非代际克隆选择算法,对算法中抗体的更新与抑制策略进行改进,设计出新的克隆选择方法。通过实验验证了该模型与OVRPTWWT非代际克隆选择算法的有效性。
关键词:
开放式车辆路径问题,
时间窗,
工作时间,
人工免疫,
克隆选择,
非代际
Abstract: In BtoC e-commerce logistics distribution activities, many distribution companies using outsourcing vehicles and the drivers have working time limit. On the basis of this, this paper proposes an Open Vehicle Routing Problem with Time Windows and Working Time (OVRPTWWT), and constructs its mixed integer planning model. A clonal selection algorithm for OVRPTWWT is proposed, it improves the antibodies updating procedure, restraining tactics and designs a new clonal selection method for the algorithm. An example verifies the efficiency of the model and algorithm.
Key words:
Open Vehicle Routing Problem(OVRP),
time windows,
working time,
artificial immune,
clonal selection,
non-generational
中图分类号:
潘立军, 符卓, 刘喜梅. 带工作时间与时间窗的开放式车辆路径问题[J]. 计算机工程, 2012, 38(04): 17-19.
BO Li-Jun, FU Zhuo, LIU Chi-Mei. Open Vehicle Routing Problem with Working Time and Time Windows[J]. Computer Engineering, 2012, 38(04): 17-19.