https://www.mdu.se/

mdu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
On the Design and Performance of a Novel Metaheuristic Solver for the Extended Colored Traveling Salesman Problem
Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems.ORCID iD: 0000-0002-9051-929x
TECNALIA, Basque Research and Technology Alliance (BRTA), Derio, Spain.
TECNALIA, Basque Research and Technology Alliance (BRTA), Derio, Spain University of the Basque Country (UPV/EHU), Bilbao, Spain.
Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems.
Show others and affiliations
2023 (English)In: IEEE Conf Intell Transport Syst Proc ITSC, Institute of Electrical and Electronics Engineers Inc. , 2023, p. 1955-1962Conference paper, Published paper (Refereed)
Abstract [en]

Intelligent transportation systems face various challenges, including traffic congestion, environmental pollution, and inefficient transportation management. Optimizing routes and schedules for efficient delivery of goods and services can mitigate the aforementioned problems. Many transportation and routing problems can be modeled as variants of the Traveling Salesmen Problem (TSP) depending on the specific requirements of the scenario at hand. This means that to efficiently solve the routing problem, all locations have to be visited by the available salesmen in a way that minimizes the overall makespan. This becomes a non-trivial problem when the number of salesmen and locations to be visited increases. The problem at hand is modeled as a special TSP variant, called Extended Colored TSP (ECTSP). It has additional constraints when compared to the classical TSP, which further complicates the search for a feasible solution. This work proposes a new metaheuristic approach to efficiently solve the ECTSP. We compare the proposed approach to existing solutions over a series of test instances. The results show a superior performance of our metaheuristic approach with respect to the state of the art, both in terms of solution quality and algorithm's runtime.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers Inc. , 2023. p. 1955-1962
Keywords [en]
Intelligent systems, Traffic congestion, Delivery of goods, Environmental pollutions, Good and services, Intelligent transportation systems, Meta-heuristic approach, Metaheuristic, Performance, Routing problems, Transportation management, Transportation problem, Traveling salesman problem
National Category
Computer and Information Sciences
Identifiers
URN: urn:nbn:se:mdh:diva-66247DOI: 10.1109/ITSC57777.2023.10421924ISI: 001178996701143Scopus ID: 2-s2.0-85186509322ISBN: 9798350399462 (print)OAI: oai:DiVA.org:mdh-66247DiVA, id: diva2:1845526
Conference
IEEE Conference on Intelligent Transportation Systems, Proceedings, ITSC
Available from: 2024-03-19 Created: 2024-03-19 Last updated: 2024-06-19Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Miloradović, BrankoPapadopoulos, Alessandro

Search in DiVA

By author/editor
Miloradović, BrankoPapadopoulos, Alessandro
By organisation
Embedded Systems
Computer and Information Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 7 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf