SAMODS & SAGAMODS: Novel algorithms based on the Automata Theory for the Multiobjective Optimization of Combinatorial Problems

International Journal of Artificial Intelligence

Volumn 8, Issue 12 S, 2012, Pages 147-165

  Niño, Elias D ^a  

^a UNIVERSIDAD DEL NORTE   (Colombia)

Author keywords

Automata Theory; Combinatorial Optimization; Metaheuristics; Multiobjective Optimization

Indexed keywords

EID: 84863602996     PISSN: 09740635     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (14)

1. Bin, H. and Raidl, G. 2008. Solving the railway traveling salesman problem via a transformation into the classical traveling salesman problem, Eighth International Conference on Hybrid Intelligent Systems, 2008. HIS '08., Barcelona, Spain, pp. 73-77.
2. Coello Coello, C. A., Van Veldhuizen, D. A. and Lamont, G. B. 2002. Evolutionary Algorithms for Solving Multi-objective Problems, Kluwer Academic Publishers.
3. Corne, D. and Knowles, J. 2003. Some multiobjective optimizers are better than others, The 2003 Congress on Evolutionary Computation, 2003. CEC '03., Vol. 4, Canberra, Australia, pp. 2506-2512 Vol.4.
4. Donoso, Y. and Fabregat, R. 2007. Multi-Objective Optimization in Computer Networks Using Metaheuristics, Aurbach Publications.
5. Fung R.Y.K. and Jun, Z. 2009. A multi-depot vehicle routing problem with weight-related costs, International Conference on Computers Industrial Engineering, 2009. CIE 2009., Troyes, Francia, pp. 1028-1033.
6. Gerhard, R. n.d. Tsplib-office research group discrete optimization-university of heidelberg, http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95/.
7. Lim, A. and Wang, F. 2005. Multi-depot vehicle routing problem: a one-stage approach, IEEE Transactions on Automation Science and Engineering 2(4): 397-402.
8. Niño, E. D., Ardila, C., Donoso, Y., Barrios, A. and Jabba, D. 2011. Mods: A novel metaheuristic of deterministic swapping for the multi objective optimization of combinatorials problems, Computer Technology and Application 2(4): 280-292.
9. Niño, E. D., Ardila, C., Donoso, Y. and Jabba, D. 2010. A novel algorithm based on deterministic finite automaton for solving the mono-objective symmetric traveling salesman problem, International Journal of Artificial Intelligence 5(A10): 101-108.
10. Oberlin, P., Rathinam, S. and Darbha, S. 2009. A transformation for a heterogeneous, multiple depot, multiple traveling salesman problem, American Control Conference, 2009. ACC '09., St. Louis, Missouri, USA, pp. 1292-1297.
11. Sauer, J. and Coelho, L. 2008. Discrete differential evolution with local search to solve the traveling salesman problem: Fundamentals and case studies, 7th IEEE International Conference on Cybernetic Intelligent Systems, 2008. CIS 2008., London, UK, pp. 1-6.
12. Shao-Qiang, W. and Zhong-Yu, X. 2009. Ant colony algorithm approach for solving traveling salesman with multi-agent, International Conference on Information Engineering, 2009. ICIE '09. WASE, Vol. 1, Washington. D.C., USA, pp. 381-384.
13. Yanling, W. and Maoxiang, L. 2008. Study on the model and tabu search algorithm for delivery and pickup vehicle routing problem with time windows, IEEE International Conference on Service Operations and Logistics, and Informatics, 2008. IEEE/SOLI 2008., Vol. 1, Beijing, China, pp. 1464-1469.
14. Yong-Fa, Q. and Ming-Yang, Z. 2004. Research on a new multiobjective combinatorial optimization algorithm, IEEE International Conference on Robotics and Biomimetics, 2004. ROBIO 2004., Shenyang, China, pp. 187-191.