The multicommodity traveling salesman problem with priority prizes: a mathematical model and metaheuristics
The classic Traveling Salesman Problem (TSP) only considers the costs involved in the routes and does not differentiate products or customers. Logistic companies face conflict between operational costs, customers with different categories of products, and customer satisfaction, which is directly rel...
Gespeichert in:
| Veröffentlicht in: | Computational & applied mathematics 2019-12, Vol.38 (4), p.1-25, Article 188 |
|---|---|
| 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 | 25 |
|---|---|
| container_issue | 4 |
| container_start_page | 1 |
| container_title | Computational & applied mathematics |
| container_volume | 38 |
| creator | da Silva, Tiago Tiburcio Chaves, Antônio Augusto Yanasse, Horacio Hideki Luna, Henrique Pacca Loureiro |
| description | The classic Traveling Salesman Problem (TSP) only considers the costs involved in the routes and does not differentiate products or customers. Logistic companies face conflict between operational costs, customers with different categories of products, and customer satisfaction, which is directly related to delivery time. This paper presents a new mathematical model for a TSP with variable costs and priority prizes, taking into account the customer’s product and preference values. This problem is denoted as the Multicommodity Traveling Salesman Problem with Priority Prizes (MTSPPP). Two versions of the Biased Random-Key Genetic Algorithm (BRKGA) are proposed to solve medium and large instances of the MTSPPP. Computational tests were performed, using modified instances based on classical TSP instances. The proposed methods have proved to be efficient in solving the MTSPPP. |
| doi_str_mv | 10.1007/s40314-019-0976-4 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2303810243</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2303810243</sourcerecordid><originalsourceid>FETCH-LOGICAL-c359t-27b97001b165810b9f2ba8a649b83c9660ac1276ff19d4ef632ba4ab3a2963963</originalsourceid><addsrcrecordid>eNp1UE1LxDAQDaLguvoDvAU8RycfmzbeZPELFrys55B2023WptUkVdZfb5YKnoRhJsO89zLzELqkcE0BipsogFNBgCoCqpBEHKEZLaEgwIEdoxljvCRcAj9FZzHuAHhBhZiht3VrsR-75OrB-2Hj0h6nYD5t5_otjqaz0Zsev4eh6qzHXy61uXFDOADz49vGW2ywN6m1ObnadDjL2A6bfoO9Taa1Y3AxT-I5OmlMF-3Fb52j14f79fKJrF4en5d3K1LzhUqEFZUqAGhF5aKkUKmGVaY0Uqiq5LWSEkxNWSGbhqqNsI3keS5MxQ1TkueYo6tJN2_9MdqY9G4YQ5-_1IwDz5pM8IyiE6oOQ4zBNjqf403Yawr64KmePNXZU33wVIvMYRMnZmy_teFP-X_SD6lQexM</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2303810243</pqid></control><display><type>article</type><title>The multicommodity traveling salesman problem with priority prizes: a mathematical model and metaheuristics</title><source>Springer Nature - Complete Springer Journals</source><creator>da Silva, Tiago Tiburcio ; Chaves, Antônio Augusto ; Yanasse, Horacio Hideki ; Luna, Henrique Pacca Loureiro</creator><creatorcontrib>da Silva, Tiago Tiburcio ; Chaves, Antônio Augusto ; Yanasse, Horacio Hideki ; Luna, Henrique Pacca Loureiro</creatorcontrib><description>The classic Traveling Salesman Problem (TSP) only considers the costs involved in the routes and does not differentiate products or customers. Logistic companies face conflict between operational costs, customers with different categories of products, and customer satisfaction, which is directly related to delivery time. This paper presents a new mathematical model for a TSP with variable costs and priority prizes, taking into account the customer’s product and preference values. This problem is denoted as the Multicommodity Traveling Salesman Problem with Priority Prizes (MTSPPP). Two versions of the Biased Random-Key Genetic Algorithm (BRKGA) are proposed to solve medium and large instances of the MTSPPP. Computational tests were performed, using modified instances based on classical TSP instances. The proposed methods have proved to be efficient in solving the MTSPPP.</description><identifier>ISSN: 2238-3603</identifier><identifier>EISSN: 1807-0302</identifier><identifier>DOI: 10.1007/s40314-019-0976-4</identifier><language>eng</language><publisher>Cham: Springer International Publishing</publisher><subject>Applications of Mathematics ; Applied physics ; Computational mathematics ; Computational Mathematics and Numerical Analysis ; Customer satisfaction ; Genetic algorithms ; Mathematical analysis ; Mathematical Applications in Computer Science ; Mathematical Applications in the Physical Sciences ; Mathematical models ; Mathematics ; Mathematics and Statistics ; Operating costs ; Product differentiation ; Traveling salesman problem</subject><ispartof>Computational & applied mathematics, 2019-12, Vol.38 (4), p.1-25, Article 188</ispartof><rights>SBMAC - Sociedade Brasileira de Matemática Aplicada e Computacional 2019</rights><rights>Copyright Springer Nature B.V. 2019</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c359t-27b97001b165810b9f2ba8a649b83c9660ac1276ff19d4ef632ba4ab3a2963963</citedby><cites>FETCH-LOGICAL-c359t-27b97001b165810b9f2ba8a649b83c9660ac1276ff19d4ef632ba4ab3a2963963</cites><orcidid>0000-0002-0700-3445</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s40314-019-0976-4$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s40314-019-0976-4$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,776,780,27903,27904,41467,42536,51297</link.rule.ids></links><search><creatorcontrib>da Silva, Tiago Tiburcio</creatorcontrib><creatorcontrib>Chaves, Antônio Augusto</creatorcontrib><creatorcontrib>Yanasse, Horacio Hideki</creatorcontrib><creatorcontrib>Luna, Henrique Pacca Loureiro</creatorcontrib><title>The multicommodity traveling salesman problem with priority prizes: a mathematical model and metaheuristics</title><title>Computational & applied mathematics</title><addtitle>Comp. Appl. Math</addtitle><description>The classic Traveling Salesman Problem (TSP) only considers the costs involved in the routes and does not differentiate products or customers. Logistic companies face conflict between operational costs, customers with different categories of products, and customer satisfaction, which is directly related to delivery time. This paper presents a new mathematical model for a TSP with variable costs and priority prizes, taking into account the customer’s product and preference values. This problem is denoted as the Multicommodity Traveling Salesman Problem with Priority Prizes (MTSPPP). Two versions of the Biased Random-Key Genetic Algorithm (BRKGA) are proposed to solve medium and large instances of the MTSPPP. Computational tests were performed, using modified instances based on classical TSP instances. The proposed methods have proved to be efficient in solving the MTSPPP.</description><subject>Applications of Mathematics</subject><subject>Applied physics</subject><subject>Computational mathematics</subject><subject>Computational Mathematics and Numerical Analysis</subject><subject>Customer satisfaction</subject><subject>Genetic algorithms</subject><subject>Mathematical analysis</subject><subject>Mathematical Applications in Computer Science</subject><subject>Mathematical Applications in the Physical Sciences</subject><subject>Mathematical models</subject><subject>Mathematics</subject><subject>Mathematics and Statistics</subject><subject>Operating costs</subject><subject>Product differentiation</subject><subject>Traveling salesman problem</subject><issn>2238-3603</issn><issn>1807-0302</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><recordid>eNp1UE1LxDAQDaLguvoDvAU8RycfmzbeZPELFrys55B2023WptUkVdZfb5YKnoRhJsO89zLzELqkcE0BipsogFNBgCoCqpBEHKEZLaEgwIEdoxljvCRcAj9FZzHuAHhBhZiht3VrsR-75OrB-2Hj0h6nYD5t5_otjqaz0Zsev4eh6qzHXy61uXFDOADz49vGW2ywN6m1ObnadDjL2A6bfoO9Taa1Y3AxT-I5OmlMF-3Fb52j14f79fKJrF4en5d3K1LzhUqEFZUqAGhF5aKkUKmGVaY0Uqiq5LWSEkxNWSGbhqqNsI3keS5MxQ1TkueYo6tJN2_9MdqY9G4YQ5-_1IwDz5pM8IyiE6oOQ4zBNjqf403Yawr64KmePNXZU33wVIvMYRMnZmy_teFP-X_SD6lQexM</recordid><startdate>20191201</startdate><enddate>20191201</enddate><creator>da Silva, Tiago Tiburcio</creator><creator>Chaves, Antônio Augusto</creator><creator>Yanasse, Horacio Hideki</creator><creator>Luna, Henrique Pacca Loureiro</creator><general>Springer International Publishing</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><orcidid>https://orcid.org/0000-0002-0700-3445</orcidid></search><sort><creationdate>20191201</creationdate><title>The multicommodity traveling salesman problem with priority prizes: a mathematical model and metaheuristics</title><author>da Silva, Tiago Tiburcio ; Chaves, Antônio Augusto ; Yanasse, Horacio Hideki ; Luna, Henrique Pacca Loureiro</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c359t-27b97001b165810b9f2ba8a649b83c9660ac1276ff19d4ef632ba4ab3a2963963</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Applications of Mathematics</topic><topic>Applied physics</topic><topic>Computational mathematics</topic><topic>Computational Mathematics and Numerical Analysis</topic><topic>Customer satisfaction</topic><topic>Genetic algorithms</topic><topic>Mathematical analysis</topic><topic>Mathematical Applications in Computer Science</topic><topic>Mathematical Applications in the Physical Sciences</topic><topic>Mathematical models</topic><topic>Mathematics</topic><topic>Mathematics and Statistics</topic><topic>Operating costs</topic><topic>Product differentiation</topic><topic>Traveling salesman problem</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>da Silva, Tiago Tiburcio</creatorcontrib><creatorcontrib>Chaves, Antônio Augusto</creatorcontrib><creatorcontrib>Yanasse, Horacio Hideki</creatorcontrib><creatorcontrib>Luna, Henrique Pacca Loureiro</creatorcontrib><collection>CrossRef</collection><jtitle>Computational & applied mathematics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>da Silva, Tiago Tiburcio</au><au>Chaves, Antônio Augusto</au><au>Yanasse, Horacio Hideki</au><au>Luna, Henrique Pacca Loureiro</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>The multicommodity traveling salesman problem with priority prizes: a mathematical model and metaheuristics</atitle><jtitle>Computational & applied mathematics</jtitle><stitle>Comp. Appl. Math</stitle><date>2019-12-01</date><risdate>2019</risdate><volume>38</volume><issue>4</issue><spage>1</spage><epage>25</epage><pages>1-25</pages><artnum>188</artnum><issn>2238-3603</issn><eissn>1807-0302</eissn><abstract>The classic Traveling Salesman Problem (TSP) only considers the costs involved in the routes and does not differentiate products or customers. Logistic companies face conflict between operational costs, customers with different categories of products, and customer satisfaction, which is directly related to delivery time. This paper presents a new mathematical model for a TSP with variable costs and priority prizes, taking into account the customer’s product and preference values. This problem is denoted as the Multicommodity Traveling Salesman Problem with Priority Prizes (MTSPPP). Two versions of the Biased Random-Key Genetic Algorithm (BRKGA) are proposed to solve medium and large instances of the MTSPPP. Computational tests were performed, using modified instances based on classical TSP instances. The proposed methods have proved to be efficient in solving the MTSPPP.</abstract><cop>Cham</cop><pub>Springer International Publishing</pub><doi>10.1007/s40314-019-0976-4</doi><tpages>25</tpages><orcidid>https://orcid.org/0000-0002-0700-3445</orcidid><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 2238-3603 |
| ispartof | Computational & applied mathematics, 2019-12, Vol.38 (4), p.1-25, Article 188 |
| issn | 2238-3603 1807-0302 |
| language | eng |
| recordid | cdi_proquest_journals_2303810243 |
| source | Springer Nature - Complete Springer Journals |
| subjects | Applications of Mathematics Applied physics Computational mathematics Computational Mathematics and Numerical Analysis Customer satisfaction Genetic algorithms Mathematical analysis Mathematical Applications in Computer Science Mathematical Applications in the Physical Sciences Mathematical models Mathematics Mathematics and Statistics Operating costs Product differentiation Traveling salesman problem |
| title | The multicommodity traveling salesman problem with priority prizes: a mathematical model and metaheuristics |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-27T15%3A21%3A01IST&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=The%20multicommodity%20traveling%20salesman%20problem%20with%20priority%20prizes:%20a%20mathematical%20model%20and%20metaheuristics&rft.jtitle=Computational%20&%20applied%20mathematics&rft.au=da%20Silva,%20Tiago%20Tiburcio&rft.date=2019-12-01&rft.volume=38&rft.issue=4&rft.spage=1&rft.epage=25&rft.pages=1-25&rft.artnum=188&rft.issn=2238-3603&rft.eissn=1807-0302&rft_id=info:doi/10.1007/s40314-019-0976-4&rft_dat=%3Cproquest_cross%3E2303810243%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=2303810243&rft_id=info:pmid/&rfr_iscdi=true |