Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination Operator
Proceedings of the 3rd International Conference on Genetic Algorithms
A Fast Evolutionary Algorithm for Traveling Salesman Problem
ICNC '07 Proceedings of the Third International Conference on Natural Computation - Volume 04
A genetic algorithm-based clustering approach for database partitioning
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
A hybrid heuristic for the traveling salesman problem
IEEE Transactions on Evolutionary Computation
Implementation of an Effective Hybrid GA for Large-Scale Traveling Salesman Problems
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Hi-index | 0.00 |
Building a delivery route optimization system that improves the delivery efficiency in real time requires to solve several tens to hundreds cities Traveling Salesman Problems (TSP) within interactive response time, with expert-level accuracy (less than 3% of errors). To meet these requirements, a multi-inner-world Genetic Algorithm (Miw-GA) method is developed. This method combines several types of GA's inner worlds. Each world of this method uses a different type of heuristics such as a 2-opt type mutation world and a block (Nearest Insertion) type mutation world. Comparison based on the results of 1000 times experiments proved the method is superior to others.