Path-Relinking for Fire Station Location

Srianan T., Sangsawang O.

1st International Conference on Intelligent Computing and Optimization (ICO), Pattaya, Thailand, 4 - 05 October 2018, vol.866, pp.531-538 identifier identifier

  • Publication Type: Conference Paper / Full Text
  • Volume: 866
  • Doi Number: 10.1007/978-3-030-00979-3_56
  • City: Pattaya
  • Country: Thailand
  • Page Numbers: pp.531-538
  • Keywords: Path relinking, Maximal covering location problem, Fire stations


In this paper, we propose the path relinking to solve the maximal covering location problem in which the demand points correspond to number of employees in industrial factories in Rayong, a province on the east coast of the Gulf of Thailand. According to the statistics for the fire in Thailand from 2012-2016; fire events tended upwards continuously from 2012 at 58.15 percent. Studying data on the fire to factories over the country in 2014-2015, Rayong province was high ranked fire occurrences which result in massive destruction. Path relinking algorithms are compared on the real-life instances to illustrate the efficiency of the proposed method.