A CONSTRAINED SOLID TSP IN FUZZY ENVIRONMENT: TWO HEURISTIC APPROACHES

A solid travelling salesman problem (STSP) is a travelling sales- man problem (TSP) where the salesman visits all the cities only once in his tour using dierent conveyances to travel from one city to another. Costs and environmental eect

[1]  Toshihide Ibaraki,et al.  Effective Local Search Algorithms for Routing and Scheduling Problems with General Time-Window Constraints , 2005, Transp. Sci..

[2]  Manoranjan Maiti,et al.  Fuzzy inventory model with two warehouses under possibility constraints , 2006, Fuzzy Sets Syst..

[3]  Ziyou Gao,et al.  A FUZZY MINIMUM RISK MODEL FOR THE RAILWAY TRANSPORTATION PLANNING PROBLEM , 2011 .

[4]  Yu-Hsin Liu.  Different initial solution generators in genetic algorithms for solving the probabilistic traveling salesman problem , 2010, Appl. Math. Comput..

[5]  S. S. Sengupta,et al.  The traveling salesman problem , 1961 .

[6]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1992, Artificial Intelligence.

[7]  George B. Dantzig,et al.  Solution of a Large-Scale Traveling-Salesman Problem , 1954, Oper. Res..

[8]  Didier Dubois,et al.  Fuzzy sets and systems ' . Theory and applications , 2007 .

[9]  Iraj Mahdavi,et al.  ALGORITHMS FOR BIOBJECTIVE SHORTEST PATH PROBLEMS IN FUZZY NETWORKS , 2011 .

[10]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[11]  Yoonho Seo,et al.  Discrete Optimization An efficient genetic algorithm for the traveling salesman problem with precedence constraints , 2002 .

[12]  Oli B. G. Madsen,et al.  The double travelling salesman problem with multiple stacks - Formulation and heuristic solution approaches , 2009, Eur. J. Oper. Res..

[13]  Asoke Kumar Bhunia,et al.  Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times , 2011, J. Comput. Appl. Math..

[14]  M. Padberg,et al.  Addendum: Optimization of a 532-city symmetric traveling salesman problem by branch and cut , 1990 .

[15]  Hans-Jürgen Zimmermann,et al.  Fuzzy Set Theory - and Its Applications , 1985 .

[16]  A. Kumar,et al.  APPLICATION OF TABU SEARCH FOR SOLVING THE BI-OBJECTIVE WAREHOUSE PROBLEM IN A FUZZY ENVIRONMENT , 2012 .

[17]  L. Zadeh.  Fuzzy sets as a basis for a theory of possibility , 1999 .

[18]  Eugene L. Lawler,et al.  The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization , 1985 .

[19]  Andries Petrus Engelbrecht,et al.  Fundamentals of Computational Swarm Intelligence , 2005 .

[20]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[21]  D. J. Smith,et al.  A Study of Permutation Crossover Operators on the Traveling Salesman Problem , 1987, ICGA.

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

[23]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[24]  F. Glover,et al.  The application of tabu search to the symmetric traveling salesman problem , 1989 .

[25]  Moritoshi Yasunaga,et al.  Implementation of an Effective Hybrid GA for Large-Scale Traveling Salesman Problems , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[26]  Eugene L. Lawler,et al.  Traveling Salesman Problem , 2016 .

[27]  David Z. Zhang,et al.  Multi-objective ant colony optimisation: A meta-heuristic approach to supply chain design , 2011 .

[28]  Shyi-Ming Chen,et al.  Parallelized genetic ant colony systems for solving the traveling salesman problem , 2011, Expert Syst. Appl..

[29]  Thomas Stützle,et al.  Ant Colony Optimization Theory , 2004 .

[30]  William J. Cook,et al.  Solution of a Large-Scale Traveling-Salesman Problem , 1954, 50 Years of Integer Programming.

[31]  Malihe M. Farsangi,et al.  A SOLUTION TO AN ECONOMIC DISPATCH PROBLEM BY A FUZZY ADAPTIVE GENETIC ALGORITHM , 2011 .

[32]  Lionel Amodeo,et al.  Bi-Objective Ant Colony Optimization approach to optimize production and maintenance scheduling , 2010, Comput. Oper. Res..

[33]  Luca Maria Gambardella,et al.  An Ant Colony Optimization Approach to the Probabilistic Traveling Salesman Problem , 2002, PPSN.

[34]  Wen-Chyuan Chiang,et al.  Simulated annealing metaheuristics for the vehicle routing problem with time windows , 1996, Ann. Oper. Res..

[35]  Jian Huang,et al.  An Adaptive Genetic Algorithm for Solving Traveling Salesman Problem , 2008, ICIC.

[36]  Andrea Lodi,et al.  A Hybrid Exact Algorithm for the TSPTW , 2002, INFORMS J. Comput..

[37]  Manoranjan Maiti,et al.  Two-storage inventory model with lot-size dependent fuzzy lead-time under possibility constraints via genetic algorithm , 2007, Eur. J. Oper. Res..

[38]  Andreea Vescan.  Ant Colony Component-based System for Traveling Salesman Problem , 2007 .

[39]  Wei Tsang Ooi,et al.  A stochastic dynamic traveling salesman problem with hard time windows , 2009, Eur. J. Oper. Res..

[40]  Manfred W. Padberg,et al.  On the symmetric travelling salesman problem: A computational study , 1980 .

[41]  James B. Orlin,et al.  A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem , 2006, Discret. Optim..