In this paper, we consider a multi-attribute technician routing and scheduling problem motivated by an application for the maintenance and repair of electronic transaction equipment. This problem is aimed at routing t...
详细信息
In this paper, we consider a multi-attribute technician routing and scheduling problem motivated by an application for the maintenance and repair of electronic transaction equipment. This problem is aimed at routingtechnicians to perform tasks at different customer locations so as to maximize the total gain associated with served customers, minus the operations costs (total travelled distance and overtime of the technicians). At the same time, a number of constraints must be satisfied like technician skills, breaks, maximum distance, multiple time windows and parts inventory. A mixed integer linear programming model is proposed to address this problem, which is then solved with a commercial solver. The computational results explore the difficulty of the problem along various dimensions and underline its inherent complexity.
This paper proposes two models for the technician routing and scheduling problem (TRSP), which are motivated by a telecom provider based in Saskatchewan, Canada. The proposed TRSP models are distinguished from existin...
详细信息
This paper proposes two models for the technician routing and scheduling problem (TRSP), which are motivated by a telecom provider based in Saskatchewan, Canada. The proposed TRSP models are distinguished from existing models by their ability to address two key issues: overnight and lunch break scheduling. The models aim to scheduling a set of technicians with homogeneous skill levels and different working hours for the purpose of providing services with different service times and time windows to a diverse set of widely spread communities. As the large-sized experiments of this problem categorized into NP-hard problems, a metaheuristic-based technique, Invasive Weed Optimization, is developed to solve them. A comparative analysis is performed to choose the optimum TRSP model based on two factors which are distance of communities to the main depot and balanced service times during planning horizon. The performance of the models is evaluated through the real-world data obtained from the telecom provider. The results prove that the overnight TRSP model is capable of substantially decreasing travel costs and the number of technicians that are required to perform the same set of services.
暂无评论