摘要
This paper considers the product service scheduling problem with service matching. This problem is a complex scheduling problem that integrates multiple traveling salesman problem (MTSP) and multiple service types. To solve the problem, a tabu search method was presented. With the objective of minimizing the total of engineers' travel distances, total of the customer penalty values, and makespan, an optimization model of this problem is established. The historical search solutions are taken as tabu object, and limiting the quantity of search neighborhood solution is taken as the aspiration level. At last, the adaptability, validity, and stability of the model are verified by an example.
学科与关键词
关键词
TRAVELING SALESMEN PROBLEMVEHICLE-ROUTING PROBLEMGENETIC ALGORITHMSINGLE-MACHINETIMES
- A tabu search approach for cell scheduling problem with makespan criterionSolimanpur, Maghsud*; Elmi, AtabakINTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2013, 141(2): 639-645.被引 48
- MOAMP-Tabu search and NSGA-II for a real Bi-objective scheduling-routing problemMartinez-Puras, Amaya; Pacheco, Joaquin*Knowledge-Based Systems, 2016, 112: 92-104.被引 26
- Tabu Search Based Hybrid Meta-Heuristic Approaches for Schedule-Based Production Cost Minimization Problem for the Case of Cable Manufacturing SystemsDaneshdoost, Fereshteh; Hajiaghaei-keshteli, Mostafa; Sahin, Ramazan; Niroomand, Sadegh*INFORMATICA, 2022, 33(3): 499-522.被引 19
