Approaching the fuzzy road transport traveling salesman problem by eugenic bacterial memetic, algorithm

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.

[1]  M. Held,et al.  A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.

[2]  E. E. Ammar,et al.  Study on multiobjective transportation problem with fuzzy numbers , 2005, Appl. Math. Comput..

[3]  László T. Kóczy,et al.  Solution for Fuzzy Road Transport Traveling Salesman Problem Using Eugenic Bacterial Memetic Algorithm , 2009, IFSA/EUSFLAT Conf..

[4]  Peng Chen,et al.  Optimization with extremal dynamics for the traveling salesman problem , 2007 .

[5]  Dominique Feillet,et al.  Ant colony optimization for the traveling purchaser problem , 2008, Comput. Oper. Res..

[6]  何苗,et al.  Two-Level Genetic Algorithm for Clustered Traveling Salesman Problem with Application in Large-Scale TSPs , 2007 .

[7]  M. Held,et al.  A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.

[8]  Guan-Chun Luh,et al.  ABACTERIAL EVOLUTIONARY ALGORITHM FOR THE JOB SHOP SCHEDULING PROBLEM , 2006 .

[9]  David L. Applegate,et al.  The traveling salesman problem , 2006 .

[10]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[11]  R. Aumann.  Rationality and Bounded Rationality , 1997 .

[12]  Pablo Moscato,et al.  On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms , 1989 .

[13]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics) , 2007 .

[14]  Ender Ozcan,et al.  A Brief Review of Memetic Algorithms for Solving Euclidean 2 D Traveling Salesrep Problem , 2004 .

[15]  Seyyed M. T. Fatemi Ghomi,et al.  A hybrid system for multiobjective problems - A case study in NP-hard problems , 2007, Knowl. Based Syst..

[16]  Masahiro Tanaka,et al.  Eugenics-Based Genetic Algorithm , 1996 .

[17]  Partha Chakroborty,et al.  Place of possibility theory in transportation analysis , 2006 .

[18]  Lotfi A. Zadeh,et al.  The Concepts of a Linguistic Variable and its Application to Approximate Reasoning , 1975 .

[19]  Takeshi Furuhashi,et al.  Fuzzy system parameters discovery by bacterial evolutionary algorithm , 1999, IEEE Trans. Fuzzy Syst..

[20]  A. Schrijver,et al.  The Traveling Salesman Problem , 2011 .

[21]  Yanchun Liang,et al.  Particle swarm optimization-based algorithms for TSP and generalized TSP , 2007, Inf. Process. Lett..

[22]  Mourad Oussalah,et al.  On the compatibility between defuzzification and fuzzy arithmetic operations , 2002, Fuzzy Sets Syst..

[23]  A. Roth,et al.  Games and Economic Behavior , 1995 .

[24]  Hsiao-Fan Wang,et al.  Time-constrained Chinese postman problems , 2002 .

[25]  László T. Kóczy,et al.  Fuzzy rule extraction by bacterial memetic algorithms , 2009, Int. J. Intell. Syst..

[26]  Kay Chen Tan,et al.  An asynchronous recurrent linear threshold network approach to solving the traveling salesman problem , 2008, Neurocomputing.

[27]  Daniela Favaretto,et al.  An ant colony system approach for variants of the traveling salesman problem with time windows , 2006 .

[28]  Jürgen Branke,et al.  Evolutionary optimization in uncertain environments-a survey , 2005, IEEE Transactions on Evolutionary Computation.

[29]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study , 2007 .

[30]  P. Földesi,et al.  Solution for Modified Traveling Salesman Problem with Variable Cost Matrix Using Bacterial Evolutionary Algorithm , 2008 .

[31]  Yu-Hsin Liu.  A hybrid scatter search for the probabilistic traveling salesman problem , 2007, Comput. Oper. Res..

[32]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..