检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]东南大学交通学院,江苏南京210096 [2]广西科技大学汽车与交通学院,广西柳州545006
出 处:《公路交通科技》2015年第10期134-140,共7页Journal of Highway and Transportation Research and Development
基 金:国家自然科学基金项目(50575043)
摘 要:针对当前快递配送过程中由于时间和地点对接要求而导致投递效率不够高的问题,提出了基于自动快递机的快递配送新模式,根据新模式的特点,考虑配送车辆的装载能力、车辆经过客户需求点及其所属的快递机的行驶次序要求等约束条件,以执行配送任务的车辆数最少和配送车辆总的行驶里程最小为目标建立数学规划模型。根据问题的复杂程度和遗传算法求解该类问题的优势和不足,采用元胞遗传算法对模型进行求解。算例分析表明,该算法的寻优性能和效率优于普通遗传算法,能够更有效地解决大规模的基于自动快递机的快递车辆路径问题。Due to the synchronization requirements of time and place between the courier and customer, the current express delivery efficiency is not high enough. To solve this problem, a new express delivery mode based on automatic parcel machine (APM) is put forward. According to the characteristics of the new mode, considering the constraint conditions such as vehicle loading capacity, and the specific requirements for vehicle driving order from customer demand points to their subordinate APMs, the mathematical programming model for minimizing the number of delivery vehicles and the total vehicle mileage is established. According to the complexity of the problem and the advantages and disadvantages of genetic algorithm (GA) in solving this kind of problems, the model is solved by using cellular genetic algorithm (CGA). The example analysis result shows that the CGA is superior to the normal GA in the searching ability and efficiency, it can effectively solve the large-scale express vehicle delivery routing problem based on automatic parcel machine.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15