Hide/Show Apps

New heuristics for the balanced k-Chinese postmen problem

Limon, Yasemin
Azizoğlu, Meral
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.