Description of the datasets for the experiments in the paper "solving the multi-vehicle multi-covering tour problem"

Tuan Anh Pham; Minh Hoàng Hà; Xuan Hoai Nguyen

doi:10.1016/j.dib.2018.03.106

Description of the datasets for the experiments in the paper "solving the multi-vehicle multi-covering tour problem"

Data Brief. 2018 Mar 27:18:1146-1148. doi: 10.1016/j.dib.2018.03.106. eCollection 2018 Jun.

Authors

Tuan Anh Pham^{1

2}, Minh Hoàng Hà^{3

4}, Xuan Hoai Nguyen⁵

Affiliations

¹ Military Logistics Research Center, Military Logistics Academy, Vietnam.
² GRD Department, VNG Corporation, Vietnam.
³ University of Engineering and Technology, VNU, Vietnam.
⁴ FPT Technology Research Institute, FPT University, Vietnam.
⁵ IT R&D Center, Hanoi University, Vietnam.

Abstract

This data article contains data related to the research article entitled, "Solving the multi-vehicle multi-covering tour problem" (Pham et al., 2017) [4]. All data of this article was generated from instances kroA100, kroB100, kroC100, kroD100, kroA200, and kroB200 from TSPLIB. It can be downloaded from public repository. This data can be used as benchmarks for the covering tour problem (CTP) variants, such as m-CTP-p, m-CTP, mm-CTP-p, mm-CTP, mm-CTP-o, mm-CTP-wo. We tested our algorithm on these data and results are shown in Pham et al. (2017) [4].