###
计算机系统应用英文版:2017,26(7):232-237
本文二维码信息
码上扫一扫!
基于聚类的城市共同配送海量订单调度问题研究
(1.西安理工大学 经济与管理学院, 西安 710054;2.西安理工大学 计算机科学与工程学院, 西安 710054)
Research on Massive Orders Scheduling Problem of Urban Joint Distribution Based on Clustering
(1.School of Economics and Management, Xi'an University of Technology, Xi'an 710054, China;2.School of Computer Science and Engineering, Xi'an University of Technology, Xi'an 710054, China)
摘要
图/表
参考文献
相似文献
本文已被:浏览 1327次   下载 2324
Received:October 28, 2016    Revised:November 30, 2016
中文摘要: 针对云物流环境下城市共同配送海量订单调度难的问题,本文提出基于订单聚类的调度算法.首先针对单中心多车辆调度问题,提出基于单亲遗传的优化调度算法;在此基础上综合考虑城市配送中心的地理位置、车辆及配送点的地理位置、货物的种类、需求量,提出采用蚁群算法构建基于配送中心的海量订单聚类、优化调度算法.
中文关键词: 共同配送  海量订单  聚类  蚁群算法  调度
Abstract:In order to solve the problem of massive orders scheduling in the cloud logistics environment, this paper proposes a scheduling algorithm based on orders clustering. Firstly, aiming at the single center multi vehicle scheduling problem, an optimal scheduling algorithm based on the single parent genetic algorithm is proposed. On this foundation, considering the location of the city distribution centers, the vehicles and the distribution points, the type and the demand of goods, an order clustering model based on distribution center is built by using the ant colony algorithm.
文章编号:     中图分类号:    文献标志码:
基金项目:陕西省教育厅人文社科重点研究基地科研计划项目(15JZ039)
引用文本:
谢天保,赵萌,雷西玲.基于聚类的城市共同配送海量订单调度问题研究.计算机系统应用,2017,26(7):232-237
XIE Tian-Bao,ZHAO Meng,LEI Xi-Ling.Research on Massive Orders Scheduling Problem of Urban Joint Distribution Based on Clustering.COMPUTER SYSTEMS APPLICATIONS,2017,26(7):232-237