You can view the full text of this article for free using the link below.

Title: New heuristics for the balanced k-Chinese postmen problem

Authors: Yasemin Limon; Meral Azizoğlu

Addresses: Department of Industrial Engineering, University of Wisconsin, Madison, USA ' Department of Industrial Engineering, Middle East Technical University, Ankara 06800, Turkey

Abstract: In this study, we consider a directed k-Chinese postmen problem that aims to balance the costs of the postmen, while maintaining the total cost as small as possible. We formulate the problem as a pure integer nonlinear programming model. We propose three solution algorithms that use efficient incorporation of the heuristic subtour elimination constraints. Our computational results have revealed the satisfactory performances of our heuristic solution algorithms.

Keywords: k-Chinese postmen problem; pure integer nonlinear program; heuristic solution algorithms.

DOI: 10.1504/IJPS.2018.095457

International Journal of Planning and Scheduling, 2018 Vol.2 No.4, pp.331 - 349

Received: 24 Jan 2018
Accepted: 14 Jun 2018

Published online: 02 Oct 2018 *

Full-text access for editors Access for subscribers Free access Comment on this article