DC Field | Value | Language |
---|---|---|
dc.contributor.author | Yeowoon Jun | - |
dc.contributor.author | Kim, BI | - |
dc.date.accessioned | 2016-03-31T09:10:52Z | - |
dc.date.available | 2016-03-31T09:10:52Z | - |
dc.date.created | 2012-03-14 | - |
dc.date.issued | 2012-04 | - |
dc.identifier.issn | 0957-4174 | - |
dc.identifier.other | 2012-OAK-0000024904 | - |
dc.identifier.uri | https://oasis.postech.ac.kr/handle/2014.oak/16774 | - |
dc.description.abstract | This paper discusses the vehicle routing problem with simultaneous pickup and delivery (VRPSPD), in which both pickup and delivery tasks simultaneously occur at various customer locations. The objective is to design a set of minimum distance routes with the minimum number of vehicles satisfying all the customers. This paper proposes a heuristic algorithm consisting of a route construction procedure, a route improvement procedure, and a solution perturbation procedure. A new sweep-based route construction method is developed to generate better initial solutions. In the route improvement procedure, a series of inter- and intra-route improvement algorithms are applied. The perturbation procedure perturbs a solution by removing some routes and stops from the solution and reinserting them into the solution. The last procedure is used to escape from local optima. Computational experiments on various benchmark instances are performed to evaluate our algorithm against the previously proposed approaches. New best solutions for many benchmark instances are found. (C) 2011 Elsevier Ltd. All rights reserved. | - |
dc.description.statementofresponsibility | X | - |
dc.language | English | - |
dc.publisher | Elsevier | - |
dc.relation.isPartOf | Expert Systems with Applications | - |
dc.title | New best solutions to VRPSPD benchmark problems by a perturbation based algorithm | - |
dc.type | Article | - |
dc.contributor.college | 산업경영공학과 | - |
dc.identifier.doi | 10.1016/J.ESWA.2011.11.053 | - |
dc.author.google | Jun Y., Kim B.-I. | - |
dc.relation.volume | 39 | - |
dc.relation.issue | 5 | - |
dc.relation.startpage | 5641 | - |
dc.relation.lastpage | 5648 | - |
dc.contributor.id | 10135658 | - |
dc.relation.journal | Expert Systems with Applications | - |
dc.relation.index | SCI급, SCOPUS 등재논문 | - |
dc.relation.sci | SCIE | - |
dc.collections.name | Journal Papers | - |
dc.type.rims | ART | - |
dc.identifier.bibliographicCitation | Expert Systems with Applications, v.39, no.5, pp.5641 - 5648 | - |
dc.identifier.wosid | 000301155300102 | - |
dc.date.tcdate | 2019-01-01 | - |
dc.citation.endPage | 5648 | - |
dc.citation.number | 5 | - |
dc.citation.startPage | 5641 | - |
dc.citation.title | Expert Systems with Applications | - |
dc.citation.volume | 39 | - |
dc.contributor.affiliatedAuthor | Kim, BI | - |
dc.identifier.scopusid | 2-s2.0-84855887544 | - |
dc.description.journalClass | 1 | - |
dc.description.journalClass | 1 | - |
dc.description.wostc | 10 | - |
dc.description.scptc | 10 | * |
dc.date.scptcdate | 2018-05-121 | * |
dc.type.docType | Article | - |
dc.subject.keywordPlus | VEHICLE-ROUTING PROBLEM | - |
dc.subject.keywordPlus | TABU SEARCH ALGORITHM | - |
dc.subject.keywordPlus | PICK-UP | - |
dc.subject.keywordPlus | SIMULTANEOUS DELIVERY | - |
dc.subject.keywordPlus | SERVICE | - |
dc.subject.keywordPlus | POINTS | - |
dc.subject.keywordPlus | SINGLE | - |
dc.subject.keywordAuthor | VRPSPD | - |
dc.subject.keywordAuthor | Vehicle routing problem | - |
dc.subject.keywordAuthor | Simultaneous pickup and delivery | - |
dc.subject.keywordAuthor | Sweep algorithm | - |
dc.subject.keywordAuthor | Perturbation | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Artificial Intelligence | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.relation.journalWebOfScienceCategory | Operations Research & Management Science | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalResearchArea | Operations Research & Management Science | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
library@postech.ac.kr Tel: 054-279-2548
Copyrights © by 2017 Pohang University of Science ad Technology All right reserved.