Heuristics for the weighted k-Chinese/rural postman problem with a hint of fixed costs with applications to urban snow removal
2015 (English)Report (Other academic)
We describe a weighted version of the k-Chinese or k-rural postman problem that occurs in the context of snow removal. The problem concerns the questions of which vehicle shall do each task and how the vehicles shall travel between tasks. We also consider different numbers of vehicles, in view of a fixed cost for each vehicle. We describe and discuss heuristic solution approaches, based on usable substructures, such as Chinese/rural postman problems, meta-heuristics, k-means clustering and local search improvements by moving cycles. The methods have been implemented and tested on real life examples.
Place, publisher, year, edition, pages
Linköping University Electronic Press, 2015. , 113 p.
LiTH-MAT-R, ISSN 0348-2960 ; 2015:13
IdentifiersURN: urn:nbn:se:liu:diva-122168ISRN: LiTH-MAT-R--2015/13--SEOAI: oai:DiVA.org:liu-122168DiVA: diva2:862625