Penalty variable neighborhood search for the bounded single-depot multiple traveling repairmen problem

URN:NBN:SI:doc-B8PXE4WF2021Ban, Ha-Bangdocuments/doc/B/URN_NBN_SI_doc-B8PXE4WF_001.pdfdocuments/doc/B/URN_NBN_SI_doc-B8PXE4WF_001.txt145articlestr. 93-1040350-559610.31449/inf.v45i1.281463053059URN:NBN:SI:doc-B8PXE4WFengSlovensko društvo InformatikaInformatica (Ljubljana)BYalgoritmigrafiumetna inteligencaPenalty variable neighborhood search for the bounded single-depot multiple traveling repairmen problem