Optimization Strategies for Restricted Candidate Lists in Field Service Scheduling

Author(s):  
Marko Žerdin ◽  
Alexander Gibrekhterman ◽  
Uzi Zahavi ◽  
Dovi Yellin
2012 ◽  
Vol 53 (2) ◽  
pp. 282-293 ◽  
Author(s):  
Ioannis Petrakis ◽  
Christian Hass ◽  
Martin Bichler

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
Bin Wu ◽  
Hui-Jun Jiang ◽  
Chao Wang ◽  
Min Dong

The field service scheduling problem (FSSP) is the key problem in field services. Field service pays particular attention to customer experience, that is, customer satisfaction. Customer satisfaction described by customer behavior characteristics based on the prospect theory is considered as the primary optimization goal in this paper. The knowledge of the insertion feasibility on the solution is analysed based on the skill constraint and time window. According to the knowledge, an initialization method based on the nearest heuristic algorithm is constructed. Based on the prior knowledge of the FSSP and the endowment of the Fruit Fly Optimization Algorithm, two operators are defined according to the matrix encoding method. Based on these two operators, three search strategies are then proposed, and the smell-based search strategy and vision-based search strategy for the FOA are redesigned. To verify the performance of the algorithms, the proposed operators and strategies are tested and analysed in the well-known benchmark. Through comparison with the state-of-the-art algorithms, the results show that the proposed HFOA is an effective and efficient method to solve the FSSP with customer satisfaction.


2019 ◽  
Vol 7 (1) ◽  
pp. 30-38
Author(s):  
P. Sen ◽  
D.Sarddar . ◽  
S.K. Sinha ◽  
R. Pandit

Sign in / Sign up

Export Citation Format

Share Document