摘要： 多技能需求的现场产品服务调度结合了多旅行商问题与多技能项目调度问题，需综合考虑路径优化与技能匹配。针对该问题，考虑时间窗因素，以最短旅途时间和最少客户等待时间为目标建立数学模型，基于分段染色体编码的遗传算法并采用成组分段交叉算子进行求解。实例结果证明，该算法的解能避免过早收敛，有较高的搜索效率。

关键词: 现场产品服务调度, 多技能需求, 服务技能匹配, 遗传算法, 时间窗, 染色体

Abstract: Multi-skill demand field product service scheduling problem is the combination of the multi-Travelling Salesman Problem(TSP) and the multi-skill project scheduling problem, it need consider routing optimization as well as service skills matching. A model of multi-skill demand field product service with time windows is built, in which the two objective dimensions are traveling time and client’s waiting time. A multi-part chromosome technique based genetic algorithm with corresponding segment crossover technique is proposed as a solution. A set of benchmark data are used to prove the effectiveness of the modified algorithm. The results prove that the modified algorithm can better avoid premature convergence and obtain a more optimal solution and the search efficiency is improved.

Key words: field product service scheduling, multi-skill demand, service skill matching, genetic algorithm, time window, chromosome

中图分类号: 

• TP391