Yayın:
Multiperiod Multi Traveling Salesmen Problem Considering Time Window Constraints with an Application to a Real World Case

Sadeleştirilmiş öğe sayfası
dc.contributor.authorYapıcıoğlu, Haluk
dc.contributor.orcid0000-0003-2296-4989
dc.date.accessioned2025-11-13T11:27:07Z
dc.date.issued2017-09-22
dc.identifier.doihttps://doi.org/10.1007/s11067-017-9367-9
dc.identifier.endpage801
dc.identifier.issn1566-113X
dc.identifier.issue4
dc.identifier.openalexW2759876802
dc.identifier.startpage773
dc.identifier.urihttps://hdl.handle.net/11421/6837
dc.identifier.urihttps://doi.org/10.1007/s11067-017-9367-9
dc.identifier.volume18
dc.language.isoen
dc.relation.ispartofNetworks and Spatial Economics
dc.rightsrestrictedAccess
dc.subjectMathematical optimization
dc.subjectComputer science
dc.subjectTabu search
dc.subjectSimulated annealing
dc.subjectHeuristic
dc.subjectInteger programming
dc.subjectWindow (computing)
dc.subjectTravel time
dc.subjectStochastic programming
dc.subjectInteger (computer science)
dc.subjectTrain
dc.subjectAlgorithm
dc.subjectMathematics
dc.subjectEngineering
dc.subject.sdg8
dc.titleMultiperiod Multi Traveling Salesmen Problem Considering Time Window Constraints with an Application to a Real World Case
dc.typeArticle
dspace.entity.typePublication
local.authorid.openalexA5022225508

Dosyalar

Koleksiyonlar

Publications