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

1 Citation (Scopus)

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

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