计算机工程与应用2017，Vol.53Issue(14)：232-239,8.DOI:10.3778/j.issn.1002-8331.1601-0408
带软时间窗的多车场开放式车辆调度
Study on multi-depot open vehicle routing problem with soft time windows
摘要
Abstract
Multi-depot open vehicle routing problem with soft time windows is a variation of the open vehicle routing problem constrained by time windows and multi-depot, which is a typical NP-hard problem. To solve this problem, an improved ant colony algorithm is proposed, and the corresponding mathematical model is established. By introducing a virtual depot, the multi-depot VRP is transformed into a single depot VRP. Then a new ant colony algorithm with parame-ter adaptation combined with 2-opt algorithm is proposed to solve the problem. At the early stage of the algorithm, a cluster-ing technology based on the bacterial foraging chemotaxis algorithm and K-means algorithm is used to judge the state of the ant colony, and the parameters are adjusted adaptively to make the algorithm converge to the neighborhood of the global optimal solution. At the late stage, the parameters are tuned based on the characteristics of chaos theory to jump out of local optima. Experimental results verify the effectiveness of the proposed algorithm for solving the MDOVRPSTW problem.关键词
开放式车辆路径问题/时间窗/蚁群算法/聚类技术/2-optKey words
open vehicle routing problem/time windows/ant colony algorithm/clustering technology/2-opt分类
信息技术与安全科学引用本文复制引用
凌海峰,谷俊辉..带软时间窗的多车场开放式车辆调度[J].计算机工程与应用,2017,53(14):232-239,8.基金项目
国家自然科学基金重大项目(No.71490725)" （No.71490725）
973"计划项目(No.2013CB329603) （No.2013CB329603）
国家自然科学基金面上项目(No.71371062) （No.71371062）
青年科学基金项目(No.71302064). （No.71302064）
