Discrete bacterial memetic evolutionary algorithm for the time dependent traveling salesman problem

Boldizsár Tüű-Szabó, Péter Földesi, L. Kóczy

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

The Time Dependent Traveling Salesman Problem (TDTSP) that is addressed in this paper is a variant of the well-known Traveling Salesman Problem. In this problem the distances between nodes vary in time (are longer in rush hours in the city centre), Our Discrete Bacterial Evolutionary Algorithm (DBMEA) was tested on benchmark problems (on bier127 and on a self-generated problem with 250 nodes) with various jam factors. The results demonstrate the effectiveness of the algorithm.

Original languageEnglish
Title of host publicationInformation Processing and Management of Uncertainty in Knowledge-Based Systems. Theory and Foundations - 17th International Conference, IPMU 2018, Proceedings
PublisherSpringer Verlag
Pages523-533
Number of pages11
ISBN (Print)9783319914725
DOIs
Publication statusPublished - Jan 1 2018
Event17th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, IPMU 2018 - Cadiz, Spain
Duration: Jun 11 2018Jun 15 2018

Publication series

NameCommunications in Computer and Information Science
Volume853
ISSN (Print)1865-0929

Other

Other17th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, IPMU 2018
CountrySpain
CityCadiz
Period6/11/186/15/18

Fingerprint

Memetic Algorithm
Traveling salesman problem
Travelling salesman problems
Evolutionary algorithms
Evolutionary Algorithms
Vertex of a graph
Vary
Benchmark
Demonstrate

Keywords

  • Heuristic
  • Time dependent
  • Traveling salesman problem

ASJC Scopus subject areas

  • Computer Science(all)
  • Mathematics(all)

Cite this

Tüű-Szabó, B., Földesi, P., & Kóczy, L. (2018). Discrete bacterial memetic evolutionary algorithm for the time dependent traveling salesman problem. In Information Processing and Management of Uncertainty in Knowledge-Based Systems. Theory and Foundations - 17th International Conference, IPMU 2018, Proceedings (pp. 523-533). (Communications in Computer and Information Science; Vol. 853). Springer Verlag. https://doi.org/10.1007/978-3-319-91473-2_45

Discrete bacterial memetic evolutionary algorithm for the time dependent traveling salesman problem. / Tüű-Szabó, Boldizsár; Földesi, Péter; Kóczy, L.

Information Processing and Management of Uncertainty in Knowledge-Based Systems. Theory and Foundations - 17th International Conference, IPMU 2018, Proceedings. Springer Verlag, 2018. p. 523-533 (Communications in Computer and Information Science; Vol. 853).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Tüű-Szabó, B, Földesi, P & Kóczy, L 2018, Discrete bacterial memetic evolutionary algorithm for the time dependent traveling salesman problem. in Information Processing and Management of Uncertainty in Knowledge-Based Systems. Theory and Foundations - 17th International Conference, IPMU 2018, Proceedings. Communications in Computer and Information Science, vol. 853, Springer Verlag, pp. 523-533, 17th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, IPMU 2018, Cadiz, Spain, 6/11/18. https://doi.org/10.1007/978-3-319-91473-2_45
Tüű-Szabó B, Földesi P, Kóczy L. Discrete bacterial memetic evolutionary algorithm for the time dependent traveling salesman problem. In Information Processing and Management of Uncertainty in Knowledge-Based Systems. Theory and Foundations - 17th International Conference, IPMU 2018, Proceedings. Springer Verlag. 2018. p. 523-533. (Communications in Computer and Information Science). https://doi.org/10.1007/978-3-319-91473-2_45
Tüű-Szabó, Boldizsár ; Földesi, Péter ; Kóczy, L. / Discrete bacterial memetic evolutionary algorithm for the time dependent traveling salesman problem. Information Processing and Management of Uncertainty in Knowledge-Based Systems. Theory and Foundations - 17th International Conference, IPMU 2018, Proceedings. Springer Verlag, 2018. pp. 523-533 (Communications in Computer and Information Science).
@inproceedings{47ae7520aca749fcb8935d40af667f9a,
title = "Discrete bacterial memetic evolutionary algorithm for the time dependent traveling salesman problem",
abstract = "The Time Dependent Traveling Salesman Problem (TDTSP) that is addressed in this paper is a variant of the well-known Traveling Salesman Problem. In this problem the distances between nodes vary in time (are longer in rush hours in the city centre), Our Discrete Bacterial Evolutionary Algorithm (DBMEA) was tested on benchmark problems (on bier127 and on a self-generated problem with 250 nodes) with various jam factors. The results demonstrate the effectiveness of the algorithm.",
keywords = "Heuristic, Time dependent, Traveling salesman problem",
author = "Boldizs{\'a}r T{\"u}ű-Szab{\'o} and P{\'e}ter F{\"o}ldesi and L. K{\'o}czy",
year = "2018",
month = "1",
day = "1",
doi = "10.1007/978-3-319-91473-2_45",
language = "English",
isbn = "9783319914725",
series = "Communications in Computer and Information Science",
publisher = "Springer Verlag",
pages = "523--533",
booktitle = "Information Processing and Management of Uncertainty in Knowledge-Based Systems. Theory and Foundations - 17th International Conference, IPMU 2018, Proceedings",

}

TY - GEN

T1 - Discrete bacterial memetic evolutionary algorithm for the time dependent traveling salesman problem

AU - Tüű-Szabó, Boldizsár

AU - Földesi, Péter

AU - Kóczy, L.

PY - 2018/1/1

Y1 - 2018/1/1

N2 - The Time Dependent Traveling Salesman Problem (TDTSP) that is addressed in this paper is a variant of the well-known Traveling Salesman Problem. In this problem the distances between nodes vary in time (are longer in rush hours in the city centre), Our Discrete Bacterial Evolutionary Algorithm (DBMEA) was tested on benchmark problems (on bier127 and on a self-generated problem with 250 nodes) with various jam factors. The results demonstrate the effectiveness of the algorithm.

AB - The Time Dependent Traveling Salesman Problem (TDTSP) that is addressed in this paper is a variant of the well-known Traveling Salesman Problem. In this problem the distances between nodes vary in time (are longer in rush hours in the city centre), Our Discrete Bacterial Evolutionary Algorithm (DBMEA) was tested on benchmark problems (on bier127 and on a self-generated problem with 250 nodes) with various jam factors. The results demonstrate the effectiveness of the algorithm.

KW - Heuristic

KW - Time dependent

KW - Traveling salesman problem

UR - http://www.scopus.com/inward/record.url?scp=85048238695&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85048238695&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-91473-2_45

DO - 10.1007/978-3-319-91473-2_45

M3 - Conference contribution

SN - 9783319914725

T3 - Communications in Computer and Information Science

SP - 523

EP - 533

BT - Information Processing and Management of Uncertainty in Knowledge-Based Systems. Theory and Foundations - 17th International Conference, IPMU 2018, Proceedings

PB - Springer Verlag

ER -