Loading...

Heuristic algorithms to solve a bi-criteria traveling salesman problem with fuzzy time window

Tavakkoli Moghaddam, R ; Sharif University of Technology | 2005

228 Viewed
  1. Type of Document: Article
  2. Publisher: 2005
  3. Abstract:
  4. This paper presents a mathematical programming to model a bi-criteria traveling salesman problem (TSP) with fuzzy time windows. The objective is to minimize the travel time and minimize the sum of salesman's waiting time during the service. A triangle fuzzy number is defined for the service time of each customer. The objective function is normalized in the interval between 0 and 1. To solve such a model, two heuristic methods based on genetic algorithms (GAs) and ant colony optimization (ACO) are developed. To validate and show the efficiency these methods, a number of test problems are generated at random. Finally, a comparison of the obtained results is presented
  5. Keywords:
  6. Ant Colony Optimization (ACO) ; Genetic algorithm (GAs) ; Objective functions ; Service time ; Test problem ; Time windows ; Triangle fuzzy numbers ; Waiting-time ; Ant colony optimization ; Artificial intelligence ; Fuzzy sets ; Heuristic algorithms ; Heuristic methods ; Industrial engineering ; Mathematical programming ; Traveling salesman problem ; Vehicle routing ; Genetic algorithms
  7. Source: 35th International Conference on Computers and Industrial Engineering, ICC and IE 2005, Istanbul, 19 June 2005 through 22 June 2005 ; 2005 , Pages 1899-1904 ; 9755612653 (ISBN); 9789755612652 (ISBN)