Proceedings of the 2015 AASRI International Conference on Circuits and Systems

Research on Dispatching Problem of Maintenance Personnel

Authors
Niu Dandan, Dong Zengshou, Gao Kun
Corresponding Author
Niu Dandan
Available Online August 2015.
DOI
https://doi.org/10.2991/cas-15.2015.72How to use a DOI?
Keywords
maintenance services; the improved genetic algorithm; path optimization.
Abstract
When the enterprise received the service request from the customer, firstly it will collect the maintenance services at the same time for generating the task list, and then match the right person to perform the task to meet custom needs. Therefore, it is a key issue for the enterprise how to select maintenance staff efficiently. As to the issue, it is established a single target path optimization mathematical model of the maintenance personnel, in the coordinates for breakdown maintenance of Beilin52 location, based on analyzing the drawback of the genetic algorithm, by judging the individual similarity, to increase the diversity of population. Finally, the results of traditional genetic algorithm and improved genetic algorithm are compared, greatly improving the speed of convergence to prove the validity of the model and algorithm.
Open Access
This is an open access article distributed under the CC BY-NC license.

Download article (PDF)

Proceedings
Part of series
Advances in Computer Science Research
Publication Date
August 2015
ISBN
978-94-62520-74-5
ISSN
2352-538X
DOI
https://doi.org/10.2991/cas-15.2015.72How to use a DOI?
Open Access
This is an open access article distributed under the CC BY-NC license.

Cite this article

TY  - CONF
AU  - Niu Dandan
AU  - Dong Zengshou
AU  - Gao Kun
PY  - 2015/08
DA  - 2015/08
TI  - Research on Dispatching Problem of Maintenance Personnel
PB  - Atlantis Press
SP  - 301
EP  - 304
SN  - 2352-538X
UR  - https://doi.org/10.2991/cas-15.2015.72
DO  - https://doi.org/10.2991/cas-15.2015.72
ID  - Dandan2015/08
ER  -