Abstract
In recent years, the interest to solve dynamic combinatorial optimization problems has increased. Metaheuristic algorithms have been used to find good solutions in a reasonably low time, in addition, the use of self-adaptive strategies has increased considerably because they have proved to be a good option to improve performance in these algorithms. In this research, a self-adaptive mechanism is developed to improve the performance of the genetic algorithm for dynamic combinatorial problems, using the strategy of genotype-phenotype mapping and probabilistic distributions. Results demonstrate the capability of the mechanism to help algorithms to adapt in dynamic environments.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Majid, Y., Esmaile, K.: Solving the vehicle routing problem by a hybrid metaheuristic algorithm. J. Ind. Eng. Int. 8, 11 (2012). https://doi.org/10.1186/2251-712X-8-11
Yang, S., Nguyen, T.T., Li, C.: Evolutionary dynamic optimization: test and evaluation environments. In: Yang, S., Yao, X. (eds.) Evolutionary Computation for Dynamic Optimization Problems. SCI, vol. 490, pp. 3–37. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-38416-5_1
Yang, S., Yao, X.: Evolutionary Computation for Dynamic Optimization Problems. Springer, Heidelberg (2013). eBook ISBN 978-3-642-38416-5
Liu, H., Pretorius, L., Jiang, D.: Optimization of cold chain logistics distribution network terminal. EURASOP J. Wirel. Commun. Netw. 2018, 158 (2018). https://doi.org/10.1186/s13638-018-1168-4
Cepolina, E.M., Farina, A.: A new urban freight distribution scheme and an optimization methodology for reducing its overall cost. Eur. Transp. Res. Rev. 7, 1 (2014). https://doi.org/10.1007/s12544-014-0149-x
Razi, F.F.: A hybrid DEA-based K-means and invasive weed optimization for facility location problem. J. Ind. Eng. Int. (2018). https://doi.org/10.1007/s40092-018-0283-5
Kumar, V.M., Murthy, A., Chandrashekara, K.: A hybrid algorithm optimization approach for machine loading problem in flexible manufacturing system. J. Ind. Eng. Int. 8, 3 (2012). https://doi.org/10.1186/2251-712X-8-3
Tayyab, M., Sarkar, B., Yahya, B.N.: Imperfect multi-stage lean manufacturing system with rework under fuzzy demand. Mathematics 7, 13 (2019). https://doi.org/10.3390/math7010013
Khorasgani, S.S., Ghaffari, M.: Developing a cellular manufacturing model considering the alternative routes, tool assignment, and machine reliability. J. Ind. Eng. Int. 14, 627 (2018). https://doi.org/10.1007/s40092-017-0239-1
Yang, S., Jiang, Y., Nguyen, T.T.: Metaheuristics for dynamic combinatorial optimization problems. IMA J. Manag. Math. 24(4) (2012). https://doi.org/10.1093/imaman/dps021
Li, C., Yang, M., Kang, L.: A new approach to solving dynamic traveling salesman problems. In: Wang, T.-D., Li, X., Chen, S.-H., Wang, X., Abbass, H., Iba, H., Chen, G.-L., Yao, X. (eds.) SEAL 2006. LNCS, vol. 4247, pp. 236–243. Springer, Heidelberg (2006). https://doi.org/10.1007/11903697_31
Volling, T., Grunewald, M., Spengler, T.S.: An integrated inventory-transportation system with periodic pick-ups and leveled replenishment. Bus. Res. 6, 173 (2013). https://doi.org/10.1007/BF03342748
Gilberto Pérez Lechuga: Optimal logistics strategy to distribute medicines in clinics and hospitals. J. Math. Ind. 8, 2 (2018). https://doi.org/10.1186/s13362-018-0044-5
Henn, S., Koch, S., Doerner, K.F., et al.: Metaheuristics for the order batching problem in manual order picking systems. Bus. Res. 3, 82 (2010). https://doi.org/10.1007/BF03342717
Srikakulapu, R., Vinatha, U.: Optimized design of collector topology for offshore wind farm based on ant colony optimization with multiple travelling salesman problem. J. Mod. Power Syst. Clean Energy 6, 1181 (2018). https://doi.org/10.1007/s40565-018-0386-4
Moslemipour, G.: A hybrid CS-SA intelligent approach to solve uncertain dynamic facility layout problems considering dependency of demands. J. Ind. Eng. Int. 14, 429 (2018). https://doi.org/10.1007/s40092-017-0222-x
Holland, J.H.: Adaptation in natural and artificial systems. Master’s thesis, University of Michigan Press, Ann Arbor, MI (1975)
Liao, Y.-H., Sun, C.-T.: An Educational Genetic Algorithms Learning Tool (2001). http://www.ewh.ieee.org/soc/es/May2001/14/Begin.htm. Accessed 2016
Bonilla Vera, J.A., Mora-Vargas, J., González-Mendoza, M., López Sánchez, I.A., Montiel Moctezuma, C.J.: Brief review of techniques used to develop adaptive evolutionary algorithms. Open Cybern. Syst. J. 11, 1–12 (2017). https://doi.org/10.2174/1874110x01711010001
Deb, K., Beyer, H.-G.: Self-adaptation in real-parameter genetic algorithms with simulated binary crossover. In: GECCO, pp. 172–179 (1999)
Esquivel, S.C., Leiva, H.A., Gallard, R.H.: Self adaptation of parameters for MCPC in genetic algorithms. J. Comput. Sci. Technol. 2, 1–8 (2000)
Kita, H.: A comparison study of self-adaptation in evolution strategies and real-coded genetic algorithms. Evol. Comput. 9, 223–241 (2001)
Cheng, H., Yang, S.: Genetic algorithms for dynamic routing problems in mobile ad hoc networks. In: Yang, S., Yao, X. (eds.) Evolutionary Computation for Dynamic Optimization Problems. SCI, vol. 490, pp. 343–375. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-38416-5_14
Vera, J.A.B.: Investigación del rol del mapeo genotipo-fenotipo y del operador de mutación en algoritmos genéticos aplicados a problemas dinámicos. Master’s thesis, Tecnologico de Monterrey, Mexico (2011)
Keller, R.E., Banzhaf, W.: Genetic programming using genotype-phenotype mapping from linear genomes into linear phenotypes. In: Proceedings of the First Annual Conference on Genetic Programming, pp. 116–122 (1996). ISBN 0-262-61127-9
Mora, J., Stephens, C., Waelbroeck, H.: Symmetry breaking and adaptation: evidence from a toy model of a virus. Biosystems 51, 1–14 (1997). https://doi.org/10.1016/S0303-2647(98)00093-8
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Appendix A
Appendix A
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Montiel Moctezuma, C.J., Mora, J., Gonzalez-Mendoza, M. (2019). Solving Dynamic Combinatorial Optimization Problems Using a Probabilistic Distribution as Self-adaptive Mechanism in a Genetic Algorithm. In: Martínez-Villaseñor, L., Batyrshin, I., Marín-Hernández, A. (eds) Advances in Soft Computing. MICAI 2019. Lecture Notes in Computer Science(), vol 11835. Springer, Cham. https://doi.org/10.1007/978-3-030-33749-0_27
Download citation
DOI: https://doi.org/10.1007/978-3-030-33749-0_27
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-33748-3
Online ISBN: 978-3-030-33749-0
eBook Packages: Computer ScienceComputer Science (R0)