作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2012, Vol. 38 ›› Issue (04): 17-19. doi: 10.3969/j.issn.1000-3428.2012.04.006

• 博士论文 • 上一篇    下一篇

带工作时间与时间窗的开放式车辆路径问题

潘立军 1,2,符 卓 1,刘喜梅 3   

  1. (1. 中南大学交通与运输工程学院,长沙 410075;2. 湖南工程学院经济管理学院,湖南 湘潭 411104; 3. 湖南理工职业技术学院科研处,湖南 湘潭 411104)
  • 收稿日期:2011-08-01 出版日期:2012-02-20 发布日期:2012-02-20
  • 作者简介:潘立军(1977-),男,讲师、博士研究生,主研方向:物流系统优化;符 卓,教授、博士生导师;刘喜梅,讲师、硕士
  • 基金资助:
    国家自然科学基金资助项目(70671108);湖南省教育厅基金资助项目(10C0558)

Open Vehicle Routing Problem with Working Time and Time Windows

PAN Li-jun 1,2, FU Zhuo 1, LIU Xi-mei 3   

  1. (1. School of Traffic and Transportation Engineering, Central South University, Changsha 410075, China; 2. School of Economics and Management, Hunan Institute of Engineering, Xiangtan 411104, China; 3. Scientific Research Office, Hunan Vocational Institute of Technology, Xiangtan 411104, China)
  • Received:2011-08-01 Online:2012-02-20 Published:2012-02-20

摘要: 在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

中图分类号: