A Multi-inner-world genetic algorithm to optimize delivery problem with interactive-time

4th IEEE Conference on Automation Science and Engineering, CASE 2008

Volumn , Issue , 2008, Pages 583-590

  Sakurai, Y ^a   Onoyama, T ^b   Kubota, S ^b   Tsuruta, S ^a  

^a TOKYO DENKI UNIVERSITY   (Japan)

^b HITACHI LTD   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; TRAVELING SALESMAN PROBLEM;

DELIVERY PROBLEMS; DELIVERY ROUTES; INNER WORLDS; INTERACTIVE; INTERACTIVE RESPONSE TIMES; REAL TIMES; TRAVELING SALESMAN; TWO TYPES;

GENETIC ALGORITHMS;

EID: 54949105473     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/COASE.2008.4626556     Document Type: Conference Paper

References (29)

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. Kolen, A., and Pesch, E., "Genetic Local Search in Combinatorial Optimization", Discrete Applied Mathematics, Vol.48, pp.273-284, 1994.
3. Yamamoto, Y., and Kubo, M., "Invitation to Traveling Salesman Problem", Asakura Syoten, Tokyo, 1997.
4. Grotschel, M., and Holland, O., "Solution of large-scale symmetric traveling salesman problems", Mathematical Programming, Vol.51, pp.141-202, 1991.
5. Bertsekas, D. P., "Dynamic Programming: Deterministic and Stochastic Models", Englewood Cliffs, NJ: Prentice-Hall, 1987.
6. Kirkpatrick, S., and Gelatt, C. D. and Vecchi, M. P., "Optimization by Simulated Annealing", Science, Vol 220, Number 4598, pp. 671-680, 1983.
7. Ingber, L., "Simulated Annealing Practice versus Theory", Journal of Mathl. Comput. and Modelling, Val 18, No. 11, pp 29-57, 1993.
8. Miki, M., Hiroyasu, T, Jitta, T., "Adaptive Simulated Annealing for maximum temperature", Systems, Man and Cybernetics, 2003. IEEE International Conference, vol.1, pp.20-25, 2003.
9. Glover, F., "Tabu Search - Part I", ORSA Journal on Computing, 1, pp. 190-206, 1989.
10. Glover, F. "Tabu Search - Part II", ORSA Journal on Computing, 2, pp4-32, 1990.
11. Hooker, J.H. and Natraj, N.R., "Solving a General Routing and Scheduling Problem by Chain Decomposition and Tabu Search", Transportation Science, Vol.29, No.1, pp.30-44, 1995.
12. 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.
13. 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.
14. 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.
15. Onoyama, T., Kubota, S., Oyanagi, K. and Tsuruta, S., "A Method for Solving Nested Combinatorial Optimization Problems" , Proc. IEEE SMC2000, pp.340-345, 2000.
16. Laporte, G., "The Vehicle Routing Problem: An overview of exact and approximate algorithms", European Journal of Operational Research, Vol.59, pp.345-358, 1992.
17. 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.
18. Whiteley, D. and Starkweather, T., "Scheduling Problem and Traveling Salesman: The Genetic Edge Recombination Operator", Proceeding of ICGA'89, pp.133-140, 1989.
19. Arora, S., "Polynomial Time Approximation Schemes for Euclidean TSP and Other Geometric Problems", Journal of the ACM, Vol. 45, No.5, pp.753-782, 1998.
20. 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.
21. 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.
22. 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.
23. Tamaki, H., et al.; "A comparison study of genetic codings for the traveling salesman problem", Proceedings of the 1st IEEE Conference on Evolutionary Computation, pp. 1-6, 1994.
24. 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.
25. Tsai, H., Yang, J., Tsai, Y., and Kao, C., "An evolutionary algorithm for large traveling salesman problems", IEEE Transactions on Systems, Man and Cybernetics, Part.B, Vol.34, Issue.4, pp.1718-1729, 2004.
26. 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.
27. 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.
28. 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.
29. JLUG, "Benchmark - JLUG RC5-72 Cracking", http://www.orange.co. jp/̃masaki/rc572/