Solution for fuzzy road transport traveling salesman problem using eugenic bacterial memetic algorithm

János Botzheim, Péter Földesi, L. Kóczy

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

7 Citations (Scopus)

Abstract

The aim of the Traveling Salesman Problem (TSP) is to find the cheapest way of visiting all elements in a given set of cities and returning to the starting point. In solutions presented in the literature costs of travel between nodes (cities) are based on Euclidean distances, the problem is symmetric and the costs are constant. In this paper a novel construction and formulation of the TSP is presented in which the requirements and features of practical application in road transportation and supply chains are taken into consideration. Computational results are presented as well.

Original languageEnglish
Title of host publication2009 International Fuzzy Systems Association World Congress and 2009 European Society for Fuzzy Logic and Technology Conference, IFSA-EUSFLAT 2009 - Proceedings
Pages1667-1672
Number of pages6
Publication statusPublished - 2009
EventJoint 2009 International Fuzzy Systems Association World Congress, IFSA 2009 and 2009 European Society of Fuzzy Logic and Technology Conference, EUSFLAT 2009 - Lisbon, Portugal
Duration: Jul 20 2009Jul 24 2009

Other

OtherJoint 2009 International Fuzzy Systems Association World Congress, IFSA 2009 and 2009 European Society of Fuzzy Logic and Technology Conference, EUSFLAT 2009
CountryPortugal
CityLisbon
Period7/20/097/24/09

Fingerprint

Traveling salesman problem
Supply chains
Costs

Keywords

  • Eugenic bacterial memetic algorithm
  • Time dependent fuzzy costs
  • Traveling Salesman Problem

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Information Systems

Cite this

Botzheim, J., Földesi, P., & Kóczy, L. (2009). Solution for fuzzy road transport traveling salesman problem using eugenic bacterial memetic algorithm. In 2009 International Fuzzy Systems Association World Congress and 2009 European Society for Fuzzy Logic and Technology Conference, IFSA-EUSFLAT 2009 - Proceedings (pp. 1667-1672)

Solution for fuzzy road transport traveling salesman problem using eugenic bacterial memetic algorithm. / Botzheim, János; Földesi, Péter; Kóczy, L.

2009 International Fuzzy Systems Association World Congress and 2009 European Society for Fuzzy Logic and Technology Conference, IFSA-EUSFLAT 2009 - Proceedings. 2009. p. 1667-1672.

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

Botzheim, J, Földesi, P & Kóczy, L 2009, Solution for fuzzy road transport traveling salesman problem using eugenic bacterial memetic algorithm. in 2009 International Fuzzy Systems Association World Congress and 2009 European Society for Fuzzy Logic and Technology Conference, IFSA-EUSFLAT 2009 - Proceedings. pp. 1667-1672, Joint 2009 International Fuzzy Systems Association World Congress, IFSA 2009 and 2009 European Society of Fuzzy Logic and Technology Conference, EUSFLAT 2009, Lisbon, Portugal, 7/20/09.
Botzheim J, Földesi P, Kóczy L. Solution for fuzzy road transport traveling salesman problem using eugenic bacterial memetic algorithm. In 2009 International Fuzzy Systems Association World Congress and 2009 European Society for Fuzzy Logic and Technology Conference, IFSA-EUSFLAT 2009 - Proceedings. 2009. p. 1667-1672
Botzheim, János ; Földesi, Péter ; Kóczy, L. / Solution for fuzzy road transport traveling salesman problem using eugenic bacterial memetic algorithm. 2009 International Fuzzy Systems Association World Congress and 2009 European Society for Fuzzy Logic and Technology Conference, IFSA-EUSFLAT 2009 - Proceedings. 2009. pp. 1667-1672
@inproceedings{d8b4dd5a29b54633aac7edf56a524be1,
title = "Solution for fuzzy road transport traveling salesman problem using eugenic bacterial memetic algorithm",
abstract = "The aim of the Traveling Salesman Problem (TSP) is to find the cheapest way of visiting all elements in a given set of cities and returning to the starting point. In solutions presented in the literature costs of travel between nodes (cities) are based on Euclidean distances, the problem is symmetric and the costs are constant. In this paper a novel construction and formulation of the TSP is presented in which the requirements and features of practical application in road transportation and supply chains are taken into consideration. Computational results are presented as well.",
keywords = "Eugenic bacterial memetic algorithm, Time dependent fuzzy costs, Traveling Salesman Problem",
author = "J{\'a}nos Botzheim and P{\'e}ter F{\"o}ldesi and L. K{\'o}czy",
year = "2009",
language = "English",
isbn = "9789899507968",
pages = "1667--1672",
booktitle = "2009 International Fuzzy Systems Association World Congress and 2009 European Society for Fuzzy Logic and Technology Conference, IFSA-EUSFLAT 2009 - Proceedings",

}

TY - GEN

T1 - Solution for fuzzy road transport traveling salesman problem using eugenic bacterial memetic algorithm

AU - Botzheim, János

AU - Földesi, Péter

AU - Kóczy, L.

PY - 2009

Y1 - 2009

N2 - The aim of the Traveling Salesman Problem (TSP) is to find the cheapest way of visiting all elements in a given set of cities and returning to the starting point. In solutions presented in the literature costs of travel between nodes (cities) are based on Euclidean distances, the problem is symmetric and the costs are constant. In this paper a novel construction and formulation of the TSP is presented in which the requirements and features of practical application in road transportation and supply chains are taken into consideration. Computational results are presented as well.

AB - The aim of the Traveling Salesman Problem (TSP) is to find the cheapest way of visiting all elements in a given set of cities and returning to the starting point. In solutions presented in the literature costs of travel between nodes (cities) are based on Euclidean distances, the problem is symmetric and the costs are constant. In this paper a novel construction and formulation of the TSP is presented in which the requirements and features of practical application in road transportation and supply chains are taken into consideration. Computational results are presented as well.

KW - Eugenic bacterial memetic algorithm

KW - Time dependent fuzzy costs

KW - Traveling Salesman Problem

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

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

M3 - Conference contribution

SN - 9789899507968

SP - 1667

EP - 1672

BT - 2009 International Fuzzy Systems Association World Congress and 2009 European Society for Fuzzy Logic and Technology Conference, IFSA-EUSFLAT 2009 - Proceedings

ER -