Cited 7 time in
Evolutionary neural network for learning of scalable heuristics for pickup and delivery problems with time windows
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Jun, Sungbum | - |
| dc.contributor.author | Lee, Seokcheon | - |
| dc.date.accessioned | 2023-04-27T10:40:51Z | - |
| dc.date.available | 2023-04-27T10:40:51Z | - |
| dc.date.issued | 2022-07 | - |
| dc.identifier.issn | 0360-8352 | - |
| dc.identifier.issn | 1879-0550 | - |
| dc.identifier.uri | https://scholarworks.dongguk.edu/handle/sw.dongguk/2901 | - |
| dc.description.abstract | In this paper, we address the pickup and delivery problem with time windows (PDP-TW) and heterogenous vehicles for minimisation of total tardiness by learning heuristics from a given set of solutions. In order to extract scalable heuristics from optimal or best feasible solutions, we propose a machine-learning (ML)-based approach called ENSIGHT (Evolutionary Neural network with Scalable Information for Generation of Heuristics for Transportation). ENSIGHT consists of three phases: solution generation, interpretation of solutions, and improvement of heuristics by an evolutionary neural network (ENN). First, a set of optimal or best feasible solutions for the training set of problem instances is acquired by using the proposed mathematical model. Second, as for the process interpreting those solutions, an approach for transforming them into training data by way of scalable input attributes as well as output discretisation is followed. Third, the ENN improves the learned heuristics by an evolutionary parameter optimisation process for minimization of total tardiness. To verify the performance of the proposed ENSIGHT, we conducted experiments and the results of which showed that it outperforms other ML techniques and the current dispatching rules (DRs). Moreover, the approach was demonstrated to be effective in learning scalable heuristics based on combined scalable inputs and discretisation as well as an evolutionary improvement process. | - |
| dc.format.extent | 20 | - |
| dc.language | 영어 | - |
| dc.language.iso | ENG | - |
| dc.publisher | Elsevier Ltd. | - |
| dc.title | Evolutionary neural network for learning of scalable heuristics for pickup and delivery problems with time windows | - |
| dc.type | Article | - |
| dc.publisher.location | 네델란드 | - |
| dc.identifier.doi | 10.1016/j.cie.2022.108282 | - |
| dc.identifier.scopusid | 2-s2.0-85131411917 | - |
| dc.identifier.wosid | 000809236200001 | - |
| dc.identifier.bibliographicCitation | Computers & Industrial Engineering, v.169, pp 1 - 20 | - |
| dc.citation.title | Computers & Industrial Engineering | - |
| dc.citation.volume | 169 | - |
| dc.citation.startPage | 1 | - |
| dc.citation.endPage | 20 | - |
| dc.type.docType | Article | - |
| dc.description.isOpenAccess | Y | - |
| dc.description.journalRegisteredClass | scie | - |
| dc.description.journalRegisteredClass | scopus | - |
| dc.relation.journalResearchArea | Computer Science | - |
| dc.relation.journalResearchArea | Engineering | - |
| dc.relation.journalWebOfScienceCategory | Computer Science, Interdisciplinary Applications | - |
| dc.relation.journalWebOfScienceCategory | Engineering, Industrial | - |
| dc.subject.keywordPlus | LARGE NEIGHBORHOOD SEARCH | - |
| dc.subject.keywordPlus | DYNAMIC PICKUP | - |
| dc.subject.keywordPlus | DISPATCHING RULES | - |
| dc.subject.keywordPlus | ALGORITHM | - |
| dc.subject.keywordAuthor | Pickup and delivery problem | - |
| dc.subject.keywordAuthor | Machine learning | - |
| dc.subject.keywordAuthor | Evolutionary neural network | - |
| dc.subject.keywordAuthor | Scalable information | - |
| 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.
