TY - GEN
T1 - Heuristic Decision for Static and Dynamic Service Facility Location in Agricultural Maintenance Service Network
AU - Ren, Weibo
AU - Hu, Yaoguang
N1 - Publisher Copyright:
© 2022 IEEE.
PY - 2022
Y1 - 2022
N2 - Agricultural maintenance service network is built by the manufacturer to provide timely maintenance for failed machinery. However, maintenance demands increase sharply in the busy farming season due to continuous agricultural production, and service vehicles are provided by the manufacturer to compensate for the inadequate capacity of existing service facilities. This paper focuses on dynamic moving and geographical distributed agricultural machinery and considers the static and dynamic service facilities location and service unit districting problem. The problem is formulated as a mixed-integer programming to minimize total service costs, including vehicle transfer costs and service mileage costs, which consider dynamic demands and contiguity constraints. To solve the complex problem, an effective solution algorithm integrating genetic algorithm and tabu search method is designed to select the location of static service stations and service vehicles. The service districting problem is addressed simultaneously. Last, apractical application in Henan is introduced to verify the application of the proposed approach and computational results are illustrated to demonstrate the sensitivity analysis in the real case.
AB - Agricultural maintenance service network is built by the manufacturer to provide timely maintenance for failed machinery. However, maintenance demands increase sharply in the busy farming season due to continuous agricultural production, and service vehicles are provided by the manufacturer to compensate for the inadequate capacity of existing service facilities. This paper focuses on dynamic moving and geographical distributed agricultural machinery and considers the static and dynamic service facilities location and service unit districting problem. The problem is formulated as a mixed-integer programming to minimize total service costs, including vehicle transfer costs and service mileage costs, which consider dynamic demands and contiguity constraints. To solve the complex problem, an effective solution algorithm integrating genetic algorithm and tabu search method is designed to select the location of static service stations and service vehicles. The service districting problem is addressed simultaneously. Last, apractical application in Henan is introduced to verify the application of the proposed approach and computational results are illustrated to demonstrate the sensitivity analysis in the real case.
KW - Agricultural distributed machinery
KW - Contiguity constraints
KW - Facility location problem
KW - Maintenance service network
UR - http://www.scopus.com/inward/record.url?scp=85146307252&partnerID=8YFLogxK
U2 - 10.1109/IEEM55944.2022.9989981
DO - 10.1109/IEEM55944.2022.9989981
M3 - Conference contribution
AN - SCOPUS:85146307252
T3 - IEEE International Conference on Industrial Engineering and Engineering Management
SP - 275
EP - 279
BT - IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2022
PB - IEEE Computer Society
T2 - 2022 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2022
Y2 - 7 December 2022 through 10 December 2022
ER -