An Efficient Algorithm of Discrete Particle Swarm Optimization for Multi-Objective Task Assignment
In this paper, a discrete particle swarm optimization method is proposed to solve the multi-objective task assignment problem in distributed environment. The objectives of optimization include the makespan for task execution and the budget caused by resource occupation. A two-stage approach is desig...
Gespeichert in:
Veröffentlicht in: | IEICE Transactions on Information and Systems 2016/12/01, Vol.E99.D(12), pp.2968-2977 |
---|---|
Hauptverfasser: | , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 2977 |
---|---|
container_issue | 12 |
container_start_page | 2968 |
container_title | IEICE Transactions on Information and Systems |
container_volume | E99.D |
creator | QIAO, Nannan YOU, Jiali SHENG, Yiqiang WANG, Jinlin DENG, Haojiang |
description | In this paper, a discrete particle swarm optimization method is proposed to solve the multi-objective task assignment problem in distributed environment. The objectives of optimization include the makespan for task execution and the budget caused by resource occupation. A two-stage approach is designed as follows. In the first stage, several artificial particles are added into the initialized swarm to guide the search direction. In the second stage, we redefine the operators of the discrete PSO to implement addition, subtraction and multiplication. Besides, a fuzzy-cost-based elite selection is used to improve the computational efficiency. Evaluation shows that the proposed algorithm achieves Pareto improvement in comparison to the state-of-the-art algorithms. |
doi_str_mv | 10.1587/transinf.2016PAP0032 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1880007403</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1880007403</sourcerecordid><originalsourceid>FETCH-LOGICAL-c571t-b4c98405974d820c11223c73b750abf54a599adac683d5044f0f44354f2426ce3</originalsourceid><addsrcrecordid>eNpNkEtPAjEUhRujiYj-Axdduhm9fc1jOQF8JBgw4rrplBaK88C2aPTXiwHR1T2L853kfghdErgmIs9uoldtcK29pkDSaTkFYPQI9UjGRUJYSo5RDwqSJrlg9BSdhbACIDklooeqssUja512po24rBedd3HZ4M7ioQvam2jwVPnodG3w84fyDZ6so2vcl4qua7HtPH7c1NElk2pldHTvBs9UeMVlCG7RNtvVc3RiVR3Mxf720cvtaDa4T8aTu4dBOU60yEhMKq6LnIMoMj7PKWhCKGU6Y1UmQFVWcCWKQs2VTnM2F8C5Bcs5E9xSTlNtWB9d7XbXvnvbmBBls_3A1LVqTbcJkuQ5AGQc2LbKd1XtuxC8sXLtXaP8pyQgf5TKX6Xyn9It9rTDViGqhTlAez9_0Kgo5FASug__Ng5dvVRempZ9AxsoiVs</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1880007403</pqid></control><display><type>article</type><title>An Efficient Algorithm of Discrete Particle Swarm Optimization for Multi-Objective Task Assignment</title><source>J-STAGE Free</source><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><creator>QIAO, Nannan ; YOU, Jiali ; SHENG, Yiqiang ; WANG, Jinlin ; DENG, Haojiang</creator><creatorcontrib>QIAO, Nannan ; YOU, Jiali ; SHENG, Yiqiang ; WANG, Jinlin ; DENG, Haojiang</creatorcontrib><description>In this paper, a discrete particle swarm optimization method is proposed to solve the multi-objective task assignment problem in distributed environment. The objectives of optimization include the makespan for task execution and the budget caused by resource occupation. A two-stage approach is designed as follows. In the first stage, several artificial particles are added into the initialized swarm to guide the search direction. In the second stage, we redefine the operators of the discrete PSO to implement addition, subtraction and multiplication. Besides, a fuzzy-cost-based elite selection is used to improve the computational efficiency. Evaluation shows that the proposed algorithm achieves Pareto improvement in comparison to the state-of-the-art algorithms.</description><identifier>ISSN: 0916-8532</identifier><identifier>EISSN: 1745-1361</identifier><identifier>DOI: 10.1587/transinf.2016PAP0032</identifier><language>eng</language><publisher>The Institute of Electronics, Information and Communication Engineers</publisher><subject>Algorithms ; Computational efficiency ; discrete particle swarm optimization ; multi-objective ; Multiple objective analysis ; Occupation ; Operations research ; Optimization ; Swarm intelligence ; task assignment ; Tasks ; two-stage method</subject><ispartof>IEICE Transactions on Information and Systems, 2016/12/01, Vol.E99.D(12), pp.2968-2977</ispartof><rights>2016 The Institute of Electronics, Information and Communication Engineers</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c571t-b4c98405974d820c11223c73b750abf54a599adac683d5044f0f44354f2426ce3</citedby><cites>FETCH-LOGICAL-c571t-b4c98405974d820c11223c73b750abf54a599adac683d5044f0f44354f2426ce3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,1877,4010,27900,27901,27902</link.rule.ids></links><search><creatorcontrib>QIAO, Nannan</creatorcontrib><creatorcontrib>YOU, Jiali</creatorcontrib><creatorcontrib>SHENG, Yiqiang</creatorcontrib><creatorcontrib>WANG, Jinlin</creatorcontrib><creatorcontrib>DENG, Haojiang</creatorcontrib><title>An Efficient Algorithm of Discrete Particle Swarm Optimization for Multi-Objective Task Assignment</title><title>IEICE Transactions on Information and Systems</title><addtitle>IEICE Trans. Inf. & Syst.</addtitle><description>In this paper, a discrete particle swarm optimization method is proposed to solve the multi-objective task assignment problem in distributed environment. The objectives of optimization include the makespan for task execution and the budget caused by resource occupation. A two-stage approach is designed as follows. In the first stage, several artificial particles are added into the initialized swarm to guide the search direction. In the second stage, we redefine the operators of the discrete PSO to implement addition, subtraction and multiplication. Besides, a fuzzy-cost-based elite selection is used to improve the computational efficiency. Evaluation shows that the proposed algorithm achieves Pareto improvement in comparison to the state-of-the-art algorithms.</description><subject>Algorithms</subject><subject>Computational efficiency</subject><subject>discrete particle swarm optimization</subject><subject>multi-objective</subject><subject>Multiple objective analysis</subject><subject>Occupation</subject><subject>Operations research</subject><subject>Optimization</subject><subject>Swarm intelligence</subject><subject>task assignment</subject><subject>Tasks</subject><subject>two-stage method</subject><issn>0916-8532</issn><issn>1745-1361</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><recordid>eNpNkEtPAjEUhRujiYj-Axdduhm9fc1jOQF8JBgw4rrplBaK88C2aPTXiwHR1T2L853kfghdErgmIs9uoldtcK29pkDSaTkFYPQI9UjGRUJYSo5RDwqSJrlg9BSdhbACIDklooeqssUja512po24rBedd3HZ4M7ioQvam2jwVPnodG3w84fyDZ6so2vcl4qua7HtPH7c1NElk2pldHTvBs9UeMVlCG7RNtvVc3RiVR3Mxf720cvtaDa4T8aTu4dBOU60yEhMKq6LnIMoMj7PKWhCKGU6Y1UmQFVWcCWKQs2VTnM2F8C5Bcs5E9xSTlNtWB9d7XbXvnvbmBBls_3A1LVqTbcJkuQ5AGQc2LbKd1XtuxC8sXLtXaP8pyQgf5TKX6Xyn9It9rTDViGqhTlAez9_0Kgo5FASug__Ng5dvVRempZ9AxsoiVs</recordid><startdate>2016</startdate><enddate>2016</enddate><creator>QIAO, Nannan</creator><creator>YOU, Jiali</creator><creator>SHENG, Yiqiang</creator><creator>WANG, Jinlin</creator><creator>DENG, Haojiang</creator><general>The Institute of Electronics, Information and Communication Engineers</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>2016</creationdate><title>An Efficient Algorithm of Discrete Particle Swarm Optimization for Multi-Objective Task Assignment</title><author>QIAO, Nannan ; YOU, Jiali ; SHENG, Yiqiang ; WANG, Jinlin ; DENG, Haojiang</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c571t-b4c98405974d820c11223c73b750abf54a599adac683d5044f0f44354f2426ce3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>Algorithms</topic><topic>Computational efficiency</topic><topic>discrete particle swarm optimization</topic><topic>multi-objective</topic><topic>Multiple objective analysis</topic><topic>Occupation</topic><topic>Operations research</topic><topic>Optimization</topic><topic>Swarm intelligence</topic><topic>task assignment</topic><topic>Tasks</topic><topic>two-stage method</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>QIAO, Nannan</creatorcontrib><creatorcontrib>YOU, Jiali</creatorcontrib><creatorcontrib>SHENG, Yiqiang</creatorcontrib><creatorcontrib>WANG, Jinlin</creatorcontrib><creatorcontrib>DENG, Haojiang</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEICE Transactions on Information and Systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>QIAO, Nannan</au><au>YOU, Jiali</au><au>SHENG, Yiqiang</au><au>WANG, Jinlin</au><au>DENG, Haojiang</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An Efficient Algorithm of Discrete Particle Swarm Optimization for Multi-Objective Task Assignment</atitle><jtitle>IEICE Transactions on Information and Systems</jtitle><addtitle>IEICE Trans. Inf. & Syst.</addtitle><date>2016</date><risdate>2016</risdate><volume>E99.D</volume><issue>12</issue><spage>2968</spage><epage>2977</epage><pages>2968-2977</pages><issn>0916-8532</issn><eissn>1745-1361</eissn><abstract>In this paper, a discrete particle swarm optimization method is proposed to solve the multi-objective task assignment problem in distributed environment. The objectives of optimization include the makespan for task execution and the budget caused by resource occupation. A two-stage approach is designed as follows. In the first stage, several artificial particles are added into the initialized swarm to guide the search direction. In the second stage, we redefine the operators of the discrete PSO to implement addition, subtraction and multiplication. Besides, a fuzzy-cost-based elite selection is used to improve the computational efficiency. Evaluation shows that the proposed algorithm achieves Pareto improvement in comparison to the state-of-the-art algorithms.</abstract><pub>The Institute of Electronics, Information and Communication Engineers</pub><doi>10.1587/transinf.2016PAP0032</doi><tpages>10</tpages><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0916-8532 |
ispartof | IEICE Transactions on Information and Systems, 2016/12/01, Vol.E99.D(12), pp.2968-2977 |
issn | 0916-8532 1745-1361 |
language | eng |
recordid | cdi_proquest_miscellaneous_1880007403 |
source | J-STAGE Free; Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals |
subjects | Algorithms Computational efficiency discrete particle swarm optimization multi-objective Multiple objective analysis Occupation Operations research Optimization Swarm intelligence task assignment Tasks two-stage method |
title | An Efficient Algorithm of Discrete Particle Swarm Optimization for Multi-Objective Task Assignment |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-04T06%3A37%3A04IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=An%20Efficient%20Algorithm%20of%20Discrete%20Particle%20Swarm%20Optimization%20for%20Multi-Objective%20Task%20Assignment&rft.jtitle=IEICE%20Transactions%20on%20Information%20and%20Systems&rft.au=QIAO,%20Nannan&rft.date=2016&rft.volume=E99.D&rft.issue=12&rft.spage=2968&rft.epage=2977&rft.pages=2968-2977&rft.issn=0916-8532&rft.eissn=1745-1361&rft_id=info:doi/10.1587/transinf.2016PAP0032&rft_dat=%3Cproquest_cross%3E1880007403%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1880007403&rft_id=info:pmid/&rfr_iscdi=true |