STREET WASHING TRUCK ROUTING WITH INTERMEDIATE REFILL FACILITIES

Authors

  • Ching-Jung Ting Yuan Ze University
  • Han-Shiuan Tsai

DOI:

https://doi.org/10.23055/ijietap.2018.25.5.3700

Keywords:

street washing truck, arc routing problem, intermediate refill, ant colony optimization, path relinking

Abstract

The capacitated arc routing problem (CARP) is to determine a set of tours that traverse a set of required arcs with capacitated limitation on vehicles. There are many practical applications for variants of the CARP, including street washing and snow removal. The aim of this paper is to discuss the street washing truck routing problem with intermediate refill points (SWRPIR), a variant of the capacitated arc routing problem. Routes for street washing trucks are normally planned in advance and must be designed to take into account the vehicle capacity. Street washing vehicles could refill water at intermediate refill points without going back to the depot to save time. Due to that SWRPIR is an NP-hard problem, we proposed an ant colony optimization (ACO) algorithm to solve the problem. The ACO is tested with benchmark instances and real world cases. The results indicate that our ACO is competitive in benchmark instances with compared algorithms and can reduce the total distance for the washing vehicles for real world cases.

Author Biography

Ching-Jung Ting, Yuan Ze University

Professor, Department of Industrial Engineering and Management

Published

2019-01-03

How to Cite

Ting, C.-J., & Tsai, H.-S. (2019). STREET WASHING TRUCK ROUTING WITH INTERMEDIATE REFILL FACILITIES. International Journal of Industrial Engineering: Theory, Applications, and Practice, 25(5). https://doi.org/10.23055/ijietap.2018.25.5.3700