Open Science Research Excellence

Open Science Index

Commenced in January 2007 Frequency: Monthly Edition: International Publications Count: 30320

Select areas to restrict search in scientific publication database:
Discriminant Analysis as a Function of Predictive Learning to Select Evolutionary Algorithms in Intelligent Transportation System
In this paper, we present the use of the discriminant analysis to select evolutionary algorithms that better solve instances of the vehicle routing problem with time windows. We use indicators as independent variables to obtain the classification criteria, and the best algorithm from the generic genetic algorithm (GA), random search (RS), steady-state genetic algorithm (SSGA), and sexual genetic algorithm (SXGA) as the dependent variable for the classification. The discriminant classification was trained with classic instances of the vehicle routing problem with time windows obtained from the Solomon benchmark. We obtained a classification of the discriminant analysis of 66.7%.
Digital Object Identifier (DOI):


[1] Huberty, C.J., Applied Discriminant Analysis, Wiley Interscience, New York, 1994.
[2] Rascón Chávez, O., Introduction of descriptive statistics. Editorial UNAM, 1983.
[3] Fisher, R.A., The use of multiple measurements in taxonomic problems. Annals of Eugenics Vol. 7, 1936, 179-188.
[4] Kantardzicv, M.M., Data mining: Concepts, Models, Methods, and Algorithms. Wiley IEEE Press, 2002.
[5] Mitchell, M., An Introduction to Genetic Algorithms. MIT Press, England, 1998.
[6] Rechenberg, I., Evolution Strategy, Frommann-Holzboog, Stuttgart, 1994
[7] Fogel, L., Owens, A., Walsh, M., Artificial intelligence through simulated evolution. Wiley, 1966.
[8] Cramer, N., A representation for the adaptive generation of simple sequential programs. In Proceedings of the International Conference on Genetic Algorithms and their Applications, 183-187, 1985.
[9] Koza, J.R. Genetic Programming: On Programming Computers by Means of Natural Selection and Genetics. MIT Press, Cambridge, MA, 1992.
[10] Holland, J.H., Adaptation in Natural and Artificial Systems. University of Michigan Press. Ann Arbor, 1975.
[11] Lederberg J., Tatum, E.L., “Novel Genotypes in mixed Cultures of Biochemical Mutants of Bacteria”. Cold Spring Harbor Symposia of Quantitative Biology Vol. 11, 1946.
[12] Cook, S.A., “The Complexity of Theorem Proving Procedures”, Proceedings of 3rd ACM Symposium on Theory of Computing, pp. 151-158, Shaker Heights, Ohio, United States, May 03–05, 1971, ACM, New York, NY, USA
[13] Garey, M.R. and Johnson, D.S., Computers and Intractability, a Guide to the Theory of NP-completeness. W. H. Freeman and Company, New York, 1979.
[14] Toth, P. and Vigo, D., The Vehicle Routing Problem. Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia, 2001.
[15] Solomon, M.M., “Algorithms for Vehicle Routing and Scheduling Problems with Time Window Constrains”, Operations Research Vol. 35 No. 2, pp. 254-265, 1987.
[16] Sussman, J.M., Perspectives on Intelligent Transportation Systems (ITS), Springer Verlag, 2005, ISBN: 978-0-387-23257-7
[17] Fink, E., “How to Solve it Automatically, Selection among Problem-solving Methods”. Proceedings of the Fourth International Conference on AI Planning Systems AIPS'98, pp. 128-136, 1998.
[18] Cruz-Reyes, L., Classification of heuristics algorithms for the solution of Bin Packing Problem, Ph. D Thesis. Centro Nacional de Investigación y Desarrollo Tecnológico, 2004.
[19] Soares, C. and Brazdil, P., “Zoomed Ranking, Selection of Classification Algorithms Based on Relevant Performance Information”, Principles of Data Mining in Knowledge Discovery 4th European Conference (PKDD 2000), LNAI 1910, Springer Verlag, Berlin Heidelberg New York, pp. 126-135, 2000.
[20] Blanton, J. and Wainwright, R.L., “Multiple Vehicle Routing with Time and Capacity Constrainst using Genetic Algorithms”, Proceedings of the Fifth International Conference on Genetic Algorithms, Morgan Kaufmann Publishers Inc. San Francisco, CA, USA, pp. 452-459, 1993.
[21] Thangiah, S.R., “Genetic Algorithms, Tabu Search and Simulated Annealing Methods for Vehicle Routing Problems with Time Windows”, Practical Handbook of Genetic Algorithms: Complex Structures. L. Chambers Ed. CRC Press, 1998.
[22] Michie, D., Spiegelhalter, D.J. and Taylor, C.C., Machine Learning, Neural and Statistical Classification. Publisher Ellis Horwood, 1994.
[23] Affenzeller, M., “New Generic Hybrids Based Upon Genetic Algorithms”, Advances in Artificial Intelligence. In IBERAMIA 2002, Lecture Notes in Artificial Intelligence 2527, Springer-Verlag, pp. 329-339, 2002.
[24] Dantzing, G.B. and Ramser, J.H., “The truck Dispatching Problem”. Management Science Vol. 6 No. 80, 1959.
[25] Lis, J., Eiben, A., “A Multi-Sexual Genetic Algorithm for Multi-Objective Optimization”, Proceedings of 1996 International Conference on Evolutionary Computing, IEEE, T. Fukuda, and T. Furuhashi (editors), Nagoyo, Japan, 1996, 59-64
[26] Wagner, S. and Affenzeller, M., “HeuristicLab: A Generic and Extensible Optimization Environment”, Adaptive and Natural Computing Algorithms. Springer, Computer Science, pp. 538-541, 2005.
[27] SPSS, Inc. Headquarters, Chicago, Illinois.
Vol:14 No:02 2020Vol:14 No:01 2020
Vol:13 No:12 2019Vol:13 No:11 2019Vol:13 No:10 2019Vol:13 No:09 2019Vol:13 No:08 2019Vol:13 No:07 2019Vol:13 No:06 2019Vol:13 No:05 2019Vol:13 No:04 2019Vol:13 No:03 2019Vol:13 No:02 2019Vol:13 No:01 2019
Vol:12 No:12 2018Vol:12 No:11 2018Vol:12 No:10 2018Vol:12 No:09 2018Vol:12 No:08 2018Vol:12 No:07 2018Vol:12 No:06 2018Vol:12 No:05 2018Vol:12 No:04 2018Vol:12 No:03 2018Vol:12 No:02 2018Vol:12 No:01 2018
Vol:11 No:12 2017Vol:11 No:11 2017Vol:11 No:10 2017Vol:11 No:09 2017Vol:11 No:08 2017Vol:11 No:07 2017Vol:11 No:06 2017Vol:11 No:05 2017Vol:11 No:04 2017Vol:11 No:03 2017Vol:11 No:02 2017Vol:11 No:01 2017
Vol:10 No:12 2016Vol:10 No:11 2016Vol:10 No:10 2016Vol:10 No:09 2016Vol:10 No:08 2016Vol:10 No:07 2016Vol:10 No:06 2016Vol:10 No:05 2016Vol:10 No:04 2016Vol:10 No:03 2016Vol:10 No:02 2016Vol:10 No:01 2016
Vol:9 No:12 2015Vol:9 No:11 2015Vol:9 No:10 2015Vol:9 No:09 2015Vol:9 No:08 2015Vol:9 No:07 2015Vol:9 No:06 2015Vol:9 No:05 2015Vol:9 No:04 2015Vol:9 No:03 2015Vol:9 No:02 2015Vol:9 No:01 2015
Vol:8 No:12 2014Vol:8 No:11 2014Vol:8 No:10 2014Vol:8 No:09 2014Vol:8 No:08 2014Vol:8 No:07 2014Vol:8 No:06 2014Vol:8 No:05 2014Vol:8 No:04 2014Vol:8 No:03 2014Vol:8 No:02 2014Vol:8 No:01 2014
Vol:7 No:12 2013Vol:7 No:11 2013Vol:7 No:10 2013Vol:7 No:09 2013Vol:7 No:08 2013Vol:7 No:07 2013Vol:7 No:06 2013Vol:7 No:05 2013Vol:7 No:04 2013Vol:7 No:03 2013Vol:7 No:02 2013Vol:7 No:01 2013
Vol:6 No:12 2012Vol:6 No:11 2012Vol:6 No:10 2012Vol:6 No:09 2012Vol:6 No:08 2012Vol:6 No:07 2012Vol:6 No:06 2012Vol:6 No:05 2012Vol:6 No:04 2012Vol:6 No:03 2012Vol:6 No:02 2012Vol:6 No:01 2012
Vol:5 No:12 2011Vol:5 No:11 2011Vol:5 No:10 2011Vol:5 No:09 2011Vol:5 No:08 2011Vol:5 No:07 2011Vol:5 No:06 2011Vol:5 No:05 2011Vol:5 No:04 2011Vol:5 No:03 2011Vol:5 No:02 2011Vol:5 No:01 2011
Vol:4 No:12 2010Vol:4 No:11 2010Vol:4 No:10 2010Vol:4 No:09 2010Vol:4 No:08 2010Vol:4 No:07 2010Vol:4 No:06 2010Vol:4 No:05 2010Vol:4 No:04 2010Vol:4 No:03 2010Vol:4 No:02 2010Vol:4 No:01 2010
Vol:3 No:12 2009Vol:3 No:11 2009Vol:3 No:10 2009Vol:3 No:09 2009Vol:3 No:08 2009Vol:3 No:07 2009Vol:3 No:06 2009Vol:3 No:05 2009Vol:3 No:04 2009Vol:3 No:03 2009Vol:3 No:02 2009Vol:3 No:01 2009
Vol:2 No:12 2008Vol:2 No:11 2008Vol:2 No:10 2008Vol:2 No:09 2008Vol:2 No:08 2008Vol:2 No:07 2008Vol:2 No:06 2008Vol:2 No:05 2008Vol:2 No:04 2008Vol:2 No:03 2008Vol:2 No:02 2008Vol:2 No:01 2008
Vol:1 No:12 2007Vol:1 No:11 2007Vol:1 No:10 2007Vol:1 No:09 2007Vol:1 No:08 2007Vol:1 No:07 2007Vol:1 No:06 2007Vol:1 No:05 2007Vol:1 No:04 2007Vol:1 No:03 2007Vol:1 No:02 2007Vol:1 No:01 2007