Multi-swarm particle swarm optimization for payment scheduling
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Li, Xiao-Miao | - |
dc.contributor.author | Sun, Ying Lin | - |
dc.contributor.author | Chen, Wei-Neng | - |
dc.contributor.author | Zhang, Jun | - |
dc.date.accessioned | 2023-11-24T02:33:36Z | - |
dc.date.available | 2023-11-24T02:33:36Z | - |
dc.date.issued | 2017-05 | - |
dc.identifier.issn | 2164-4357 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/115705 | - |
dc.description.abstract | The payment scheduling negotiation problem with multi-mode and resource constraints (MRCPSNP) is a practical extension to the resource-constrained project scheduling problem (RCPSP). It considers the interests of both the client and the contractor, who negotiate with each other to maximize their own benefits. Since the interests of the client and contractor are conflicting and the two roles have special scheduling requirements, it is difficult to solve this problem. This paper addresses MRCPSNP and adopts the net present value (NPV) of discounted cash flows to measure the potential value. To simulate the negotiation process, we adopt a co-evolution strategy and make the two parts negotiate with each other to maximize their own NPV. To specify special requirements of the two roles, a multi-level region of interest strategy is proposed. The co-evolution strategy and the multi-level region of interest strategy are integrated into a particle swarm optimization (PSO) algorithm, forming a multi-swarm particle swarm optimization (MPSO) approach. Experimental comparisons with the other two methods on 30 project instances demonstrate that the proposed approach is very effective and promising. © 2017 IEEE. | - |
dc.format.extent | 8 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | Institute of Electrical and Electronics Engineers Inc. | - |
dc.title | Multi-swarm particle swarm optimization for payment scheduling | - |
dc.type | Article | - |
dc.publisher.location | 미국 | - |
dc.identifier.doi | 10.1109/ICIST.2017.7926771 | - |
dc.identifier.scopusid | 2-s2.0-85020167827 | - |
dc.identifier.wosid | 000403402600047 | - |
dc.identifier.bibliographicCitation | 2017 Seventh International Conference on Information Science and Technology (ICIST), pp 284 - 291 | - |
dc.citation.title | 2017 Seventh International Conference on Information Science and Technology (ICIST) | - |
dc.citation.startPage | 284 | - |
dc.citation.endPage | 291 | - |
dc.type.docType | Conference paper | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | sci | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
dc.subject.keywordPlus | ANT COLONY OPTIMIZATION | - |
dc.subject.keywordPlus | EVOLUTIONARY ALGORITHM | - |
dc.subject.keywordPlus | TABU SEARCH | - |
dc.subject.keywordPlus | PROJECT | - |
dc.subject.keywordPlus | CLASSIFICATION | - |
dc.subject.keywordAuthor | Evolutionary algorithms | - |
dc.subject.keywordAuthor | Multiobjective optimization | - |
dc.subject.keywordAuthor | Net Present Value | - |
dc.subject.keywordAuthor | Payment Scheduling | - |
dc.subject.keywordAuthor | Project Scheduling | - |
dc.identifier.url | https://ieeexplore.ieee.org/document/7926771?arnumber=7926771&SID=EBSCO:edseee | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
55 Hanyangdeahak-ro, Sangnok-gu, Ansan, Gyeonggi-do, 15588, Korea+82-31-400-4269 sweetbrain@hanyang.ac.kr
COPYRIGHT © 2021 HANYANG 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.