A swarm intelligence approach for the colored traveling salesman problem
Abstract This paper addresses the recently introduced colored traveling salesman problem (CTSP), which is a variant of the multiple traveling salesman problem (MTSP). In the MTSP, given a set of cities, there are multiple salesman to visit these cities though each city must be visited exactly once b...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Pandiri, Venkatesh [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2018 |
|---|
| Schlagwörter: |
Colored traveling salesman problem |
|---|
| Anmerkung: |
© Springer Science+Business Media, LLC, part of Springer Nature 2018 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Applied intelligence - Springer US, 1991, 48(2018), 11 vom: 23. Juni, Seite 4412-4428 |
|---|---|
| Übergeordnetes Werk: |
volume:48 ; year:2018 ; number:11 ; day:23 ; month:06 ; pages:4412-4428 |
| Links: |
|---|
| DOI / URN: |
10.1007/s10489-018-1216-0 |
|---|
| Katalog-ID: |
OLC2066105872 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2066105872 | ||
| 003 | DE-627 | ||
| 005 | 20230502205009.0 | ||
| 007 | tu | ||
| 008 | 200820s2018 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s10489-018-1216-0 |2 doi | |
| 035 | |a (DE-627)OLC2066105872 | ||
| 035 | |a (DE-He213)s10489-018-1216-0-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 004 |q VZ |
| 100 | 1 | |a Pandiri, Venkatesh |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a A swarm intelligence approach for the colored traveling salesman problem |
| 264 | 1 | |c 2018 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © Springer Science+Business Media, LLC, part of Springer Nature 2018 | ||
| 520 | |a Abstract This paper addresses the recently introduced colored traveling salesman problem (CTSP), which is a variant of the multiple traveling salesman problem (MTSP). In the MTSP, given a set of cities, there are multiple salesman to visit these cities though each city must be visited exactly once by one salesman only. On the other hand in case of the CTSP, every salesman have their exclusive cities to visit and a group of shared cities that are shared among different salesmen but should be visited exactly once by one salesman only. In this paper, an artificial bee colony (ABC) algorithm based approach is proposed for the CTSP and its superiority over other state-of-the-art approaches is demonstrated experimentally in terms of both quality of solution and computational time on the benchmark instances available in the literature. In addition, the encoding scheme that we have used to represent a CTSP solution within the ABC algorithm is theoretically analyzed and it is shown that our encoding scheme yields a solution space that is considerably smaller than the scheme used by the state-of-the-art approaches for the CTSP. | ||
| 650 | 4 | |a Traveling salesman | |
| 650 | 4 | |a Colored traveling salesman problem | |
| 650 | 4 | |a Multiple traveling salesman problem | |
| 650 | 4 | |a Artificial bee colony algorithm | |
| 700 | 1 | |a Singh, Alok |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Applied intelligence |d Springer US, 1991 |g 48(2018), 11 vom: 23. Juni, Seite 4412-4428 |w (DE-627)130990515 |w (DE-600)1080229-0 |w (DE-576)029154286 |x 0924-669X |7 nnns |
| 773 | 1 | 8 | |g volume:48 |g year:2018 |g number:11 |g day:23 |g month:06 |g pages:4412-4428 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s10489-018-1216-0 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a GBV_ILN_70 | ||
| 951 | |a AR | ||
| 952 | |d 48 |j 2018 |e 11 |b 23 |c 06 |h 4412-4428 | ||
| author_variant |
v p vp a s as |
|---|---|
| matchkey_str |
article:0924669X:2018----::samnelgneprahoteooetae |
| hierarchy_sort_str |
2018 |
| publishDate |
2018 |
| allfields |
10.1007/s10489-018-1216-0 doi (DE-627)OLC2066105872 (DE-He213)s10489-018-1216-0-p DE-627 ger DE-627 rakwb eng 004 VZ Pandiri, Venkatesh verfasserin aut A swarm intelligence approach for the colored traveling salesman problem 2018 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC, part of Springer Nature 2018 Abstract This paper addresses the recently introduced colored traveling salesman problem (CTSP), which is a variant of the multiple traveling salesman problem (MTSP). In the MTSP, given a set of cities, there are multiple salesman to visit these cities though each city must be visited exactly once by one salesman only. On the other hand in case of the CTSP, every salesman have their exclusive cities to visit and a group of shared cities that are shared among different salesmen but should be visited exactly once by one salesman only. In this paper, an artificial bee colony (ABC) algorithm based approach is proposed for the CTSP and its superiority over other state-of-the-art approaches is demonstrated experimentally in terms of both quality of solution and computational time on the benchmark instances available in the literature. In addition, the encoding scheme that we have used to represent a CTSP solution within the ABC algorithm is theoretically analyzed and it is shown that our encoding scheme yields a solution space that is considerably smaller than the scheme used by the state-of-the-art approaches for the CTSP. Traveling salesman Colored traveling salesman problem Multiple traveling salesman problem Artificial bee colony algorithm Singh, Alok aut Enthalten in Applied intelligence Springer US, 1991 48(2018), 11 vom: 23. Juni, Seite 4412-4428 (DE-627)130990515 (DE-600)1080229-0 (DE-576)029154286 0924-669X nnns volume:48 year:2018 number:11 day:23 month:06 pages:4412-4428 https://doi.org/10.1007/s10489-018-1216-0 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 AR 48 2018 11 23 06 4412-4428 |
| spelling |
10.1007/s10489-018-1216-0 doi (DE-627)OLC2066105872 (DE-He213)s10489-018-1216-0-p DE-627 ger DE-627 rakwb eng 004 VZ Pandiri, Venkatesh verfasserin aut A swarm intelligence approach for the colored traveling salesman problem 2018 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC, part of Springer Nature 2018 Abstract This paper addresses the recently introduced colored traveling salesman problem (CTSP), which is a variant of the multiple traveling salesman problem (MTSP). In the MTSP, given a set of cities, there are multiple salesman to visit these cities though each city must be visited exactly once by one salesman only. On the other hand in case of the CTSP, every salesman have their exclusive cities to visit and a group of shared cities that are shared among different salesmen but should be visited exactly once by one salesman only. In this paper, an artificial bee colony (ABC) algorithm based approach is proposed for the CTSP and its superiority over other state-of-the-art approaches is demonstrated experimentally in terms of both quality of solution and computational time on the benchmark instances available in the literature. In addition, the encoding scheme that we have used to represent a CTSP solution within the ABC algorithm is theoretically analyzed and it is shown that our encoding scheme yields a solution space that is considerably smaller than the scheme used by the state-of-the-art approaches for the CTSP. Traveling salesman Colored traveling salesman problem Multiple traveling salesman problem Artificial bee colony algorithm Singh, Alok aut Enthalten in Applied intelligence Springer US, 1991 48(2018), 11 vom: 23. Juni, Seite 4412-4428 (DE-627)130990515 (DE-600)1080229-0 (DE-576)029154286 0924-669X nnns volume:48 year:2018 number:11 day:23 month:06 pages:4412-4428 https://doi.org/10.1007/s10489-018-1216-0 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 AR 48 2018 11 23 06 4412-4428 |
| allfields_unstemmed |
10.1007/s10489-018-1216-0 doi (DE-627)OLC2066105872 (DE-He213)s10489-018-1216-0-p DE-627 ger DE-627 rakwb eng 004 VZ Pandiri, Venkatesh verfasserin aut A swarm intelligence approach for the colored traveling salesman problem 2018 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC, part of Springer Nature 2018 Abstract This paper addresses the recently introduced colored traveling salesman problem (CTSP), which is a variant of the multiple traveling salesman problem (MTSP). In the MTSP, given a set of cities, there are multiple salesman to visit these cities though each city must be visited exactly once by one salesman only. On the other hand in case of the CTSP, every salesman have their exclusive cities to visit and a group of shared cities that are shared among different salesmen but should be visited exactly once by one salesman only. In this paper, an artificial bee colony (ABC) algorithm based approach is proposed for the CTSP and its superiority over other state-of-the-art approaches is demonstrated experimentally in terms of both quality of solution and computational time on the benchmark instances available in the literature. In addition, the encoding scheme that we have used to represent a CTSP solution within the ABC algorithm is theoretically analyzed and it is shown that our encoding scheme yields a solution space that is considerably smaller than the scheme used by the state-of-the-art approaches for the CTSP. Traveling salesman Colored traveling salesman problem Multiple traveling salesman problem Artificial bee colony algorithm Singh, Alok aut Enthalten in Applied intelligence Springer US, 1991 48(2018), 11 vom: 23. Juni, Seite 4412-4428 (DE-627)130990515 (DE-600)1080229-0 (DE-576)029154286 0924-669X nnns volume:48 year:2018 number:11 day:23 month:06 pages:4412-4428 https://doi.org/10.1007/s10489-018-1216-0 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 AR 48 2018 11 23 06 4412-4428 |
| allfieldsGer |
10.1007/s10489-018-1216-0 doi (DE-627)OLC2066105872 (DE-He213)s10489-018-1216-0-p DE-627 ger DE-627 rakwb eng 004 VZ Pandiri, Venkatesh verfasserin aut A swarm intelligence approach for the colored traveling salesman problem 2018 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC, part of Springer Nature 2018 Abstract This paper addresses the recently introduced colored traveling salesman problem (CTSP), which is a variant of the multiple traveling salesman problem (MTSP). In the MTSP, given a set of cities, there are multiple salesman to visit these cities though each city must be visited exactly once by one salesman only. On the other hand in case of the CTSP, every salesman have their exclusive cities to visit and a group of shared cities that are shared among different salesmen but should be visited exactly once by one salesman only. In this paper, an artificial bee colony (ABC) algorithm based approach is proposed for the CTSP and its superiority over other state-of-the-art approaches is demonstrated experimentally in terms of both quality of solution and computational time on the benchmark instances available in the literature. In addition, the encoding scheme that we have used to represent a CTSP solution within the ABC algorithm is theoretically analyzed and it is shown that our encoding scheme yields a solution space that is considerably smaller than the scheme used by the state-of-the-art approaches for the CTSP. Traveling salesman Colored traveling salesman problem Multiple traveling salesman problem Artificial bee colony algorithm Singh, Alok aut Enthalten in Applied intelligence Springer US, 1991 48(2018), 11 vom: 23. Juni, Seite 4412-4428 (DE-627)130990515 (DE-600)1080229-0 (DE-576)029154286 0924-669X nnns volume:48 year:2018 number:11 day:23 month:06 pages:4412-4428 https://doi.org/10.1007/s10489-018-1216-0 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 AR 48 2018 11 23 06 4412-4428 |
| allfieldsSound |
10.1007/s10489-018-1216-0 doi (DE-627)OLC2066105872 (DE-He213)s10489-018-1216-0-p DE-627 ger DE-627 rakwb eng 004 VZ Pandiri, Venkatesh verfasserin aut A swarm intelligence approach for the colored traveling salesman problem 2018 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC, part of Springer Nature 2018 Abstract This paper addresses the recently introduced colored traveling salesman problem (CTSP), which is a variant of the multiple traveling salesman problem (MTSP). In the MTSP, given a set of cities, there are multiple salesman to visit these cities though each city must be visited exactly once by one salesman only. On the other hand in case of the CTSP, every salesman have their exclusive cities to visit and a group of shared cities that are shared among different salesmen but should be visited exactly once by one salesman only. In this paper, an artificial bee colony (ABC) algorithm based approach is proposed for the CTSP and its superiority over other state-of-the-art approaches is demonstrated experimentally in terms of both quality of solution and computational time on the benchmark instances available in the literature. In addition, the encoding scheme that we have used to represent a CTSP solution within the ABC algorithm is theoretically analyzed and it is shown that our encoding scheme yields a solution space that is considerably smaller than the scheme used by the state-of-the-art approaches for the CTSP. Traveling salesman Colored traveling salesman problem Multiple traveling salesman problem Artificial bee colony algorithm Singh, Alok aut Enthalten in Applied intelligence Springer US, 1991 48(2018), 11 vom: 23. Juni, Seite 4412-4428 (DE-627)130990515 (DE-600)1080229-0 (DE-576)029154286 0924-669X nnns volume:48 year:2018 number:11 day:23 month:06 pages:4412-4428 https://doi.org/10.1007/s10489-018-1216-0 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 AR 48 2018 11 23 06 4412-4428 |
| language |
English |
| source |
Enthalten in Applied intelligence 48(2018), 11 vom: 23. Juni, Seite 4412-4428 volume:48 year:2018 number:11 day:23 month:06 pages:4412-4428 |
| sourceStr |
Enthalten in Applied intelligence 48(2018), 11 vom: 23. Juni, Seite 4412-4428 volume:48 year:2018 number:11 day:23 month:06 pages:4412-4428 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Traveling salesman Colored traveling salesman problem Multiple traveling salesman problem Artificial bee colony algorithm |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
Applied intelligence |
| authorswithroles_txt_mv |
Pandiri, Venkatesh @@aut@@ Singh, Alok @@aut@@ |
| publishDateDaySort_date |
2018-06-23T00:00:00Z |
| hierarchy_top_id |
130990515 |
| dewey-sort |
14 |
| id |
OLC2066105872 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2066105872</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230502205009.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200820s2018 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10489-018-1216-0</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2066105872</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10489-018-1216-0-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Pandiri, Venkatesh</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A swarm intelligence approach for the colored traveling salesman problem</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2018</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science+Business Media, LLC, part of Springer Nature 2018</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract This paper addresses the recently introduced colored traveling salesman problem (CTSP), which is a variant of the multiple traveling salesman problem (MTSP). In the MTSP, given a set of cities, there are multiple salesman to visit these cities though each city must be visited exactly once by one salesman only. On the other hand in case of the CTSP, every salesman have their exclusive cities to visit and a group of shared cities that are shared among different salesmen but should be visited exactly once by one salesman only. In this paper, an artificial bee colony (ABC) algorithm based approach is proposed for the CTSP and its superiority over other state-of-the-art approaches is demonstrated experimentally in terms of both quality of solution and computational time on the benchmark instances available in the literature. In addition, the encoding scheme that we have used to represent a CTSP solution within the ABC algorithm is theoretically analyzed and it is shown that our encoding scheme yields a solution space that is considerably smaller than the scheme used by the state-of-the-art approaches for the CTSP.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Traveling salesman</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Colored traveling salesman problem</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Multiple traveling salesman problem</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Artificial bee colony algorithm</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Singh, Alok</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Applied intelligence</subfield><subfield code="d">Springer US, 1991</subfield><subfield code="g">48(2018), 11 vom: 23. Juni, Seite 4412-4428</subfield><subfield code="w">(DE-627)130990515</subfield><subfield code="w">(DE-600)1080229-0</subfield><subfield code="w">(DE-576)029154286</subfield><subfield code="x">0924-669X</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:48</subfield><subfield code="g">year:2018</subfield><subfield code="g">number:11</subfield><subfield code="g">day:23</subfield><subfield code="g">month:06</subfield><subfield code="g">pages:4412-4428</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10489-018-1216-0</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">48</subfield><subfield code="j">2018</subfield><subfield code="e">11</subfield><subfield code="b">23</subfield><subfield code="c">06</subfield><subfield code="h">4412-4428</subfield></datafield></record></collection>
|
| author |
Pandiri, Venkatesh |
| spellingShingle |
Pandiri, Venkatesh ddc 004 misc Traveling salesman misc Colored traveling salesman problem misc Multiple traveling salesman problem misc Artificial bee colony algorithm A swarm intelligence approach for the colored traveling salesman problem |
| authorStr |
Pandiri, Venkatesh |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)130990515 |
| format |
Article |
| dewey-ones |
004 - Data processing & computer science |
| delete_txt_mv |
keep |
| author_role |
aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0924-669X |
| topic_title |
004 VZ A swarm intelligence approach for the colored traveling salesman problem Traveling salesman Colored traveling salesman problem Multiple traveling salesman problem Artificial bee colony algorithm |
| topic |
ddc 004 misc Traveling salesman misc Colored traveling salesman problem misc Multiple traveling salesman problem misc Artificial bee colony algorithm |
| topic_unstemmed |
ddc 004 misc Traveling salesman misc Colored traveling salesman problem misc Multiple traveling salesman problem misc Artificial bee colony algorithm |
| topic_browse |
ddc 004 misc Traveling salesman misc Colored traveling salesman problem misc Multiple traveling salesman problem misc Artificial bee colony algorithm |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Applied intelligence |
| hierarchy_parent_id |
130990515 |
| dewey-tens |
000 - Computer science, knowledge & systems |
| hierarchy_top_title |
Applied intelligence |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)130990515 (DE-600)1080229-0 (DE-576)029154286 |
| title |
A swarm intelligence approach for the colored traveling salesman problem |
| ctrlnum |
(DE-627)OLC2066105872 (DE-He213)s10489-018-1216-0-p |
| title_full |
A swarm intelligence approach for the colored traveling salesman problem |
| author_sort |
Pandiri, Venkatesh |
| journal |
Applied intelligence |
| journalStr |
Applied intelligence |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works |
| recordtype |
marc |
| publishDateSort |
2018 |
| contenttype_str_mv |
txt |
| container_start_page |
4412 |
| author_browse |
Pandiri, Venkatesh Singh, Alok |
| container_volume |
48 |
| class |
004 VZ |
| format_se |
Aufsätze |
| author-letter |
Pandiri, Venkatesh |
| doi_str_mv |
10.1007/s10489-018-1216-0 |
| dewey-full |
004 |
| title_sort |
a swarm intelligence approach for the colored traveling salesman problem |
| title_auth |
A swarm intelligence approach for the colored traveling salesman problem |
| abstract |
Abstract This paper addresses the recently introduced colored traveling salesman problem (CTSP), which is a variant of the multiple traveling salesman problem (MTSP). In the MTSP, given a set of cities, there are multiple salesman to visit these cities though each city must be visited exactly once by one salesman only. On the other hand in case of the CTSP, every salesman have their exclusive cities to visit and a group of shared cities that are shared among different salesmen but should be visited exactly once by one salesman only. In this paper, an artificial bee colony (ABC) algorithm based approach is proposed for the CTSP and its superiority over other state-of-the-art approaches is demonstrated experimentally in terms of both quality of solution and computational time on the benchmark instances available in the literature. In addition, the encoding scheme that we have used to represent a CTSP solution within the ABC algorithm is theoretically analyzed and it is shown that our encoding scheme yields a solution space that is considerably smaller than the scheme used by the state-of-the-art approaches for the CTSP. © Springer Science+Business Media, LLC, part of Springer Nature 2018 |
| abstractGer |
Abstract This paper addresses the recently introduced colored traveling salesman problem (CTSP), which is a variant of the multiple traveling salesman problem (MTSP). In the MTSP, given a set of cities, there are multiple salesman to visit these cities though each city must be visited exactly once by one salesman only. On the other hand in case of the CTSP, every salesman have their exclusive cities to visit and a group of shared cities that are shared among different salesmen but should be visited exactly once by one salesman only. In this paper, an artificial bee colony (ABC) algorithm based approach is proposed for the CTSP and its superiority over other state-of-the-art approaches is demonstrated experimentally in terms of both quality of solution and computational time on the benchmark instances available in the literature. In addition, the encoding scheme that we have used to represent a CTSP solution within the ABC algorithm is theoretically analyzed and it is shown that our encoding scheme yields a solution space that is considerably smaller than the scheme used by the state-of-the-art approaches for the CTSP. © Springer Science+Business Media, LLC, part of Springer Nature 2018 |
| abstract_unstemmed |
Abstract This paper addresses the recently introduced colored traveling salesman problem (CTSP), which is a variant of the multiple traveling salesman problem (MTSP). In the MTSP, given a set of cities, there are multiple salesman to visit these cities though each city must be visited exactly once by one salesman only. On the other hand in case of the CTSP, every salesman have their exclusive cities to visit and a group of shared cities that are shared among different salesmen but should be visited exactly once by one salesman only. In this paper, an artificial bee colony (ABC) algorithm based approach is proposed for the CTSP and its superiority over other state-of-the-art approaches is demonstrated experimentally in terms of both quality of solution and computational time on the benchmark instances available in the literature. In addition, the encoding scheme that we have used to represent a CTSP solution within the ABC algorithm is theoretically analyzed and it is shown that our encoding scheme yields a solution space that is considerably smaller than the scheme used by the state-of-the-art approaches for the CTSP. © Springer Science+Business Media, LLC, part of Springer Nature 2018 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 |
| container_issue |
11 |
| title_short |
A swarm intelligence approach for the colored traveling salesman problem |
| url |
https://doi.org/10.1007/s10489-018-1216-0 |
| remote_bool |
false |
| author2 |
Singh, Alok |
| author2Str |
Singh, Alok |
| ppnlink |
130990515 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s10489-018-1216-0 |
| up_date |
2024-07-04T03:46:43.891Z |
| _version_ |
1803618671822635008 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2066105872</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230502205009.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200820s2018 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10489-018-1216-0</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2066105872</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10489-018-1216-0-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Pandiri, Venkatesh</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A swarm intelligence approach for the colored traveling salesman problem</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2018</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science+Business Media, LLC, part of Springer Nature 2018</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract This paper addresses the recently introduced colored traveling salesman problem (CTSP), which is a variant of the multiple traveling salesman problem (MTSP). In the MTSP, given a set of cities, there are multiple salesman to visit these cities though each city must be visited exactly once by one salesman only. On the other hand in case of the CTSP, every salesman have their exclusive cities to visit and a group of shared cities that are shared among different salesmen but should be visited exactly once by one salesman only. In this paper, an artificial bee colony (ABC) algorithm based approach is proposed for the CTSP and its superiority over other state-of-the-art approaches is demonstrated experimentally in terms of both quality of solution and computational time on the benchmark instances available in the literature. In addition, the encoding scheme that we have used to represent a CTSP solution within the ABC algorithm is theoretically analyzed and it is shown that our encoding scheme yields a solution space that is considerably smaller than the scheme used by the state-of-the-art approaches for the CTSP.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Traveling salesman</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Colored traveling salesman problem</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Multiple traveling salesman problem</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Artificial bee colony algorithm</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Singh, Alok</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Applied intelligence</subfield><subfield code="d">Springer US, 1991</subfield><subfield code="g">48(2018), 11 vom: 23. Juni, Seite 4412-4428</subfield><subfield code="w">(DE-627)130990515</subfield><subfield code="w">(DE-600)1080229-0</subfield><subfield code="w">(DE-576)029154286</subfield><subfield code="x">0924-669X</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:48</subfield><subfield code="g">year:2018</subfield><subfield code="g">number:11</subfield><subfield code="g">day:23</subfield><subfield code="g">month:06</subfield><subfield code="g">pages:4412-4428</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10489-018-1216-0</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">48</subfield><subfield code="j">2018</subfield><subfield code="e">11</subfield><subfield code="b">23</subfield><subfield code="c">06</subfield><subfield code="h">4412-4428</subfield></datafield></record></collection>
|
| score |
7.39775 |