Cited 38 time in
Pickup and delivery problem with recharging for material handling systems utilising autonomous mobile robots
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Jun, Sungbum | - |
| dc.contributor.author | Lee, Seokcheon | - |
| dc.contributor.author | Yih, Yuehwern | - |
| dc.date.accessioned | 2023-04-27T18:40:31Z | - |
| dc.date.available | 2023-04-27T18:40:31Z | - |
| dc.date.issued | 2021-03-16 | - |
| dc.identifier.issn | 0377-2217 | - |
| dc.identifier.issn | 1872-6860 | - |
| dc.identifier.uri | https://scholarworks.dongguk.edu/handle/sw.dongguk/5188 | - |
| dc.description.abstract | Whereas automated guided vehicles (AGVs) have traditionally been used for material handling, the utilisation of autonomous mobile robots (AMRs) is growing quickly owing to their scalability, versatility, and lower costs. In this paper, we address the pickup and delivery problem with consideration of the characteristics of AMRs in manufacturing environments. To solve the problem, we first propose a new mathematical formulation with consideration of both partial and full recharging strategies for minimisation of the total tardiness of transportation requests. We then propose two constructive heuristic algorithms with high computation speed, which are called the Transportation-Request-Initiated Grouping Algorithm (TRIGA) and the Vehicle-Initiated Grouping Algorithm (VIGA). Additionally, we develop a memetic algorithm (MA) that incorporates a genetic algorithm into local-search techniques for finding near-optimal solutions within a reasonable time. We evaluate the performance of the proposed algorithms in comparison with two dispatching rules, genetic algorithm, and neighbourhood search through simulation experiments with three sets of problem instances under different battery levels. The simulation results indicate that the proposed algorithms outperform the others with regard to the average total tardiness and the relative deviation index. (C) 2020 Elsevier B.V. All rights reserved. | - |
| dc.format.extent | 16 | - |
| dc.language | 영어 | - |
| dc.language.iso | ENG | - |
| dc.publisher | ELSEVIER | - |
| dc.title | Pickup and delivery problem with recharging for material handling systems utilising autonomous mobile robots | - |
| dc.type | Article | - |
| dc.publisher.location | 네델란드 | - |
| dc.identifier.doi | 10.1016/j.ejor.2020.07.049 | - |
| dc.identifier.scopusid | 2-s2.0-85090486005 | - |
| dc.identifier.wosid | 000596436100026 | - |
| dc.identifier.bibliographicCitation | EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, v.289, no.3, pp 1153 - 1168 | - |
| dc.citation.title | EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | - |
| dc.citation.volume | 289 | - |
| dc.citation.number | 3 | - |
| dc.citation.startPage | 1153 | - |
| dc.citation.endPage | 1168 | - |
| dc.type.docType | Article; Proceedings Paper | - |
| dc.description.isOpenAccess | N | - |
| dc.description.journalRegisteredClass | scie | - |
| dc.description.journalRegisteredClass | scopus | - |
| dc.relation.journalResearchArea | Business & Economics | - |
| dc.relation.journalResearchArea | Operations Research & Management Science | - |
| dc.relation.journalWebOfScienceCategory | Management | - |
| dc.relation.journalWebOfScienceCategory | Operations Research & Management Science | - |
| dc.subject.keywordPlus | VEHICLE-ROUTING PROBLEM | - |
| dc.subject.keywordPlus | LARGE NEIGHBORHOOD SEARCH | - |
| dc.subject.keywordPlus | TIME WINDOWS | - |
| dc.subject.keywordPlus | DYNAMIC PICKUP | - |
| dc.subject.keywordPlus | ALGORITHM | - |
| dc.subject.keywordPlus | OPTIMIZATION | - |
| dc.subject.keywordPlus | METHODOLOGY | - |
| dc.subject.keywordPlus | SOLVE | - |
| dc.subject.keywordAuthor | Pickup and delivery problem | - |
| dc.subject.keywordAuthor | Autonomous mobile robots | - |
| dc.subject.keywordAuthor | Material handling | - |
| dc.subject.keywordAuthor | Memetic algorithm | - |
| dc.subject.keywordAuthor | Mixed-integer linear programming | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
30, Pildong-ro 1-gil, Jung-gu, Seoul, 04620, Republic of Korea+82-2-2260-3114
Copyright(c) 2023 DONGGUK UNIVERSITY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.
