Data For: Consultant Assignment and Routing Problem with Priority
收藏Mendeley Data2024-01-31 更新2024-06-26 收录
下载链接:
https://data.mendeley.com/datasets/p4h8w2hmwm
下载链接
链接失效反馈官方服务:
资源简介:
The CARPP problem aims to simultaneously assign consultants to clients and determine the traveling routes. The features of the problem are listed as follows. The consulting activities must be performed face-to-face at the client site. Therefore, consultants travel to almost all client assignments to fulfill their jobs. The objective is to minimize the incurred airfares and the consultants’ wages. Consultants are proficient in different skills and they can only fill demands requiring the relevant skill. The skills cannot be easily replicated or cross-trained. In addition, priority requirement has to be matched before assigning consultants to clients. To avoid dissatisfaction from consultants, the maximum number of flying trips should not exceed four for each consultant per week. The CARPP problem does not consider time window because the specific working time is determined by consultants and clients.
客户咨询人员分配与路径规划(CARPP)问题旨在同时为客户分配咨询人员并规划出行路径。该问题的特征如下:咨询活动必须在客户现场以面对面形式开展,因此咨询人员需前往几乎所有分配到的客户现场以完成工作任务;优化目标为最小化实际产生的机票费用与咨询人员的薪资成本;咨询人员掌握不同的专业技能,仅能承接对应技能要求的客户需求,且各类技能难以快速复刻或通过交叉培训掌握;在为客户分配咨询人员前,需满足客户的优先级要求;为避免咨询人员产生不满情绪,每位咨询人员每周的飞行次数不得超过四次;由于具体工作时长由咨询人员与客户共同商定,因此CARPP问题不考虑时间窗约束。
创建时间:
2024-01-31



