A Multi-state Gravitational Search Algorithm for Combinatorial Optimization Problems
The binary-based algorithms including the binary gravitational search algorithm (BGSA) were designed to solve discrete optimization problems. Many improvements of the binary-based algorithms have been reported. In this paper, a variant of GSA called multi-state gravitational search algorithm (MSGSA)...
Gespeichert in:
| Veröffentlicht in: | 2015 7th International Conference on Computational Intelligence, Communication Systems and Networks S. 9 - 14 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Tagungsbericht |
| Sprache: | Englisch |
| Veröffentlicht: |
IEEE
01.06.2015
|
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | The binary-based algorithms including the binary gravitational search algorithm (BGSA) were designed to solve discrete optimization problems. Many improvements of the binary-based algorithms have been reported. In this paper, a variant of GSA called multi-state gravitational search algorithm (MSGSA) for discrete optimization problems is proposed. The MSGSA concept is based on a simplified mechanism of transition between two states. The performance of the MSGSA is empirically compared to the original BGSA based on six sets of selected benchmarks instances of traveling salesman problem (TSP). The experimental results show the effectiveness of the newly introduced approach, regarding its ability to consistently outperform the binary-based algorithm in solving the discrete optimization problems. |
|---|---|
| AbstractList | The binary-based algorithms including the binary gravitational search algorithm (BGSA) were designed to solve discrete optimization problems. Many improvements of the binary-based algorithms have been reported. In this paper, a variant of GSA called multi-state gravitational search algorithm (MSGSA) for discrete optimization problems is proposed. The MSGSA concept is based on a simplified mechanism of transition between two states. The performance of the MSGSA is empirically compared to the original BGSA based on six sets of selected benchmarks instances of traveling salesman problem (TSP). The experimental results show the effectiveness of the newly introduced approach, regarding its ability to consistently outperform the binary-based algorithm in solving the discrete optimization problems. |
| Author | Ibrahim, Ismail Ahmad, Hamzah Ibrahim, Zuwairie Yusof, Zulkifli Md |
| Author_xml | – sequence: 1 givenname: Ismail surname: Ibrahim fullname: Ibrahim, Ismail email: pee12001@stdmail.ump.edu.my organization: Univ. Malaysia Pahang, Pekan, Malaysia – sequence: 2 givenname: Zuwairie surname: Ibrahim fullname: Ibrahim, Zuwairie email: zuwairie@ump.edu.my organization: Univ. Malaysia Pahang, Pekan, Malaysia – sequence: 3 givenname: Hamzah surname: Ahmad fullname: Ahmad, Hamzah email: hamzah@ump.edu.my organization: Univ. Malaysia Pahang, Pekan, Malaysia – sequence: 4 givenname: Zulkifli Md surname: Yusof fullname: Yusof, Zulkifli Md email: zmdyusof@ump.edu.my organization: Univ. Malaysia Pahang, Pekan, Malaysia |
| BookMark | eNotjMtOwzAURI0ECyjdsmHjH0jI9SO2l1EEpVKhSC3ryi7X1FISV45BKl9PVFjN6OjM3JDLIQ5IyB1UJUBlHtpluzm9lqwCWQK7IHOjNIhacTURfU22DX356nIoxmwz0kWy32FqIQ62oxu0aX-gTfcZU8iHnvqYaBt7FwabJzQp62MOffg5L-hbiq7DfrwlV952I87_c0benx637XOxWi-WbbMqAiiZC28keKMs9zVHrIGLylc1q1FKy4TVH94ppdzeWyW5cFxwjcZo9M5Jp73gM3L_9xsQcXdMobfptFMcAJjkv6Z2TmE |
| CODEN | IEEPAD |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.1109/CICSyN.2015.12 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP All) 1998-Present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| EISBN | 9781467370158 1467370150 9781467370165 1467370169 |
| EndPage | 14 |
| ExternalDocumentID | 7311125 |
| Genre | orig-research |
| GroupedDBID | 6IE 6IL CBEJK RIE RIL |
| ID | FETCH-LOGICAL-i175t-f951f97a3f63ee61340f0626e55a24a8dfb777bcfa7534b3438e998efbb5b8f43 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 2 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000380448600002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| IngestDate | Thu Jun 29 18:37:19 EDT 2023 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i175t-f951f97a3f63ee61340f0626e55a24a8dfb777bcfa7534b3438e998efbb5b8f43 |
| PageCount | 6 |
| ParticipantIDs | ieee_primary_7311125 |
| PublicationCentury | 2000 |
| PublicationDate | 2015-June |
| PublicationDateYYYYMMDD | 2015-06-01 |
| PublicationDate_xml | – month: 06 year: 2015 text: 2015-June |
| PublicationDecade | 2010 |
| PublicationTitle | 2015 7th International Conference on Computational Intelligence, Communication Systems and Networks |
| PublicationTitleAbbrev | CICSYN |
| PublicationYear | 2015 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| Score | 1.5879332 |
| Snippet | The binary-based algorithms including the binary gravitational search algorithm (BGSA) were designed to solve discrete optimization problems. Many improvements... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 9 |
| SubjectTerms | Algorithm design and analysis Approximation algorithms Benchmark testing Cities and towns discrete combinatorial optimization problem Force gravitational search algorithm Heuristic algorithms multi-state Optimization rule-based travelling salesman problem |
| Title | A Multi-state Gravitational Search Algorithm for Combinatorial Optimization Problems |
| URI | https://ieeexplore.ieee.org/document/7311125 |
| WOSCitedRecordID | wos000380448600002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEB7a4sGTSiu-ycGj266bbGf3WIpVQWrBKr2VZHeihT6kL_DfO8ku1YMXbyGHBCaPmS-Zbz6Aa45owxwlBW33tatMqgKtlQ5izCxFhFb7ap9vT9jvJ6NROqjAzY4LQ0Q--Yyarun_8vNFtnFPZS2UfDKjuApVxHbB1SrrMN6Gaav72H356rtsrbjpBCZ_qaV4Z9E7-N80h9D4Yd2Jwc6fHEGF5nUYdoTnyAae-SPul3pbVtXWU1HkCovO9H3BGP9jJjgCFXzCGe06LM1bSzzzlTAruZZudKces2rAa-9u2H0ISiWEYMLufR1YjoNsilratiRiD6xCGzIUoTjWkdJJbg0imsxqRh_KSCUTYhxF1pjYJFbJY6jNF3M6ASFTStAoIsRc5ZExxklUkXFUSsYadAp1Z5HxZ1HsYlwa4-zv7nPYd_YucqcuoLZebugS9rLterJaXvkV-gZPUJY_ |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEB5qFfSk0opvc_Bo2nWTbXaPpVgt1rVgld5KsjvRQh_SF_jvnewu1YMXbyGHBCaPmS-Zbz6Aa4povVQJ5A33tStNJLnWUvNAJRZ9VFZn1T7fuiqOw8Eg6pXgZsOFQcQs-Qxrrpn95aezZOWeyupK0Mn0gy3YDqT0vZytVVRivPWieqvTevmKXb5WUHMSk7_0UjJ30d7_30QHUP3h3bHexqMcQgmnFeg3WcaS5Rn3h93P9bqoq63HLM8WZs3x-4xQ_seEUQzK6IwT3nVomjYXe6ZLYVKwLd3oTj9mUYXX9l2_9cALLQQ-Ige_5JYiIRspLWxDIJIPlp71CIxgEGhf6jC1RillEqsJf0gjpAiRkBRaYwITWimOoDydTfEYmIgwVEYiKpXK1DfGOJEqNI5MSWgDT6DiLDL8zMtdDAtjnP7dfQW7D_2n7rDbiR_PYM_ZPs-kOofycr7CC9hJ1svRYn6ZrdY3TKKZhg |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2015+7th+International+Conference+on+Computational+Intelligence%2C+Communication+Systems+and+Networks&rft.atitle=A+Multi-state+Gravitational+Search+Algorithm+for+Combinatorial+Optimization+Problems&rft.au=Ibrahim%2C+Ismail&rft.au=Ibrahim%2C+Zuwairie&rft.au=Ahmad%2C+Hamzah&rft.au=Yusof%2C+Zulkifli+Md&rft.date=2015-06-01&rft.pub=IEEE&rft.spage=9&rft.epage=14&rft_id=info:doi/10.1109%2FCICSyN.2015.12&rft.externalDocID=7311125 |