Skip to main content
Erschienen in: Memetic Computing 1/2018

11.02.2017 | Regular Research Paper

Quantum-Inspired Immune Clonal Algorithm for solving large-scale capacitated arc routing problems

verfasst von: Ronghua Shang, Bingqi Du, Kaiyun Dai, Licheng Jiao, Amir M. Ghalamzan Esfahani, Rustam Stolkin

Erschienen in: Memetic Computing | Ausgabe 1/2018

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

In this paper, we present an approach to Large-Scale CARP called Quantum-Inspired Immune Clonal Algorithm (QICA-CARP). This algorithm combines the feature of artificial immune system and quantum computation ground on the qubit and the quantum superposition. We call an antibody of population quantum bit encoding, in QICA-CARP. For this encoding, to control the population with a high probability evolution towards a good schema we use the information on the current optimal antibody. The mutation strategy of quantum rotation gate accelerates the convergence of the original clone operator. Moreover, quantum crossover operator enhances the exchange of information and increases the diversity of the population. Furthermore, it avoids falling into local optimum. We also use the repair operator to amend the infeasible solutions to ensure the diversity of solutions. This makes QICA-CARP approximating the optimal solution. We demonstrate the effectiveness of our approach by a set of experiments and by Comparing the results of our approach with ones obtained with the RDG-MAENS and RAM using different test sets. Experimental results show that QICA-CARP outperforms other algorithms in terms of convergence rate and the quality of the obtained solutions. Especially, QICA-CARP converges to a better lower bound at a faster rate illustrating that it is suitable for solving large-scale CARP.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Shang RH, Wang J, Jiao LC, Wang YY (2014) An improved decomposition-based memetic algorithm for multi-objective capacitated arc routing problem. Appl Soft Comput 19(1):343–361CrossRef Shang RH, Wang J, Jiao LC, Wang YY (2014) An improved decomposition-based memetic algorithm for multi-objective capacitated arc routing problem. Appl Soft Comput 19(1):343–361CrossRef
2.
Zurück zum Zitat Wen XZ, Shao L, Xue Y, Fang W (2015) A rapid learning algorithm for vehicle classification. Inform Sci 295(1):395–406CrossRef Wen XZ, Shao L, Xue Y, Fang W (2015) A rapid learning algorithm for vehicle classification. Inform Sci 295(1):395–406CrossRef
3.
Zurück zum Zitat Mei Y, Tang K, Yao X (2011) Decomposition-based memetic algorithm for multi-objective capacitated arc routing problems. IEEE Trans Evolut Comput 15(2):151–165CrossRef Mei Y, Tang K, Yao X (2011) Decomposition-based memetic algorithm for multi-objective capacitated arc routing problems. IEEE Trans Evolut Comput 15(2):151–165CrossRef
4.
Zurück zum Zitat Shen J, Tan HW, Wang J, Wang JW, Lee SY (2015) A novel routing protocol providing good transmission reliability in underwater sensor networks. J Internet Technol 16(1):171–178 Shen J, Tan HW, Wang J, Wang JW, Lee SY (2015) A novel routing protocol providing good transmission reliability in underwater sensor networks. J Internet Technol 16(1):171–178
5.
Zurück zum Zitat Golden BL, DeArmon JS, Baker EK (1983) Computational experiments with algorithms for a class of routing problems. Comput Oper Res 10(1):47–59MathSciNetCrossRef Golden BL, DeArmon JS, Baker EK (1983) Computational experiments with algorithms for a class of routing problems. Comput Oper Res 10(1):47–59MathSciNetCrossRef
9.
Zurück zum Zitat Tan KC, Khor EF, Lee TH (2005) Multi-objective evolutionary algorithms and applications. Springer, BerlinMATH Tan KC, Khor EF, Lee TH (2005) Multi-objective evolutionary algorithms and applications. Springer, BerlinMATH
10.
Zurück zum Zitat Xia ZH, Wang XH, Sun XM, Wang Q (2015) A secure and dynamic multi-keyword ranked search scheme over encrypted cloud data. IEEE Trans Parallel Distrib Syst 27(2):340–352CrossRef Xia ZH, Wang XH, Sun XM, Wang Q (2015) A secure and dynamic multi-keyword ranked search scheme over encrypted cloud data. IEEE Trans Parallel Distrib Syst 27(2):340–352CrossRef
11.
Zurück zum Zitat Reed M, Yiannakou A, Evering R (2014) An ant colony algorithm for the multi-compartment vehicle routing problem. Appl Soft Comput 15:169–176CrossRef Reed M, Yiannakou A, Evering R (2014) An ant colony algorithm for the multi-compartment vehicle routing problem. Appl Soft Comput 15:169–176CrossRef
13.
Zurück zum Zitat Mei Y, Tang K, Yao X (2011) A memetic algorithm for periodic capacitated arc routing problem. IEEE Trans Syst Man Cybern B 41(6):1654–1667CrossRef Mei Y, Tang K, Yao X (2011) A memetic algorithm for periodic capacitated arc routing problem. IEEE Trans Syst Man Cybern B 41(6):1654–1667CrossRef
14.
Zurück zum Zitat Zheng YH, Jeon B, Xu DH, Wu QMJ, Zhang H (2015) Image segmentation by generalized hierarchical fuzzy C-means algorithm. J Intell Fuzzy Syst 28(2):961–973 Zheng YH, Jeon B, Xu DH, Wu QMJ, Zhang H (2015) Image segmentation by generalized hierarchical fuzzy C-means algorithm. J Intell Fuzzy Syst 28(2):961–973
15.
Zurück zum Zitat Goldbarg MC, Asconavieta PH (2012) Memetic algorithm for the traveling car renter problem: an experimental investigation. Memet Comput 4(2):89–108CrossRef Goldbarg MC, Asconavieta PH (2012) Memetic algorithm for the traveling car renter problem: an experimental investigation. Memet Comput 4(2):89–108CrossRef
16.
Zurück zum Zitat Feng L, Ong YS, Tan AH, Tsang IW (2015) Memes as building blocks: a case study on evolutionary optimization+transfer learning for routing problems. Memet Comput 7(3):159–180CrossRef Feng L, Ong YS, Tan AH, Tsang IW (2015) Memes as building blocks: a case study on evolutionary optimization+transfer learning for routing problems. Memet Comput 7(3):159–180CrossRef
17.
Zurück zum Zitat Hertz A, Laporte G, Mittaz M (2000) A tabu search heuristic for the capacitated arc routing problem. Oper Res 48(1):129–135MathSciNetCrossRefMATH Hertz A, Laporte G, Mittaz M (2000) A tabu search heuristic for the capacitated arc routing problem. Oper Res 48(1):129–135MathSciNetCrossRefMATH
18.
Zurück zum Zitat Hertz A, Mittaz M (2001) A variable neighborhood descent algorithm for the undirected capacitated arc routing problem. Trans Sci 35(4):425–434CrossRefMATH Hertz A, Mittaz M (2001) A variable neighborhood descent algorithm for the undirected capacitated arc routing problem. Trans Sci 35(4):425–434CrossRefMATH
19.
Zurück zum Zitat Lacomme P, Prins C, Ramdane-Cherif W (2004) Competitive memetic algorithms for arc routing problem. Ann Oper Res 131(1–4):159–185MathSciNetCrossRefMATH Lacomme P, Prins C, Ramdane-Cherif W (2004) Competitive memetic algorithms for arc routing problem. Ann Oper Res 131(1–4):159–185MathSciNetCrossRefMATH
20.
Zurück zum Zitat Shang RH, Jiao LC, Liu F (2012) A novel immune clonal algorithm for MO problems. IEEE Trans Evolut Comput 16(1):35–49CrossRef Shang RH, Jiao LC, Liu F (2012) A novel immune clonal algorithm for MO problems. IEEE Trans Evolut Comput 16(1):35–49CrossRef
21.
Zurück zum Zitat Gong M, Liu C, Jiao L, Cheng G (2010) Hybrid immune algorithm with Lamarckian local search for multi-objective optimization. Memet Comput 2(1):47–67CrossRef Gong M, Liu C, Jiao L, Cheng G (2010) Hybrid immune algorithm with Lamarckian local search for multi-objective optimization. Memet Comput 2(1):47–67CrossRef
22.
Zurück zum Zitat Tang K, Mei Y, Yao X (2009) Memetic algorithm with extended neighborhood search for capacitated arc routing problems. IEEE Trans Evolut Comput 13(5):1151–1166CrossRef Tang K, Mei Y, Yao X (2009) Memetic algorithm with extended neighborhood search for capacitated arc routing problems. IEEE Trans Evolut Comput 13(5):1151–1166CrossRef
23.
Zurück zum Zitat Mei Y, Li XD, Yao X (2014) Cooperative co-evolution with route distance grouping for large-scale capacitated arc routing problems. IEEE Trans Evolut Comput 18(3):435–449CrossRef Mei Y, Li XD, Yao X (2014) Cooperative co-evolution with route distance grouping for large-scale capacitated arc routing problems. IEEE Trans Evolut Comput 18(3):435–449CrossRef
24.
Zurück zum Zitat Tonda A, Lutton E, Squillero G (2012) A benchmark for cooperative coevolution. Memet Comput 4(4):263–277CrossRef Tonda A, Lutton E, Squillero G (2012) A benchmark for cooperative coevolution. Memet Comput 4(4):263–277CrossRef
25.
Zurück zum Zitat Nguyen ML, Hui SC, Fong ACM (2012) Divide-and-conquer memetic algorithm for online multi-objective test paper generation. Memet Comput 4(1):33–47CrossRef Nguyen ML, Hui SC, Fong ACM (2012) Divide-and-conquer memetic algorithm for online multi-objective test paper generation. Memet Comput 4(1):33–47CrossRef
26.
Zurück zum Zitat Shang RH, Wang YY, Wang J, Jiao LC, Wang S, Qi LP (2014) A multi-population cooperative coevolutionary algorithm for multi-objective capacitated arc routing problem. Inform Sci 27(7):609–642MathSciNetCrossRefMATH Shang RH, Wang YY, Wang J, Jiao LC, Wang S, Qi LP (2014) A multi-population cooperative coevolutionary algorithm for multi-objective capacitated arc routing problem. Inform Sci 27(7):609–642MathSciNetCrossRefMATH
28.
Zurück zum Zitat Marinaki M, Marinakis Y (2015) A hybridization of clonal selection algorithm with iterated local search and variable neighborhood search for the feature selection problem. Memet Comput 7(3):181–201CrossRef Marinaki M, Marinakis Y (2015) A hybridization of clonal selection algorithm with iterated local search and variable neighborhood search for the feature selection problem. Memet Comput 7(3):181–201CrossRef
29.
Zurück zum Zitat De Castro LN, Von Zuben FJ (2002) Learning and optimization using the clonal selection principle. IEEE Trans Evolut Comput 6(3):239–251CrossRef De Castro LN, Von Zuben FJ (2002) Learning and optimization using the clonal selection principle. IEEE Trans Evolut Comput 6(3):239–251CrossRef
30.
Zurück zum Zitat Jiao LC, Li YY, Gong MG, Zhang XR (2008) Quantum-inspired immune clonal algorithm for global optimization. IEEE Trans Syst Man Cybern B (Cybernetics) 38(5):1234–1253CrossRef Jiao LC, Li YY, Gong MG, Zhang XR (2008) Quantum-inspired immune clonal algorithm for global optimization. IEEE Trans Syst Man Cybern B (Cybernetics) 38(5):1234–1253CrossRef
31.
Zurück zum Zitat Li YY, Jiao LC (2005) Quantum-inspired immune clonal algorithm. In: Proceedings of the 4th international conference on artificial immune systems, Banff, pp 304–317 Li YY, Jiao LC (2005) Quantum-inspired immune clonal algorithm. In: Proceedings of the 4th international conference on artificial immune systems, Banff, pp 304–317
32.
Zurück zum Zitat Handa H, Chapman L, Yao X (2006) Robust route optimization for gritting/salting trucks: a CERCIA experience. IEEE Comput Intell Mag 1(1):6–9CrossRef Handa H, Chapman L, Yao X (2006) Robust route optimization for gritting/salting trucks: a CERCIA experience. IEEE Comput Intell Mag 1(1):6–9CrossRef
33.
Zurück zum Zitat Mei Y, Tang K, Yao X (2009) A global repair operator for capacitated arc routing problem. IEEE Trans Syst Man Cyber B 39(3):723–734CrossRef Mei Y, Tang K, Yao X (2009) A global repair operator for capacitated arc routing problem. IEEE Trans Syst Man Cyber B 39(3):723–734CrossRef
34.
Zurück zum Zitat Wang ZR, Jin HY, Tian MM (2015) Rank-based memetic algorithm for capacitated arc routing problems. Appl Soft Comput 37:572–584CrossRef Wang ZR, Jin HY, Tian MM (2015) Rank-based memetic algorithm for capacitated arc routing problems. Appl Soft Comput 37:572–584CrossRef
Metadaten
Titel
Quantum-Inspired Immune Clonal Algorithm for solving large-scale capacitated arc routing problems
verfasst von
Ronghua Shang
Bingqi Du
Kaiyun Dai
Licheng Jiao
Amir M. Ghalamzan Esfahani
Rustam Stolkin
Publikationsdatum
11.02.2017
Verlag
Springer Berlin Heidelberg
Erschienen in
Memetic Computing / Ausgabe 1/2018
Print ISSN: 1865-9284
Elektronische ISSN: 1865-9292
DOI
https://doi.org/10.1007/s12293-017-0224-7

Weitere Artikel der Ausgabe 1/2018

Memetic Computing 1/2018 Zur Ausgabe

Editorial

Editorial