Data For: Consultant Assignment and Routing Problem with Priority
收藏DataCite Commons2025-05-01 更新2025-05-17 收录
下载链接:
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.
提供机构:
Mendeley
创建时间:
2020-10-08



