摘要
提出一种基于改进蚁群算法的客户服务调度方法。改进蚁群算法综合考虑了服务处理的顺序、服务时间及服务台负载等因素,快速地完成客户服务需求的调度。该算法是一种群体寻优方法,能较快地搜索到全局最优解。仿真实验结果表明,该方法是正确的、可行的和有效的。
This paper proposes an improved ant colony algorithm for solving customer service scheduling. This proposed approach takes into account the operation sequence of service, service operation time and service station's load for solving customer service scheduling quickly. This approach adopts a population of points at a time, and finds the global optimum quickly. This proposed approach is an effective optimal algorithm with strong adaptability. Simulation experiment results suggest that this proposed approach is feasible, correct and valid.
出处
《微电子学与计算机》
CSCD
北大核心
2007年第7期153-155,159,共4页
Microelectronics & Computer
关键词
客户服务
改进蚁群算法
调度方法
customer service
improved ant colony algorithm
scheduling approach