Fuzzy Multi-objective Linear Programming Approach for Traveling Salesman Problem

Traveling salesman problem (TSP) is one of the challenging real-life problems, attracting researchers of many fields including Artificial Intelligence, Operations Research, and Algorithm Design and Analysis. The problem has been well studied till now under different headings and has been solved with different approaches including genetic algorithms and linear programming. Conventional linear programming is designed to deal with crisp parameters, but information about real life systems is often available in the form of vague descriptions. Fuzzy methods are designed to handle vague terms, and are most suited to finding optimal solutions to problems with vague parameters. Fuzzy multi-objective linear programming, an amalgamation of fuzzy logic and multiobjective linear programming, deals with flexible aspiration levels or goals and fuzzy constraints with acceptable deviations. In this paper, a methodology, for solving a TSP with imprecise parameters, is deployed using fuzzy multi-objective linear programming. An example of TSP with multiple objectives and vague parameters is discussed.

[1]  H. Zimmermann.  Fuzzy programming and linear programming with several objective functions , 1978 .

[2]  Andrzej Jaszkiewicz,et al.  Genetic local search for multi-objective combinatorial optimization , 2022 .

[3]  Mansur R. Kabuka,et al.  A Boolean Neural Network Approach for the Traveling Salesman Problem , 1993, IEEE Trans. Computers.

[4]  A. Warburton,et al.  Approximation Methods for Multiple Criteria Travelling Salesman Problems , 1987 .

[5]  Shakhatreh,et al.  Fuzzy Logic and Its Applications , 2007 .

[6]  M. Ehrgott.  Approximation algorithms for combinatorial multicriteria optimization problems , 2000 .

[7]  Lishan Kang,et al.  A New MOEA for Multi-objective TSP and Its Convergence Property Analysis , 2003, EMO.

[8]  I. Melamed,et al.  The linear convolution of criteria in the bicriteria traveling salesman problem , 1997 .

[9]  Thomas Stützle,et al.  Pareto Local Optimum Sets in the Biobjective Traveling Salesman Problem: An Experimental Study , 2004, Metaheuristics for Multiobjective Optimisation.

[10]  Thomas Stützle,et al.  A Two-Phase Local Search for the Biobjective Traveling Salesman Problem , 2003, EMO.

[11]  Moustapha Diaby.  P = NP: Linear programming formulation of the traveling salesman problem , 2006 .

[12]  I. Sigal.  Algorithms for solving the two-criterion large-scale travelling salesman problem , 1994 .

[13]  Michael Pilegaard Hansen.  Use of Substitute Scalarizing Functions to Guide a Local Search Based Heuristic: The Case of moTSP , 2000, J. Heuristics.

[14]  Knut Richter,et al.  Solving a multiobjective traveling salesman problem by dynamic programming , 1982 .

[15]  Roger Hartley,et al.  Linear Multiple Objective Programming , 1985 .