Title: Comments on the 'polynomial formulation and heuristic-based approach for the k-travelling repairman problem'

Authors: İmdat Kara; Bahar Y. Kara

Addresses: Department of Industrial Engineering, Baskent University Faculty of Engineering, Baglica Campus Ankara, Turkey ' Department of Industrial Engineering, Bilkent University Faculty of Engineering, Bilkent Campus Ankara, Turkey

Abstract: The paper 'polynomial formulation and heuristic-based approach for the k-travelling repairman problem' claims to present the first polynomial formulation for the k-travelling repairman problem (k-TRP). We first make some corrections on this formulation and we show that the first polynomial size formulation for k-TRP is the one proposed by Kara et al. (2008).

Keywords: repairman problem; k-travelling repairman problem; minimum latency problem; delivery man problem.

DOI: 10.1504/IJMOR.2019.101610

International Journal of Mathematics in Operational Research, 2019 Vol.15 No.1, pp.26 - 32

Received: 27 May 2017
Accepted: 28 Jan 2018
Published online: 14 Aug 2019 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article