Show/Hide Menu
Hide/Show Apps
anonymousUser
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Açık Bilim Politikası
Açık Bilim Politikası
Frequently Asked Questions
Frequently Asked Questions
Browse
Browse
By Issue Date
By Issue Date
Authors
Authors
Titles
Titles
Subjects
Subjects
Communities & Collections
Communities & Collections
New heuristics for the balanced k-Chinese postmen problem
Date
2018-10-01
Author
Limon, Yasemin
Azizoğlu, Meral
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
4
views
0
downloads
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.
Subject Keywords
K-Chinese postmen problem
,
Costs of the postmen
,
Pure integer nonlinear programming
URI
https://hdl.handle.net/11511/38689
Journal
International Journal of Planning and Scheduling
DOI
https://doi.org/10.1504/ijps.2018.095457
Collections
Department of Industrial Engineering, Article