The discrete bacterial memetic evolutionary algorithm for solving the one-commodity pickup-and-delivery traveling salesman problem

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

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

In this paper we propose a population based memetic algorithm, the Discrete Bacterial Memetic Evolutionary Algorithm for solving the one-commodity Pickup-and-Delivery Traveling Salesman Problem. The algorithm was tested on benchmark instances up to 100 nodes, and the results were compared with the state-of-the art methods in the literature. For all instances the DBMEA found optimal or close-optimal solutions.

Original languageEnglish
Title of host publicationStudies in Computational Intelligence
PublisherSpringer Verlag
Pages15-22
Number of pages8
DOIs
Publication statusPublished - Jan 1 2020

Publication series

NameStudies in Computational Intelligence
Volume819
ISSN (Print)1860-949X

Fingerprint

Traveling salesman problem
Pickups
Evolutionary algorithms

Keywords

  • Combinatorial optimization
  • Metaheuristic
  • Pickup and delivery

ASJC Scopus subject areas

  • Artificial Intelligence

Cite this

Tüű-Szabó, B., Földesi, P., & Kóczy, L. (2020). The discrete bacterial memetic evolutionary algorithm for solving the one-commodity pickup-and-delivery traveling salesman problem. In Studies in Computational Intelligence (pp. 15-22). (Studies in Computational Intelligence; Vol. 819). Springer Verlag. https://doi.org/10.1007/978-3-030-16024-1_3

The discrete bacterial memetic evolutionary algorithm for solving the one-commodity pickup-and-delivery traveling salesman problem. / Tüű-Szabó, Boldizsár; Földesi, Péter; Kóczy, L.

Studies in Computational Intelligence. Springer Verlag, 2020. p. 15-22 (Studies in Computational Intelligence; Vol. 819).

Research output: Chapter in Book/Report/Conference proceedingChapter

Tüű-Szabó, B, Földesi, P & Kóczy, L 2020, The discrete bacterial memetic evolutionary algorithm for solving the one-commodity pickup-and-delivery traveling salesman problem. in Studies in Computational Intelligence. Studies in Computational Intelligence, vol. 819, Springer Verlag, pp. 15-22. https://doi.org/10.1007/978-3-030-16024-1_3
Tüű-Szabó B, Földesi P, Kóczy L. The discrete bacterial memetic evolutionary algorithm for solving the one-commodity pickup-and-delivery traveling salesman problem. In Studies in Computational Intelligence. Springer Verlag. 2020. p. 15-22. (Studies in Computational Intelligence). https://doi.org/10.1007/978-3-030-16024-1_3
Tüű-Szabó, Boldizsár ; Földesi, Péter ; Kóczy, L. / The discrete bacterial memetic evolutionary algorithm for solving the one-commodity pickup-and-delivery traveling salesman problem. Studies in Computational Intelligence. Springer Verlag, 2020. pp. 15-22 (Studies in Computational Intelligence).
@inbook{73a7bf1d4c6148d38f0522e6d4e47fed,
title = "The discrete bacterial memetic evolutionary algorithm for solving the one-commodity pickup-and-delivery traveling salesman problem",
abstract = "In this paper we propose a population based memetic algorithm, the Discrete Bacterial Memetic Evolutionary Algorithm for solving the one-commodity Pickup-and-Delivery Traveling Salesman Problem. The algorithm was tested on benchmark instances up to 100 nodes, and the results were compared with the state-of-the art methods in the literature. For all instances the DBMEA found optimal or close-optimal solutions.",
keywords = "Combinatorial optimization, Metaheuristic, Pickup and delivery",
author = "Boldizs{\'a}r T{\"u}ű-Szab{\'o} and P{\'e}ter F{\"o}ldesi and L. K{\'o}czy",
year = "2020",
month = "1",
day = "1",
doi = "10.1007/978-3-030-16024-1_3",
language = "English",
series = "Studies in Computational Intelligence",
publisher = "Springer Verlag",
pages = "15--22",
booktitle = "Studies in Computational Intelligence",

}

TY - CHAP

T1 - The discrete bacterial memetic evolutionary algorithm for solving the one-commodity pickup-and-delivery traveling salesman problem

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

AU - Földesi, Péter

AU - Kóczy, L.

PY - 2020/1/1

Y1 - 2020/1/1

N2 - In this paper we propose a population based memetic algorithm, the Discrete Bacterial Memetic Evolutionary Algorithm for solving the one-commodity Pickup-and-Delivery Traveling Salesman Problem. The algorithm was tested on benchmark instances up to 100 nodes, and the results were compared with the state-of-the art methods in the literature. For all instances the DBMEA found optimal or close-optimal solutions.

AB - In this paper we propose a population based memetic algorithm, the Discrete Bacterial Memetic Evolutionary Algorithm for solving the one-commodity Pickup-and-Delivery Traveling Salesman Problem. The algorithm was tested on benchmark instances up to 100 nodes, and the results were compared with the state-of-the art methods in the literature. For all instances the DBMEA found optimal or close-optimal solutions.

KW - Combinatorial optimization

KW - Metaheuristic

KW - Pickup and delivery

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

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

U2 - 10.1007/978-3-030-16024-1_3

DO - 10.1007/978-3-030-16024-1_3

M3 - Chapter

T3 - Studies in Computational Intelligence

SP - 15

EP - 22

BT - Studies in Computational Intelligence

PB - Springer Verlag

ER -