Adapting TRIBES algorithm for Traveling Salesman Problem

Metaheuristics constitute an important alternative in solving NP-Hard combinatorial optimization problems. Unfortunately, many parameters have to be tuned for any metaheuristic, and their values may have a great influence on the efficiency and effectiveness of the search. The exploration of an optim...

Full description

Saved in:
Bibliographic Details
Main Authors: Daoudi, M., Boukra, A., Ahmed-Nacer, M.
Format: Conference Proceeding
Language:English
Subjects:
Branch and Bound
Cities and towns
Combinatorial Optimization Problem
Gaussian distribution
Genetic Algorithm
Genetic algorithms
Metaheuristic
NP-Hard problems
Optimization
Particle swarm optimization
Search problems
Traveler Salesman Problem
Traveling salesman problems
TRIBES
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 168
container_issue
container_start_page 163
container_title
container_volume
creator Daoudi, M.
Boukra, A.
Ahmed-Nacer, M.
description Metaheuristics constitute an important alternative in solving NP-Hard combinatorial optimization problems. Unfortunately, many parameters have to be tuned for any metaheuristic, and their values may have a great influence on the efficiency and effectiveness of the search. The exploration of an optimal combination of such values may be difficult and big time consuming. Clerc et al have defined a parameter-free algorithm for PSO (Particle Swarm Optimization), called TRIBES. In this paper, we propose to adapt TRIBES to solve discrete problems. To highlight our approach, we treat of the well-known NP-Hard Traveling Salesman Problem (TSP) problem. Modifications in different mechanisms and formulae adaptations are made, like in the generation process of the particles and in the displacement strategies. The experimentations results show the good behavior of the "Adapted TRIBES". Comparison is made with a basic genetic algorithm, and with a branch and bound method.
doi_str_mv 10.1109/ISPS.2011.5898889
format conference_proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_5898889</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5898889</ieee_id><sourcerecordid>5898889</sourcerecordid><originalsourceid>FETCH-LOGICAL-i90t-bb34579dcd585f4b9651615684bd209f63841adde7f7b9f72aa7c00971f31bf03</originalsourceid><addsrcrecordid>eNo1j91Kw0AUhFekoLZ5APEmL5B4TpL9OZe1VA0ULCb3Zbe7W1eSpmyC4Ntbsc7NMHwwwzB2j5AjAj3WzbbJC0DMuSKlFF2xO6y4lEAgq2uWkFT_mcMNS8bxE84SgniBt0wtrT5N4XhI2_f6ad2kujsMMUwffeqHmLZRf7nuFze6c2Ovj-k2DqZz_YLNvO5Gl1x8ztrndbt6zTZvL_VquckCwZQZU57Hye4tV9xXhgRHgVyoytgCyItSVaitddJLQ14WWss9AEn0JRoP5Zw9_NUG59zuFEOv4_fu8rX8AXSfRqM</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Adapting TRIBES algorithm for Traveling Salesman Problem</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Daoudi, M. ; Boukra, A. ; Ahmed-Nacer, M.</creator><creatorcontrib>Daoudi, M. ; Boukra, A. ; Ahmed-Nacer, M.</creatorcontrib><description>Metaheuristics constitute an important alternative in solving NP-Hard combinatorial optimization problems. Unfortunately, many parameters have to be tuned for any metaheuristic, and their values may have a great influence on the efficiency and effectiveness of the search. The exploration of an optimal combination of such values may be difficult and big time consuming. Clerc et al have defined a parameter-free algorithm for PSO (Particle Swarm Optimization), called TRIBES. In this paper, we propose to adapt TRIBES to solve discrete problems. To highlight our approach, we treat of the well-known NP-Hard Traveling Salesman Problem (TSP) problem. Modifications in different mechanisms and formulae adaptations are made, like in the generation process of the particles and in the displacement strategies. The experimentations results show the good behavior of the "Adapted TRIBES". Comparison is made with a basic genetic algorithm, and with a branch and bound method.</description><identifier>ISBN: 9781457709050</identifier><identifier>ISBN: 1457709058</identifier><identifier>EISBN: 1457709074</identifier><identifier>EISBN: 9781457709081</identifier><identifier>EISBN: 1457709082</identifier><identifier>EISBN: 9781457709074</identifier><identifier>DOI: 10.1109/ISPS.2011.5898889</identifier><language>eng</language><publisher>IEEE</publisher><subject>Branch and Bound ; Cities and towns ; Combinatorial Optimization Problem ; Gaussian distribution ; Genetic Algorithm ; Genetic algorithms ; Metaheuristic ; NP-Hard problems ; Optimization ; Particle swarm optimization ; Search problems ; Traveler Salesman Problem ; Traveling salesman problems ; TRIBES</subject><ispartof>2011 10th International Symposium on Programming and Systems, 2011, p.163-168</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5898889$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>310,311,786,790,795,796,2071,27958,55271</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5898889$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Daoudi, M.</creatorcontrib><creatorcontrib>Boukra, A.</creatorcontrib><creatorcontrib>Ahmed-Nacer, M.</creatorcontrib><title>Adapting TRIBES algorithm for Traveling Salesman Problem</title><title>2011 10th International Symposium on Programming and Systems</title><addtitle>ISPS</addtitle><description>Metaheuristics constitute an important alternative in solving NP-Hard combinatorial optimization problems. Unfortunately, many parameters have to be tuned for any metaheuristic, and their values may have a great influence on the efficiency and effectiveness of the search. The exploration of an optimal combination of such values may be difficult and big time consuming. Clerc et al have defined a parameter-free algorithm for PSO (Particle Swarm Optimization), called TRIBES. In this paper, we propose to adapt TRIBES to solve discrete problems. To highlight our approach, we treat of the well-known NP-Hard Traveling Salesman Problem (TSP) problem. Modifications in different mechanisms and formulae adaptations are made, like in the generation process of the particles and in the displacement strategies. The experimentations results show the good behavior of the "Adapted TRIBES". Comparison is made with a basic genetic algorithm, and with a branch and bound method.</description><subject>Branch and Bound</subject><subject>Cities and towns</subject><subject>Combinatorial Optimization Problem</subject><subject>Gaussian distribution</subject><subject>Genetic Algorithm</subject><subject>Genetic algorithms</subject><subject>Metaheuristic</subject><subject>NP-Hard problems</subject><subject>Optimization</subject><subject>Particle swarm optimization</subject><subject>Search problems</subject><subject>Traveler Salesman Problem</subject><subject>Traveling salesman problems</subject><subject>TRIBES</subject><isbn>9781457709050</isbn><isbn>1457709058</isbn><isbn>1457709074</isbn><isbn>9781457709081</isbn><isbn>1457709082</isbn><isbn>9781457709074</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2011</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNo1j91Kw0AUhFekoLZ5APEmL5B4TpL9OZe1VA0ULCb3Zbe7W1eSpmyC4Ntbsc7NMHwwwzB2j5AjAj3WzbbJC0DMuSKlFF2xO6y4lEAgq2uWkFT_mcMNS8bxE84SgniBt0wtrT5N4XhI2_f6ad2kujsMMUwffeqHmLZRf7nuFze6c2Ovj-k2DqZz_YLNvO5Gl1x8ztrndbt6zTZvL_VquckCwZQZU57Hye4tV9xXhgRHgVyoytgCyItSVaitddJLQ14WWss9AEn0JRoP5Zw9_NUG59zuFEOv4_fu8rX8AXSfRqM</recordid><startdate>201104</startdate><enddate>201104</enddate><creator>Daoudi, M.</creator><creator>Boukra, A.</creator><creator>Ahmed-Nacer, M.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201104</creationdate><title>Adapting TRIBES algorithm for Traveling Salesman Problem</title><author>Daoudi, M. ; Boukra, A. ; Ahmed-Nacer, M.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i90t-bb34579dcd585f4b9651615684bd209f63841adde7f7b9f72aa7c00971f31bf03</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Branch and Bound</topic><topic>Cities and towns</topic><topic>Combinatorial Optimization Problem</topic><topic>Gaussian distribution</topic><topic>Genetic Algorithm</topic><topic>Genetic algorithms</topic><topic>Metaheuristic</topic><topic>NP-Hard problems</topic><topic>Optimization</topic><topic>Particle swarm optimization</topic><topic>Search problems</topic><topic>Traveler Salesman Problem</topic><topic>Traveling salesman problems</topic><topic>TRIBES</topic><toplevel>online_resources</toplevel><creatorcontrib>Daoudi, M.</creatorcontrib><creatorcontrib>Boukra, A.</creatorcontrib><creatorcontrib>Ahmed-Nacer, M.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Explore</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Daoudi, M.</au><au>Boukra, A.</au><au>Ahmed-Nacer, M.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Adapting TRIBES algorithm for Traveling Salesman Problem</atitle><btitle>2011 10th International Symposium on Programming and Systems</btitle><stitle>ISPS</stitle><date>2011-04</date><risdate>2011</risdate><spage>163</spage><epage>168</epage><pages>163-168</pages><isbn>9781457709050</isbn><isbn>1457709058</isbn><eisbn>1457709074</eisbn><eisbn>9781457709081</eisbn><eisbn>1457709082</eisbn><eisbn>9781457709074</eisbn><abstract>Metaheuristics constitute an important alternative in solving NP-Hard combinatorial optimization problems. Unfortunately, many parameters have to be tuned for any metaheuristic, and their values may have a great influence on the efficiency and effectiveness of the search. The exploration of an optimal combination of such values may be difficult and big time consuming. Clerc et al have defined a parameter-free algorithm for PSO (Particle Swarm Optimization), called TRIBES. In this paper, we propose to adapt TRIBES to solve discrete problems. To highlight our approach, we treat of the well-known NP-Hard Traveling Salesman Problem (TSP) problem. Modifications in different mechanisms and formulae adaptations are made, like in the generation process of the particles and in the displacement strategies. The experimentations results show the good behavior of the "Adapted TRIBES". Comparison is made with a basic genetic algorithm, and with a branch and bound method.</abstract><pub>IEEE</pub><doi>10.1109/ISPS.2011.5898889</doi><tpages>6</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISBN: 9781457709050
ispartof 2011 10th International Symposium on Programming and Systems, 2011, p.163-168
issn
language eng
recordid cdi_ieee_primary_5898889
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Branch and Bound
Cities and towns
Combinatorial Optimization Problem
Gaussian distribution
Genetic Algorithm
Genetic algorithms
Metaheuristic
NP-Hard problems
Optimization
Particle swarm optimization
Search problems
Traveler Salesman Problem
Traveling salesman problems
TRIBES
title Adapting TRIBES algorithm for Traveling Salesman Problem
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-09-22T05%3A29%3A09IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Adapting%20TRIBES%20algorithm%20for%20Traveling%20Salesman%20Problem&rft.btitle=2011%2010th%20International%20Symposium%20on%20Programming%20and%20Systems&rft.au=Daoudi,%20M.&rft.date=2011-04&rft.spage=163&rft.epage=168&rft.pages=163-168&rft.isbn=9781457709050&rft.isbn_list=1457709058&rft_id=info:doi/10.1109/ISPS.2011.5898889&rft.eisbn=1457709074&rft.eisbn_list=9781457709081&rft.eisbn_list=1457709082&rft.eisbn_list=9781457709074&rft_dat=%3Cieee_6IE%3E5898889%3C/ieee_6IE%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i90t-bb34579dcd585f4b9651615684bd209f63841adde7f7b9f72aa7c00971f31bf03%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5898889&rfr_iscdi=true