Fuzzy rules for combinatorial search termination

Nongyao Prachumrat, D. Mathematics and Computer Sci., F. of Sci. and Tech., PSU.
Peerayuth Charnsethikul, Asst. Prof., D. of Industrial Eng., F. of Eng., Khon Kaen U., Khon Kaen
E-mail : pnongyao@bunga.pn.psu.ac.th

Published : Research Report
Key words : fuzzy rules, facilities layout problem, traveling salesman problem, combinatorial search

Good facilities layout and good path of traveling salesman are an important issues because good facilities layout and good path of traveling salesman with minimum distance can lead to a lower operation cost and customer can receive product just in time. Present, facilities layout problem and traveling salesman problem solve by heuristic method that solution sequence is not the best solution. Because of that I must developed method to solve these problems using fuzzy rules for terminated searching when getting the best solution. I applied pairwise exchange method to be multiprocessing by each process use each initial solution. When found that cost value decrease in minimum rate at that time that solution will be the best solution.

The results of this study show that FTS method can get lower cost than NPE method by use no different time.

The result of this study show that this approach can observe some better solution from solving facilities layout problem and traveling salesman problem but it does rely on the numbers of iterations for generating new solution. The more available computation time, the more number of iterations can be increased and the more possibility to fide a better solution.

---

BACK