GAPN-LA: A framework for solving graph problems using Petri nets and learning automata
A fusion of learning automata and Petri nets, referred to as APN-LA, has been recently introduced in the literature for achieving adaptive Petri nets. A number of extensions to this adaptive Petri net have also been introduced; together we name them the APN-LA family. Members of this family can be u...
Uložené v:
| Vydané v: | Engineering applications of artificial intelligence Ročník 77; s. 255 - 267 |
|---|---|
| Hlavní autori: | , , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Elsevier Ltd
01.01.2019
|
| Predmet: | |
| ISSN: | 0952-1976, 1873-6769 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | A fusion of learning automata and Petri nets, referred to as APN-LA, has been recently introduced in the literature for achieving adaptive Petri nets. A number of extensions to this adaptive Petri net have also been introduced; together we name them the APN-LA family. Members of this family can be utilized for solving problems in the domain of graph problems; each member is suitable for a specific category within this domain. In this paper, we aim at generalizing this family into a single framework, called generalized APN-LA (GAPN-LA), which can be considered as a framework for solving graph-based problems. This framework is an adaptive Petri net, organized into a graph structure. Each place or transition in the underlying Petri net is mapped into exactly one vertex of the graph, and each vertex of the graph represents a part of the underlying Petri net. A vertex in GAPN-LA can be considered as a module, which, in cooperation with other modules in the framework, helps in solving the problem at hand. To elaborate the problem-solving capability of the GAPN-LA, several graph-based problems have been solved in this paper using the proposed framework. |
|---|---|
| AbstractList | A fusion of learning automata and Petri nets, referred to as APN-LA, has been recently introduced in the literature for achieving adaptive Petri nets. A number of extensions to this adaptive Petri net have also been introduced; together we name them the APN-LA family. Members of this family can be utilized for solving problems in the domain of graph problems; each member is suitable for a specific category within this domain. In this paper, we aim at generalizing this family into a single framework, called generalized APN-LA (GAPN-LA), which can be considered as a framework for solving graph-based problems. This framework is an adaptive Petri net, organized into a graph structure. Each place or transition in the underlying Petri net is mapped into exactly one vertex of the graph, and each vertex of the graph represents a part of the underlying Petri net. A vertex in GAPN-LA can be considered as a module, which, in cooperation with other modules in the framework, helps in solving the problem at hand. To elaborate the problem-solving capability of the GAPN-LA, several graph-based problems have been solved in this paper using the proposed framework. |
| Author | Rezvanian, A. Vahidipour, S.M. Meybodi, M.R. Esnaashari, M. |
| Author_xml | – sequence: 1 givenname: S.M. surname: Vahidipour fullname: Vahidipour, S.M. email: vahidipour@kashanu.ac.ir organization: Faculty of Electrical and Computer Engineering, Department of Computer, University of Kashan, Kashan, Iran – sequence: 2 givenname: M. surname: Esnaashari fullname: Esnaashari, M. email: esnaashari@kntu.ac.ir organization: Faculty of Computer Engineering, K. N. Toosi University of Technology, Tehran, Iran – sequence: 3 givenname: A. surname: Rezvanian fullname: Rezvanian, A. email: a.rezvanian@aut.ac.ir organization: School of Computer Science, Institute for Research in Fundamental Sciences (IPM), Tehran, Iran – sequence: 4 givenname: M.R. surname: Meybodi fullname: Meybodi, M.R. email: mmeybodi@aut.ac.ir organization: Soft Computing Lab, Computer Engineering and Information Technology Department, Amirkabir University of Technology, Tehran, Iran |
| BookMark | eNqFkF9LwzAUR4MouE2_guQLdCb9k7big2PoFIbuQX0tt8ntzOySkmQTv70t0xdf9nThwPnBPWNyaqxBQq44m3LGxfVmimYNXQd6GjNe9HDKeHJCRrzIk0jkojwlI1ZmccTLXJyTsfcbxlhSpGJE3hez1XO0nN3QGW0cbPHLuk_aWEe9bffarOnaQfdBO2frFree7vwAVxicpgaDp2AUbRGcGTjsgt1CgAty1kDr8fL3Tsjbw_3r_DFaviye5rNlJBPBQlSXPJaZirOax5nAAlKWNyoGIZRkUqg0gRxR5k0NRcOEiqVMk7KGRoHikMTJhNwedqWz3jtsKqkDBG1NcKDbirNqaFRtqr9G1dBo4H2jXhf_9M7pLbjv4-LdQcT-ub1GV3mp0UhU2qEMlbL62MQPnvyJAA |
| CitedBy_id | crossref_primary_10_1016_j_knosys_2020_106638 crossref_primary_10_1109_ACCESS_2019_2899316 crossref_primary_10_1109_LSP_2019_2917495 crossref_primary_10_1080_17445760_2025_2490148 crossref_primary_10_1007_s11227_019_03085_0 crossref_primary_10_1016_j_procs_2024_02_052 |
| Cites_doi | 10.1109/CASoN.2012.6412388 10.1016/0020-0255(87)90021-1 10.1007/s11277-010-9936-4 10.1007/s10489-011-0292-1 10.1007/s002360050065 10.1109/TSMC.2015.2444414 10.4018/jamc.2010070101 10.1142/S0218213015500232 10.1080/01969722.2015.1082407 10.1109/TSMC.1987.6499323 10.1007/s11227-010-0484-1 10.1142/S0218488515500014 10.1142/S0219525904000202 10.1007/s10489-014-0577-2 10.1080/01969722.2012.637012 10.1080/01969722.2013.803391 10.1109/TCYB.2014.2356591 10.1007/s12293-016-0183-4 10.1016/j.asoc.2011.02.017 10.1007/s10489-016-0831-x 10.1016/j.eswa.2011.01.098 10.1109/3468.485749 10.1109/5.24143 10.1007/s10489-017-0987-z 10.3103/S0146411613070262 10.1007/978-1-4684-2001-2_9 10.1109/TCYB.2014.2309478 10.1142/S0218488517500180 10.1109/TSMC.2015.2406764 10.1142/S0218488510006775 10.1002/dac.976 10.1109/12.485372 10.1142/S0218488506004217 10.1006/inco.1994.1100 10.1016/j.ins.2012.02.057 |
| ContentType | Journal Article |
| Copyright | 2018 Elsevier Ltd |
| Copyright_xml | – notice: 2018 Elsevier Ltd |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.engappai.2018.10.013 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Applied Sciences Computer Science |
| EISSN | 1873-6769 |
| EndPage | 267 |
| ExternalDocumentID | 10_1016_j_engappai_2018_10_013 S0952197618302124 |
| GroupedDBID | --K --M .DC .~1 0R~ 1B1 1~. 1~5 29G 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABBOA ABMAC ABXDB ABYKQ ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADJOM ADMUD ADTZH AEBSH AECPX AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q GBLVA GBOLZ HLZ HVGLF HZ~ IHE J1W JJJVA KOM LG9 LY7 M41 MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 R2- RIG ROL RPZ SBC SDF SDG SDP SES SET SEW SPC SPCBC SST SSV SSZ T5K TN5 UHS WUQ ZMT ~G- 9DU AATTM AAXKI AAYWO AAYXX ABJNI ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD |
| ID | FETCH-LOGICAL-c360t-b912c5d25b1256e8a407fd2a66dc0c6d43a7eec7fba8f06d2cc439bafdad1a323 |
| ISICitedReferencesCount | 7 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000452945300020&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0952-1976 |
| IngestDate | Tue Nov 18 22:39:53 EST 2025 Sat Nov 29 02:17:58 EST 2025 Fri Feb 23 02:28:55 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Modular algorithms Graph-based problems Adaptive Petri net Learning automata |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c360t-b912c5d25b1256e8a407fd2a66dc0c6d43a7eec7fba8f06d2cc439bafdad1a323 |
| PageCount | 13 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_engappai_2018_10_013 crossref_primary_10_1016_j_engappai_2018_10_013 elsevier_sciencedirect_doi_10_1016_j_engappai_2018_10_013 |
| PublicationCentury | 2000 |
| PublicationDate | January 2019 2019-01-00 |
| PublicationDateYYYYMMDD | 2019-01-01 |
| PublicationDate_xml | – month: 01 year: 2019 text: January 2019 |
| PublicationDecade | 2010 |
| PublicationTitle | Engineering applications of artificial intelligence |
| PublicationYear | 2019 |
| Publisher | Elsevier Ltd |
| Publisher_xml | – name: Elsevier Ltd |
| References | Karp (b21) 1972; 40 Noferesty, Meybodi (b35) 2008; 6 Zaitsev (b62) 2015; vol. 9288 Torkestani, Meybodi (b49) 2011; 60 Vafashoar, Meybodi, Momeni Azandaryani (b54) 2012; 36 Misra, Oommen (b29) 2009; 22 Rezvanian, Meybodi (b41) 2015; 46 Vahidipour, Meybodi, Esnaashari (b58) 2017; 46 Esnaashari, Meybodi (b14) 2015; 45 Nourollah, A., Meybodi, M.R., 2007. Solving minimum steiner tree problem using generalized distributed learning automata. In: First Iranian Data Mining Conference. Tehran, Iran, pp. 1–9. Vahidipour, Meybodi, Esnaashari (b59) 2017 Kolaitis, Thakur (b24) 1994; 115 Alipour, M., Meybodi, M., 2006. Solving maximal independent set problem using distributed learning automata. In: 14th Iranian Electrical Engineering Conference, ICEE2006. Tehran, Iran, pp. 1–11. Narendra, Thathachar (b34) 1989 Beigy, Meybodi (b8) 2006; 14 Thathachar, Sastry (b45) 2004 Oommen, de St Croix (b37) 1996; 45 Khomami, Rezvanian, Bagherpour, Meybodi (b23) 2018; 48 Torkestani, Meybodi (b50) 2012; 200 Tsetlin (b53) 1973 Torkestani, Meybodi (b48) 2011; 11 Hashemi, Meybodi (b16) 2009 Khomami, Bagherpour, Sajedi, Meybodi (b22) 2016 Mousavian, A., Rezvanian, A., Meybodi, M.R., 2013. Solving minimum vertex cover problem using learning automata. In: 13th Iranian Conference on Fuzzy Systems, IFSC 2013, pp. 1–5. Murata (b33) 1989; 77 Torkestani (b46) 2012; 43 Enayatzare, M., Meybodi, M.R., 2008. An algorithm based on cellular learning automata for solving maximum cut problem in graph. In: Second Iranian Data Mining Conference. Tehran, Iran, pp. 1–11. Billard (b9) 1996; 26 Bause (b5) 1997; 1997 Mousavian, Rezvanian, Meybodi (b32) 2014 Bause (b4) 1996; 33 Soleimani-Pouri, M., Rezvanian, A., Meybodi, M.R., 2012. Solving maximum clique problem in stochastic graphs using learning automata. In: 2012 Fourth International Conference on Computational Aspects of Social Networks, CASoN., pp. 115–119. Mahdaviani, Kordestani, Rezvanian, Meybodi (b25) 2015; 24 Peterson (b38) 1981 Johnson, Trick (b20) 1996 Holloway, Krogh (b17) 1994 Billard (b10) 1997 Zaitsev (b64) 2016; 46 Torkestani, Meybodi (b51) 2012; 59 Zaitsev, D.A., 2015b. Simulating cellular automata by infinite synchronous Petri nets. In: 21st Annual International Workshop on Cellular Automata and Discrete Complex Systems. Turku. Finland. TUCS Lecture Notes. Vol. 24, pp. 91-100. Thathachar, Sastry (b44) 1987; 42 Mirsaleh, Meybodi (b28) 2016; 8 Torkestani, Meybodi (b52) 2012; 29 Motevallian, A., Meybodi, M.R., 2005. Solving maximum independent set problem using cellular learning automata. In: 10th Annual CSI Computer Conference of Iran. Tehran, Iran, pp. 1–10. Burkhard (b12) 1981; 17 Jamehshourani, P., Meybodi, M.R., Torkestani, J.A., 2011. Solving Steiner connected dominating set using distributed learning automata. In: Proceedings of IEEE International Conference on Intelligent Computing and Intelligent Systems, ICIS 2011, pp. 477–480. Vahidipour, Meybodi, Esnaashari (b57) 2017; 25 Bouhmala, Granmo (b11) 2010; 1 Vahidipour, Meybodi, Esnaashari (b56) 2015; 45 Akbari Torkestani (b1) 2013; 44 Vahidipour, Esnaashari (b55) 2017 Farshbaf, Feizi-Derakhshi, Roshanpoor (b15) 2011 Rezvanian, Meybodi (b40) 2015; 23 Beigy, Meybodi (b7) 2004; 3 Williams (b60) 1988 Beigy, H., Meybodi, M.R., 2002. A learning automata based graph isomorphism algorithm. In: JCIS. Presented at the International Joint Conference on Information Science, pp. 344–348. Zhang, Wang, Zhou (b66) 2014; 44 Zaitsev (b61) 2013; 47 Torkestani, Meybodi (b47) 2010; 18 Zaitsev, Zaitsev, Shmeleva (b65) 2014 Akbari Torkestani, Meybodi (b2) 2011; 8 Meybodi, Meybodi (b27) 2014; 41 Jensen, Toft (b19) 2011 Rastegar, Arasteh, Hariri, Meybodi (b39) 2004 Thathachar (b43) 1987; 17 Marsan, Balbo, Conte, Donatelli, Franceschinis (b26) 1994 Marsan (10.1016/j.engappai.2018.10.013_b26) 1994 Torkestani (10.1016/j.engappai.2018.10.013_b50) 2012; 200 Zaitsev (10.1016/j.engappai.2018.10.013_b61) 2013; 47 Thathachar (10.1016/j.engappai.2018.10.013_b43) 1987; 17 10.1016/j.engappai.2018.10.013_b30 10.1016/j.engappai.2018.10.013_b31 Khomami (10.1016/j.engappai.2018.10.013_b22) 2016 Meybodi (10.1016/j.engappai.2018.10.013_b27) 2014; 41 Zhang (10.1016/j.engappai.2018.10.013_b66) 2014; 44 10.1016/j.engappai.2018.10.013_b6 10.1016/j.engappai.2018.10.013_b36 Torkestani (10.1016/j.engappai.2018.10.013_b51) 2012; 59 Zaitsev (10.1016/j.engappai.2018.10.013_b65) 2014 Vahidipour (10.1016/j.engappai.2018.10.013_b56) 2015; 45 10.1016/j.engappai.2018.10.013_b3 Karp (10.1016/j.engappai.2018.10.013_b21) 1972; 40 Torkestani (10.1016/j.engappai.2018.10.013_b52) 2012; 29 Torkestani (10.1016/j.engappai.2018.10.013_b46) 2012; 43 Vahidipour (10.1016/j.engappai.2018.10.013_b57) 2017; 25 Noferesty (10.1016/j.engappai.2018.10.013_b35) 2008; 6 Rezvanian (10.1016/j.engappai.2018.10.013_b41) 2015; 46 Rastegar (10.1016/j.engappai.2018.10.013_b39) 2004 Vahidipour (10.1016/j.engappai.2018.10.013_b55) 2017 Akbari Torkestani (10.1016/j.engappai.2018.10.013_b2) 2011; 8 Oommen (10.1016/j.engappai.2018.10.013_b37) 1996; 45 Torkestani (10.1016/j.engappai.2018.10.013_b49) 2011; 60 Misra (10.1016/j.engappai.2018.10.013_b29) 2009; 22 10.1016/j.engappai.2018.10.013_b42 Holloway (10.1016/j.engappai.2018.10.013_b17) 1994 Kolaitis (10.1016/j.engappai.2018.10.013_b24) 1994; 115 Hashemi (10.1016/j.engappai.2018.10.013_b16) 2009 Bouhmala (10.1016/j.engappai.2018.10.013_b11) 2010; 1 Tsetlin (10.1016/j.engappai.2018.10.013_b53) 1973 Billard (10.1016/j.engappai.2018.10.013_b9) 1996; 26 10.1016/j.engappai.2018.10.013_b18 Akbari Torkestani (10.1016/j.engappai.2018.10.013_b1) 2013; 44 Rezvanian (10.1016/j.engappai.2018.10.013_b40) 2015; 23 Torkestani (10.1016/j.engappai.2018.10.013_b47) 2010; 18 Vafashoar (10.1016/j.engappai.2018.10.013_b54) 2012; 36 Peterson (10.1016/j.engappai.2018.10.013_b38) 1981 Williams (10.1016/j.engappai.2018.10.013_b60) 1988 Beigy (10.1016/j.engappai.2018.10.013_b7) 2004; 3 10.1016/j.engappai.2018.10.013_b13 Thathachar (10.1016/j.engappai.2018.10.013_b44) 1987; 42 Bause (10.1016/j.engappai.2018.10.013_b5) 1997; 1997 Mousavian (10.1016/j.engappai.2018.10.013_b32) 2014 Thathachar (10.1016/j.engappai.2018.10.013_b45) 2004 Zaitsev (10.1016/j.engappai.2018.10.013_b62) 2015; vol. 9288 Zaitsev (10.1016/j.engappai.2018.10.013_b64) 2016; 46 Billard (10.1016/j.engappai.2018.10.013_b10) 1997 Narendra (10.1016/j.engappai.2018.10.013_b34) 1989 Esnaashari (10.1016/j.engappai.2018.10.013_b14) 2015; 45 Beigy (10.1016/j.engappai.2018.10.013_b8) 2006; 14 10.1016/j.engappai.2018.10.013_b63 Vahidipour (10.1016/j.engappai.2018.10.013_b59) 2017 Johnson (10.1016/j.engappai.2018.10.013_b20) 1996 Murata (10.1016/j.engappai.2018.10.013_b33) 1989; 77 Farshbaf (10.1016/j.engappai.2018.10.013_b15) 2011 Jensen (10.1016/j.engappai.2018.10.013_b19) 2011 Mahdaviani (10.1016/j.engappai.2018.10.013_b25) 2015; 24 Vahidipour (10.1016/j.engappai.2018.10.013_b58) 2017; 46 Mirsaleh (10.1016/j.engappai.2018.10.013_b28) 2016; 8 Bause (10.1016/j.engappai.2018.10.013_b4) 1996; 33 Burkhard (10.1016/j.engappai.2018.10.013_b12) 1981; 17 Khomami (10.1016/j.engappai.2018.10.013_b23) 2018; 48 Torkestani (10.1016/j.engappai.2018.10.013_b48) 2011; 11 |
| References_xml | – volume: 45 start-page: 1622 year: 2015 end-page: 1632 ident: b14 article-title: Irregular cellular learning automata publication-title: IEEE Trans. Cybern. – volume: 1 start-page: 1 year: 2010 end-page: 19 ident: b11 article-title: Stochastic learning for SAT-encoded graph coloring problems publication-title: Int. J. Appl. Metaheuristic Comput. – volume: 48 start-page: 570 year: 2018 end-page: 593 ident: b23 article-title: Minimum positive influence dominating set and its application in influence maximization: a learning automata approach publication-title: Appl. Intell. – volume: 40 start-page: 85 year: 1972 end-page: 103 ident: b21 article-title: Reducibility among combinatorial problems publication-title: Complex Comput. Comput. – volume: 23 start-page: 1 year: 2015 end-page: 31 ident: b40 article-title: Finding maximum clique in stochastic graphs using distributed learning automata publication-title: Internat. J. Uncertain. Fuzziness Knowledge-Based Systems – start-page: 1 year: 2017 end-page: 32 ident: b59 article-title: Cellular adaptive Petri net based on learning automata and its application to the vertex coloring problem publication-title: Discrete Event Dyn. Syst. – volume: 115 start-page: 321 year: 1994 end-page: 353 ident: b24 article-title: Logical definability of NP optimization problems publication-title: Inform. and Comput. – volume: 18 start-page: 721 year: 2010 end-page: 758 ident: b47 article-title: Learning automata-based algorithms for finding minimum weakly connected dominating set in stochastic graphs publication-title: Internat. J. Uncertain. Fuzziness Knowledge-Based Systems – volume: 24 start-page: 1550023 year: 2015 ident: b25 article-title: LADE: Learning automata based differential evolution publication-title: Int. J. Artif. Intell. Tools – year: 1989 ident: b34 article-title: Learning Automata: An Introduction – reference: Soleimani-Pouri, M., Rezvanian, A., Meybodi, M.R., 2012. Solving maximum clique problem in stochastic graphs using learning automata. In: 2012 Fourth International Conference on Computational Aspects of Social Networks, CASoN., pp. 115–119. – year: 2017 ident: b55 article-title: Priority assignment in queuing systems with unknown characteristics using learning automata and adaptive stochastic Petri nets publication-title: J. Comput. Sci. – start-page: 1412 year: 1997 end-page: 1417 ident: b10 article-title: Chaotic behavior of learning automata in multi-level games under delayed information publication-title: IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation – volume: 46 start-page: 682 year: 2016 end-page: 693 ident: b64 article-title: Sleptsov nets run fast publication-title: IEEE Trans. Syst. Man Cybern. Syst. – start-page: 187 year: 2014 end-page: 204 ident: b65 article-title: Infinite Petri nets as models of grids publication-title: Encyclopedia of Information Science and Technology, Vol. 10 – volume: 8 start-page: 211 year: 2016 end-page: 222 ident: b28 article-title: A new memetic algorithm based on cellular learning automata for solving the vertex coloring problem publication-title: Memetic Comput. – reference: Beigy, H., Meybodi, M.R., 2002. A learning automata based graph isomorphism algorithm. In: JCIS. Presented at the International Joint Conference on Information Science, pp. 344–348. – reference: Mousavian, A., Rezvanian, A., Meybodi, M.R., 2013. Solving minimum vertex cover problem using learning automata. In: 13th Iranian Conference on Fuzzy Systems, IFSC 2013, pp. 1–5. – volume: 8 start-page: 9237 year: 2011 end-page: 9247 ident: b2 article-title: A cellular learning automata-based algorithm for solving the vertex coloring problem publication-title: Expert Syst. Appl. – volume: 44 start-page: 2484 year: 2014 end-page: 2492 ident: b66 article-title: Last-position elimination-based learning automata publication-title: IEEE Trans. Cybern. – start-page: 722 year: 2011 end-page: 727 ident: b15 article-title: Multi-objective optimization using hybrid genetic algorithm and cellular learning automata applying to graph partitioning problem publication-title: 11th International Conference on Hybrid Intelligent Systems, (HIS) – reference: Jamehshourani, P., Meybodi, M.R., Torkestani, J.A., 2011. Solving Steiner connected dominating set using distributed learning automata. In: Proceedings of IEEE International Conference on Intelligent Computing and Intelligent Systems, ICIS 2011, pp. 477–480. – volume: 46 start-page: 698 year: 2015 end-page: 727 ident: b41 article-title: Finding minimum vertex covering in stochastic graphs: A learning automata approach publication-title: Cybern. Syst. – volume: 1997 start-page: 215 year: 1997 end-page: 234 ident: b5 article-title: Analysis of Petri nets with a dynamic priority method publication-title: Appl. Theory Petri Nets – volume: 22 start-page: 441 year: 2009 end-page: 468 ident: b29 article-title: An efficient pursuit automata approach for estimating stable all-pairs shortest paths in stochastic network environments publication-title: Int. J. Commun. Syst. – year: 1994 ident: b26 article-title: Modelling with Generalized Stochastic Petri Nets – volume: 33 start-page: 669 year: 1996 end-page: 685 ident: b4 article-title: On the analysis of Petri nets with static priorities publication-title: Acta Inform. – volume: 11 start-page: 4064 year: 2011 end-page: 4077 ident: b48 article-title: Learning automata-based algorithms for solving stochastic minimum spanning tree problem publication-title: Appl. Soft Comput. – volume: 29 start-page: 447 year: 2012 end-page: 466 ident: b52 article-title: A new vertex coloring algorithm based on variable aaction-set learning automata publication-title: Comput. Inform. – volume: 77 start-page: 541 year: 1989 end-page: 580 ident: b33 article-title: Petri nets: Properties, analysis and applications publication-title: Proc. IEEE – start-page: 422 year: 2009 end-page: 433 ident: b16 article-title: Cellular PSO: A PSO for dynamic environments publication-title: Advances in Computation and Intelligence – year: 1973 ident: b53 article-title: Automaton Theory and the Modelling of Biological Systems – volume: 45 start-page: 1373 year: 2015 end-page: 1384 ident: b56 article-title: Learning automata-based adaptive Petri net and its application to priority assignment in queuing systems with unknown parameters publication-title: IEEE Trans. Syst. Man Cybern. Syst. – start-page: 310 year: 2004 end-page: 314 ident: b39 article-title: A fuzzy clustering algorithm using cellular learning automata based evolutionary algorithm publication-title: Fourth International Conference on Hybrid Intelligent Systems – volume: 3 start-page: 295 year: 2004 end-page: 319 ident: b7 article-title: A mathematical framework for cellular learning automata publication-title: Adv. Complex Syst. – volume: 41 start-page: 923 year: 2014 end-page: 940 ident: b27 article-title: Extended distributed learning automata publication-title: Appl. Intell. – volume: 6 start-page: 53 year: 2008 end-page: 59 ident: b35 article-title: A learning automata-based algorithm for solving Steiner tree problem publication-title: CSI J. Comput. Sci. Eng. – volume: vol. 9288 start-page: 180 year: 2015 end-page: 197 ident: b62 article-title: Universality in infinite Petri nets publication-title: Proceedings of 7th International Conference. MCU 2015 – volume: 46 start-page: 272 year: 2017 end-page: 284 ident: b58 article-title: Adaptive Petri net based on irregular cellular learning automata with an application to vertex coloring problem publication-title: Appl. Intell. – volume: 60 start-page: 145 year: 2011 end-page: 169 ident: b49 article-title: Weighted Steiner connected dominating set and its application to multicast routing in wireless MANETs publication-title: Wirel. Pers. Commun. – start-page: 158 year: 1994 end-page: 168 ident: b17 article-title: Controlled Petri nets: A tutorial survey publication-title: 11th International Conference on Analysis and Optimization of Systems Discrete Event Systems – volume: 17 start-page: 71 year: 1981 end-page: 86 ident: b12 article-title: Ordered firing in Petri nets publication-title: EIK J. Inf. Process. Cybern. – reference: Nourollah, A., Meybodi, M.R., 2007. Solving minimum steiner tree problem using generalized distributed learning automata. In: First Iranian Data Mining Conference. Tehran, Iran, pp. 1–9. – volume: 47 start-page: 403 year: 2013 end-page: 412 ident: b61 article-title: Verification of computing grids with special edge conditions by infinite Petri nets publication-title: Autom. Control Comput. Sci. – year: 1988 ident: b60 article-title: Toward a Theory of Reinforcement-Learning Connectionist Systems – volume: 59 start-page: 1035 year: 2012 end-page: 1054 ident: b51 article-title: A learning automata-based heuristic algorithm for solving the minimum spanning tree problem in stochastic graphs publication-title: J. Supercomput. – reference: Enayatzare, M., Meybodi, M.R., 2008. An algorithm based on cellular learning automata for solving maximum cut problem in graph. In: Second Iranian Data Mining Conference. Tehran, Iran, pp. 1–11. – volume: 14 start-page: 591 year: 2006 end-page: 615 ident: b8 article-title: Utilizing distributed learning automata to solve stochastic shortest path problems publication-title: Internat. J. Uncertain. Fuzziness Knowledge-Based Systems – start-page: 12 year: 2016 end-page: 17 ident: b22 article-title: A new distributed learning automata based algorithm for maximum independent set problem publication-title: Artificial Intelligence and Robotics (IRANOPEN) – year: 1981 ident: b38 article-title: Petri Net Theory and the Modeling of Systems – reference: Alipour, M., Meybodi, M., 2006. Solving maximal independent set problem using distributed learning automata. In: 14th Iranian Electrical Engineering Conference, ICEE2006. Tehran, Iran, pp. 1–11. – volume: 25 start-page: 427 year: 2017 end-page: 455 ident: b57 article-title: Finding the shortest path in stochastic graphs using learning automata and adaptive stochastic Petri nets publication-title: Internat. J. Uncertain. Fuzziness Knowledge-Based Systems – reference: Motevallian, A., Meybodi, M.R., 2005. Solving maximum independent set problem using cellular learning automata. In: 10th Annual CSI Computer Conference of Iran. Tehran, Iran, pp. 1–10. – volume: 26 start-page: 231 year: 1996 end-page: 240 ident: b9 article-title: Stability of adaptive search in multi-level games under delayed information publication-title: IEEE Trans. Syst. Man Cybern.-Part Syst. Hum. – volume: 43 start-page: 1 year: 2012 end-page: 21 ident: b46 article-title: Degree-constrained minimum spanning tree problem in stochastic graph publication-title: Cybern. Syst. – volume: 17 start-page: 1095 year: 1987 end-page: 1100 ident: b43 article-title: Learning automata with changing number of actions publication-title: IEEE Trans. Syst. Man Cybern. – start-page: 996 year: 2014 end-page: 1000 ident: b32 article-title: Cellular learning automata based algorithm for solving minimum vertex cover problem publication-title: 2014 22nd Iranian Conference on Electrical Engineering (ICEE) – year: 2004 ident: b45 article-title: Networks of Learning Automata: Techniques for Online Stochastic Optimization – volume: 44 start-page: 444 year: 2013 end-page: 466 ident: b1 article-title: A new approach to the vertex coloring problem publication-title: Cybern. Syst. – volume: 45 start-page: 195 year: 1996 end-page: 208 ident: b37 article-title: Graph partitioning using learning automata publication-title: IEEE Trans. Comput. – volume: 36 start-page: 735 year: 2012 end-page: 748 ident: b54 article-title: CLA-DE: a hybrid model based on cellular learning automata for numerical optimization publication-title: Appl. Intell. – year: 2011 ident: b19 article-title: Graph Coloring Problems – year: 1996 ident: b20 article-title: Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge – volume: 200 start-page: 57 year: 2012 end-page: 77 ident: b50 article-title: Finding minimum weight connected dominating set in stochastic graph based on learning automata publication-title: Inf. Sci. – volume: 42 start-page: 143 year: 1987 end-page: 166 ident: b44 article-title: A hierarchical system of learning automata that can learn die globally optimal path publication-title: Inf. Sci. – reference: Zaitsev, D.A., 2015b. Simulating cellular automata by infinite synchronous Petri nets. In: 21st Annual International Workshop on Cellular Automata and Discrete Complex Systems. Turku. Finland. TUCS Lecture Notes. Vol. 24, pp. 91-100. – ident: 10.1016/j.engappai.2018.10.013_b42 doi: 10.1109/CASoN.2012.6412388 – volume: 42 start-page: 143 year: 1987 ident: 10.1016/j.engappai.2018.10.013_b44 article-title: A hierarchical system of learning automata that can learn die globally optimal path publication-title: Inf. Sci. doi: 10.1016/0020-0255(87)90021-1 – year: 2017 ident: 10.1016/j.engappai.2018.10.013_b55 article-title: Priority assignment in queuing systems with unknown characteristics using learning automata and adaptive stochastic Petri nets publication-title: J. Comput. Sci. – volume: 60 start-page: 145 year: 2011 ident: 10.1016/j.engappai.2018.10.013_b49 article-title: Weighted Steiner connected dominating set and its application to multicast routing in wireless MANETs publication-title: Wirel. Pers. Commun. doi: 10.1007/s11277-010-9936-4 – start-page: 722 year: 2011 ident: 10.1016/j.engappai.2018.10.013_b15 article-title: Multi-objective optimization using hybrid genetic algorithm and cellular learning automata applying to graph partitioning problem – volume: 36 start-page: 735 year: 2012 ident: 10.1016/j.engappai.2018.10.013_b54 article-title: CLA-DE: a hybrid model based on cellular learning automata for numerical optimization publication-title: Appl. Intell. doi: 10.1007/s10489-011-0292-1 – volume: 33 start-page: 669 year: 1996 ident: 10.1016/j.engappai.2018.10.013_b4 article-title: On the analysis of Petri nets with static priorities publication-title: Acta Inform. doi: 10.1007/s002360050065 – volume: 1997 start-page: 215 year: 1997 ident: 10.1016/j.engappai.2018.10.013_b5 article-title: Analysis of Petri nets with a dynamic priority method publication-title: Appl. Theory Petri Nets – volume: 46 start-page: 682 year: 2016 ident: 10.1016/j.engappai.2018.10.013_b64 article-title: Sleptsov nets run fast publication-title: IEEE Trans. Syst. Man Cybern. Syst. doi: 10.1109/TSMC.2015.2444414 – volume: 1 start-page: 1 year: 2010 ident: 10.1016/j.engappai.2018.10.013_b11 article-title: Stochastic learning for SAT-encoded graph coloring problems publication-title: Int. J. Appl. Metaheuristic Comput. doi: 10.4018/jamc.2010070101 – volume: 24 start-page: 1550023 year: 2015 ident: 10.1016/j.engappai.2018.10.013_b25 article-title: LADE: Learning automata based differential evolution publication-title: Int. J. Artif. Intell. Tools doi: 10.1142/S0218213015500232 – volume: 46 start-page: 698 year: 2015 ident: 10.1016/j.engappai.2018.10.013_b41 article-title: Finding minimum vertex covering in stochastic graphs: A learning automata approach publication-title: Cybern. Syst. doi: 10.1080/01969722.2015.1082407 – volume: 6 start-page: 53 year: 2008 ident: 10.1016/j.engappai.2018.10.013_b35 article-title: A learning automata-based algorithm for solving Steiner tree problem publication-title: CSI J. Comput. Sci. Eng. – year: 1973 ident: 10.1016/j.engappai.2018.10.013_b53 – ident: 10.1016/j.engappai.2018.10.013_b30 – volume: 17 start-page: 1095 year: 1987 ident: 10.1016/j.engappai.2018.10.013_b43 article-title: Learning automata with changing number of actions publication-title: IEEE Trans. Syst. Man Cybern. doi: 10.1109/TSMC.1987.6499323 – volume: 59 start-page: 1035 year: 2012 ident: 10.1016/j.engappai.2018.10.013_b51 article-title: A learning automata-based heuristic algorithm for solving the minimum spanning tree problem in stochastic graphs publication-title: J. Supercomput. doi: 10.1007/s11227-010-0484-1 – ident: 10.1016/j.engappai.2018.10.013_b13 – volume: 23 start-page: 1 year: 2015 ident: 10.1016/j.engappai.2018.10.013_b40 article-title: Finding maximum clique in stochastic graphs using distributed learning automata publication-title: Internat. J. Uncertain. Fuzziness Knowledge-Based Systems doi: 10.1142/S0218488515500014 – start-page: 1412 year: 1997 ident: 10.1016/j.engappai.2018.10.013_b10 article-title: Chaotic behavior of learning automata in multi-level games under delayed information – ident: 10.1016/j.engappai.2018.10.013_b36 – volume: 29 start-page: 447 year: 2012 ident: 10.1016/j.engappai.2018.10.013_b52 article-title: A new vertex coloring algorithm based on variable aaction-set learning automata publication-title: Comput. Inform. – volume: 3 start-page: 295 year: 2004 ident: 10.1016/j.engappai.2018.10.013_b7 article-title: A mathematical framework for cellular learning automata publication-title: Adv. Complex Syst. doi: 10.1142/S0219525904000202 – volume: vol. 9288 start-page: 180 year: 2015 ident: 10.1016/j.engappai.2018.10.013_b62 article-title: Universality in infinite Petri nets – volume: 41 start-page: 923 year: 2014 ident: 10.1016/j.engappai.2018.10.013_b27 article-title: Extended distributed learning automata publication-title: Appl. Intell. doi: 10.1007/s10489-014-0577-2 – volume: 43 start-page: 1 year: 2012 ident: 10.1016/j.engappai.2018.10.013_b46 article-title: Degree-constrained minimum spanning tree problem in stochastic graph publication-title: Cybern. Syst. doi: 10.1080/01969722.2012.637012 – start-page: 1 year: 2017 ident: 10.1016/j.engappai.2018.10.013_b59 article-title: Cellular adaptive Petri net based on learning automata and its application to the vertex coloring problem publication-title: Discrete Event Dyn. Syst. – volume: 44 start-page: 444 year: 2013 ident: 10.1016/j.engappai.2018.10.013_b1 article-title: A new approach to the vertex coloring problem publication-title: Cybern. Syst. doi: 10.1080/01969722.2013.803391 – volume: 45 start-page: 1622 year: 2015 ident: 10.1016/j.engappai.2018.10.013_b14 article-title: Irregular cellular learning automata publication-title: IEEE Trans. Cybern. doi: 10.1109/TCYB.2014.2356591 – year: 1988 ident: 10.1016/j.engappai.2018.10.013_b60 – year: 2004 ident: 10.1016/j.engappai.2018.10.013_b45 – start-page: 310 year: 2004 ident: 10.1016/j.engappai.2018.10.013_b39 article-title: A fuzzy clustering algorithm using cellular learning automata based evolutionary algorithm – volume: 17 start-page: 71 year: 1981 ident: 10.1016/j.engappai.2018.10.013_b12 article-title: Ordered firing in Petri nets publication-title: EIK J. Inf. Process. Cybern. – year: 1994 ident: 10.1016/j.engappai.2018.10.013_b26 – volume: 8 start-page: 211 year: 2016 ident: 10.1016/j.engappai.2018.10.013_b28 article-title: A new memetic algorithm based on cellular learning automata for solving the vertex coloring problem publication-title: Memetic Comput. doi: 10.1007/s12293-016-0183-4 – start-page: 422 year: 2009 ident: 10.1016/j.engappai.2018.10.013_b16 article-title: Cellular PSO: A PSO for dynamic environments – year: 1981 ident: 10.1016/j.engappai.2018.10.013_b38 – volume: 11 start-page: 4064 year: 2011 ident: 10.1016/j.engappai.2018.10.013_b48 article-title: Learning automata-based algorithms for solving stochastic minimum spanning tree problem publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2011.02.017 – volume: 46 start-page: 272 year: 2017 ident: 10.1016/j.engappai.2018.10.013_b58 article-title: Adaptive Petri net based on irregular cellular learning automata with an application to vertex coloring problem publication-title: Appl. Intell. doi: 10.1007/s10489-016-0831-x – ident: 10.1016/j.engappai.2018.10.013_b3 – volume: 8 start-page: 9237 year: 2011 ident: 10.1016/j.engappai.2018.10.013_b2 article-title: A cellular learning automata-based algorithm for solving the vertex coloring problem publication-title: Expert Syst. Appl. doi: 10.1016/j.eswa.2011.01.098 – volume: 26 start-page: 231 year: 1996 ident: 10.1016/j.engappai.2018.10.013_b9 article-title: Stability of adaptive search in multi-level games under delayed information publication-title: IEEE Trans. Syst. Man Cybern.-Part Syst. Hum. doi: 10.1109/3468.485749 – volume: 77 start-page: 541 year: 1989 ident: 10.1016/j.engappai.2018.10.013_b33 article-title: Petri nets: Properties, analysis and applications publication-title: Proc. IEEE doi: 10.1109/5.24143 – volume: 48 start-page: 570 issue: 3 year: 2018 ident: 10.1016/j.engappai.2018.10.013_b23 article-title: Minimum positive influence dominating set and its application in influence maximization: a learning automata approach publication-title: Appl. Intell. doi: 10.1007/s10489-017-0987-z – volume: 47 start-page: 403 year: 2013 ident: 10.1016/j.engappai.2018.10.013_b61 article-title: Verification of computing grids with special edge conditions by infinite Petri nets publication-title: Autom. Control Comput. Sci. doi: 10.3103/S0146411613070262 – volume: 40 start-page: 85 year: 1972 ident: 10.1016/j.engappai.2018.10.013_b21 article-title: Reducibility among combinatorial problems publication-title: Complex Comput. Comput. doi: 10.1007/978-1-4684-2001-2_9 – volume: 44 start-page: 2484 year: 2014 ident: 10.1016/j.engappai.2018.10.013_b66 article-title: Last-position elimination-based learning automata publication-title: IEEE Trans. Cybern. doi: 10.1109/TCYB.2014.2309478 – volume: 25 start-page: 427 year: 2017 ident: 10.1016/j.engappai.2018.10.013_b57 article-title: Finding the shortest path in stochastic graphs using learning automata and adaptive stochastic Petri nets publication-title: Internat. J. Uncertain. Fuzziness Knowledge-Based Systems doi: 10.1142/S0218488517500180 – start-page: 158 year: 1994 ident: 10.1016/j.engappai.2018.10.013_b17 article-title: Controlled Petri nets: A tutorial survey – start-page: 187 year: 2014 ident: 10.1016/j.engappai.2018.10.013_b65 article-title: Infinite Petri nets as models of grids – volume: 45 start-page: 1373 year: 2015 ident: 10.1016/j.engappai.2018.10.013_b56 article-title: Learning automata-based adaptive Petri net and its application to priority assignment in queuing systems with unknown parameters publication-title: IEEE Trans. Syst. Man Cybern. Syst. doi: 10.1109/TSMC.2015.2406764 – volume: 18 start-page: 721 year: 2010 ident: 10.1016/j.engappai.2018.10.013_b47 article-title: Learning automata-based algorithms for finding minimum weakly connected dominating set in stochastic graphs publication-title: Internat. J. Uncertain. Fuzziness Knowledge-Based Systems doi: 10.1142/S0218488510006775 – start-page: 12 year: 2016 ident: 10.1016/j.engappai.2018.10.013_b22 article-title: A new distributed learning automata based algorithm for maximum independent set problem – ident: 10.1016/j.engappai.2018.10.013_b6 – year: 1989 ident: 10.1016/j.engappai.2018.10.013_b34 – volume: 22 start-page: 441 year: 2009 ident: 10.1016/j.engappai.2018.10.013_b29 article-title: An efficient pursuit automata approach for estimating stable all-pairs shortest paths in stochastic network environments publication-title: Int. J. Commun. Syst. doi: 10.1002/dac.976 – volume: 45 start-page: 195 year: 1996 ident: 10.1016/j.engappai.2018.10.013_b37 article-title: Graph partitioning using learning automata publication-title: IEEE Trans. Comput. doi: 10.1109/12.485372 – ident: 10.1016/j.engappai.2018.10.013_b63 – year: 1996 ident: 10.1016/j.engappai.2018.10.013_b20 – volume: 14 start-page: 591 year: 2006 ident: 10.1016/j.engappai.2018.10.013_b8 article-title: Utilizing distributed learning automata to solve stochastic shortest path problems publication-title: Internat. J. Uncertain. Fuzziness Knowledge-Based Systems doi: 10.1142/S0218488506004217 – year: 2011 ident: 10.1016/j.engappai.2018.10.013_b19 – volume: 115 start-page: 321 year: 1994 ident: 10.1016/j.engappai.2018.10.013_b24 article-title: Logical definability of NP optimization problems publication-title: Inform. and Comput. doi: 10.1006/inco.1994.1100 – start-page: 996 year: 2014 ident: 10.1016/j.engappai.2018.10.013_b32 article-title: Cellular learning automata based algorithm for solving minimum vertex cover problem – volume: 200 start-page: 57 year: 2012 ident: 10.1016/j.engappai.2018.10.013_b50 article-title: Finding minimum weight connected dominating set in stochastic graph based on learning automata publication-title: Inf. Sci. doi: 10.1016/j.ins.2012.02.057 – ident: 10.1016/j.engappai.2018.10.013_b31 – ident: 10.1016/j.engappai.2018.10.013_b18 |
| SSID | ssj0003846 |
| Score | 2.2926676 |
| Snippet | A fusion of learning automata and Petri nets, referred to as APN-LA, has been recently introduced in the literature for achieving adaptive Petri nets. A number... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 255 |
| SubjectTerms | Adaptive Petri net Graph-based problems Learning automata Modular algorithms |
| Title | GAPN-LA: A framework for solving graph problems using Petri nets and learning automata |
| URI | https://dx.doi.org/10.1016/j.engappai.2018.10.013 |
| Volume | 77 |
| WOSCitedRecordID | wos000452945300020&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1873-6769 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0003846 issn: 0952-1976 databaseCode: AIEXJ dateStart: 19950201 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9NAEF6FlAMX3ohSQHvgFjk4dry77s1C5aU2qkqJcrPWu-vWVXCixKkKP4lfyezLMVCpIMTFikbZeDPzZXY8mfkGoVciIYKD0wtKSngwpmwcMEVUwItQCh7yUhqy5-khnUzYbJYe93rffS_M5ZzWNbu6Spf_1dQgA2Pr1tm_MHf7oSCA12B0uILZ4fpHhn-XHU-Cw8y2nJe-9sqUE8KNTf7AsFQP3CyZ9WBj8gVmttagVo1lbZ77nAnfNIsvtoNtm8PfshgOun-Bm6qClSk_MsNAOnyf3rJTfl7JagnfxCReh0fDNqhf15yvz7ntfd_KT9Q3CPcrm6nNWvGR-lospHvvybCbvtAdUz-lL9q-mm0Rk01ORsEopY4k27pmRuNAF-R2fbcbAeOcryX8ded4ZMd8_HZE2GzFxVDVZ6AgXunyPjbUFX62KfYX-u1Pei96KyPNlAbR0C20E9EkZX20k304mH1sz_2Y2bYwv_dOP_r1d7s-FOqEN6f30V33XIIzi6cHqKfqh-iee0bB7gRYg8iPAfGyR2jqELePM9ziDQPesMMbNnjDHm_Y4A0bvGGNNwx4wx5v2OPtMfr89uD0zfvAjesIREzCJijSUSQSGSUFBM1EMT4OaSkjTogUoSByHHOqlKBlwVkZEhkJAdFwAe6AyxGPo_gJ6teLWj1FGA6VKBSKgCch40LocVoqVhGHYFMmiWC7KPGay4XjstcjVea5L1q8yL3Gc61xLQeN76LX7bqlZXO5cUXqDZO7mNTGmjng6Ya1z_5h7R66s_21PEf9ZrVRL9BtcdlU69VLB70fO3a2Hg |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=GAPN-LA%3A+A+framework+for+solving+graph+problems+using+Petri+nets+and+learning+automata&rft.jtitle=Engineering+applications+of+artificial+intelligence&rft.au=Vahidipour%2C+S.M.&rft.au=Esnaashari%2C+M.&rft.au=Rezvanian%2C+A.&rft.au=Meybodi%2C+M.R.&rft.date=2019-01-01&rft.pub=Elsevier+Ltd&rft.issn=0952-1976&rft.eissn=1873-6769&rft.volume=77&rft.spage=255&rft.epage=267&rft_id=info:doi/10.1016%2Fj.engappai.2018.10.013&rft.externalDocID=S0952197618302124 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0952-1976&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0952-1976&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0952-1976&client=summon |