A multi-inner-world genetic algorithm using multiple heuristics to optimize delivery schedule

Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics

Volumn , Issue , 2009, Pages 605-610

  Sakurai, Yoshitaka ^a   Tsuruta, Setsuo ^a   Onoyama, Takashi ^b   Kubota, Sen ^b  

^a TOKYO DENKI UNIVERSITY   (Japan)

^b HITACHI LTD   (Japan)

Author keywords

Genetic algorithm (GA); Heuristics; Traveling salesman problems (TSP)

Indexed keywords

DELIVERY ROUTES; DELIVERY SCHEDULES; HEURISTICS; INNER WORLD; REAL TIME; RESPONSE TIME;

CYBERNETICS; GENETIC ALGORITHMS; HEURISTIC METHODS; PROBLEM SOLVING;

TRAVELING SALESMAN PROBLEM;

EID: 74849086863     PISSN: 1062922X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICSMC.2009.5346638     Document Type: Conference Paper

References (17)

1. Lawer, E., Lenstra, J., Rinnony, K., and Shmoys, D., "The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization", John Wiley Sons, 1985.
2. Yamamoto, Y., and Kubo, M., "Invitation to Traveling Salesman Problem", Asakura Syoten, Tokyo, 1997.
3. Y. Sakurai, T. Onoyama, S. Kubota, Y. Nakamura, S. Tsuruta: "A Multi-world Intelligent Genetic Algorithm to Interactively Optimize Largescale TSP", Proc. of The 2006 IEEE International Conference on Information Reuse and Integration (IEEE IRI2006), Hawaii, USA, pp248-255, 2006.
4. Lin, S. and Kernighan, B.W., "An effective heuristic algorithm for the traveling salesman problem", Operations Research, Vol. 21, No.2, pp.498-516, 1972.
5. Miki, M., Hiroyasu, T, Jitta, T., "Adaptive Simulated Anealing for maximum temperature", Systems, Man and Cyernetics, 2003. IEEE International Conference, vol.1, pp.0-25, 2003.
6. Fang, Y., Liu, G., He, Y., Qiu, Y., "Tabu search algorithm based on insertion method", Proceedings of the 2003 International Conference on Neural Networks and Signal Processing, pp.420-423, 2003.
7. Kanazawa, T., Yasuda, K., "Proximate Optimality Principle Based Tabu Search", IEEJ Transactions on Electronics, Information and Systems, Vol.124, No.3, pp.912-920, 2004.
8. Yanagiura, M. and Ibaraki, T., "On Metaheuristic Algorithms for Combinatorial Optimization Problems", Transactions of the IEICE, Vol.J85-D-II, No.8, pp.3-25, 2000.
9. Feo, T.A., Recende, M.G.C., and Smith S. H., "A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set", Operations Research, Vol. 42, No.5, pp.860-878, 1994.
10. Kubota, S., Onoyama, T., Onayagi, K. and Tsuruta, S., "Traveling Salesman Problem Solving Method fit for Interactive Repetitive Simulation of Large-scale Distribution Network", Proc. IEEE SMC'99, pp.533-538, 1999.
11. Nagata, Y. and Kobayashi, S., "The Proposal and Evaluation of a Crossover for Traveling Salesman Problems: Edge Assembly Crossover", Journal of Japan Society for AI, Vol.14, No.5, pp.848-859, 1999.
12. Whiteley, D. and Starkweather, T., "Scheduling Problem and Traveling Salesman: The Genetic Edge Recombination Operator", Proceeding of ICGA'89, pp.133-140, 1989.
13. Baraglia, R., Hidalgo, J.I., Perego, R., "A hybrid heuristic for the traveling salesman problem", IEEE Transactions on Evolutionary Computation, Vol.5, Issue 6, pp.613-622, 2001.
14. Nguyen, H.D., Yoshihara, I., Yamamori, K., Yasunaga, M., "Implementation of an Effective Hybrid GA for Large-Scale Traveling Salesman Problems", IEEE Transactions on Systems, Man and Cybernetics, Part.B, Vol.37, Issue. 1, pp.92-99, 2007.
15. Cheng, C., Lee, W., Wong, K., "A genetic algorithm-based clustering approach for database partitioning", IEEE Transactions on Systems, Man and Cybernetics, Part C, Vol.32, Issue 3, pp.215-230, 2002.
16. Yan, X., Liu, H., Yan, J., Wu, Q., "A Fast Evolutionary Algorithm for Traveling Salesman Problem", Proc. of Third International Conference on Natural Computation (ICNC 2007), Vol.4, pp.85-90, 2007.
17. JLUG, "Benchmark - JLUG RC5-72 Cracking", http://www.orange.co. jp/~masaki/rc572/, 2008.