DC Field | Value | Language |
---|---|---|
dc.contributor.author | Shin, Kwang-Cheol | ko |
dc.contributor.author | Han, Sang-Yong | ko |
dc.date.accessioned | 2013-03-09T04:32:59Z | - |
dc.date.available | 2013-03-09T04:32:59Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2011 | - |
dc.identifier.citation | COMPUTING AND INFORMATICS, v.30, no.4, pp.721 - 732 | - |
dc.identifier.issn | 1335-9150 | - |
dc.identifier.uri | http://hdl.handle.net/10203/95369 | - |
dc.description.abstract | The vehicle routing problem (VRP) is famous as a nondeterministic polynomial-time hard problem. This study proposes a centroid-based heuristic algorithm to solve the capacitated VRP in polynomial time. The proposed algorithm consists of three phases: cluster construction, cluster adjustment, and route establishment. At the cluster construction phase, the farthest node (customer) among un-clustered nodes is selected as a seed to form a cluster. The notion of the geometrical centre of a cluster is introduced in this study to be utilized at the cluster construction and the cluster adjustment phases. The proposed algorithm has a polynornial time complexity of O(n(2.2)). Experimental results on Augerat benchmark dataset show that the proposed 3-phase approach can result in smaller distances than the Sweep algorithm in more cases. | - |
dc.language | English | - |
dc.publisher | Slovak Acad Sciences Inst Informatics | - |
dc.subject | TRAVELING-SALESMAN PROBLEM | - |
dc.subject | DELIVERY POINTS | - |
dc.subject | NUMBER | - |
dc.title | A CENTROID-BASED HEURISTIC ALGORITHM FOR THE CAPACITATED VEHICLE ROUTING PROBLEM | - |
dc.type | Article | - |
dc.identifier.wosid | 000295807600004 | - |
dc.identifier.scopusid | 2-s2.0-80053969345 | - |
dc.type.rims | ART | - |
dc.citation.volume | 30 | - |
dc.citation.issue | 4 | - |
dc.citation.beginningpage | 721 | - |
dc.citation.endingpage | 732 | - |
dc.citation.publicationname | COMPUTING AND INFORMATICS | - |
dc.contributor.nonIdAuthor | Han, Sang-Yong | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | Vehicle routing problem | - |
dc.subject.keywordAuthor | heuristics | - |
dc.subject.keywordAuthor | cluster-first route-second | - |
dc.subject.keywordPlus | TRAVELING-SALESMAN PROBLEM | - |
dc.subject.keywordPlus | DELIVERY POINTS | - |
dc.subject.keywordPlus | NUMBER | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.