<> <http://www.w3.org/2000/01/rdf-schema#comment> "The repository administrator has not yet configured an RDF license."^^<http://www.w3.org/2001/XMLSchema#string> .
<> <http://xmlns.com/foaf/0.1/primaryTopic> <https://khub.utp.edu.my/scholars/id/eprint/12986> .
<https://khub.utp.edu.my/scholars/id/eprint/12986> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://purl.org/ontology/bibo/AcademicArticle> .
<https://khub.utp.edu.my/scholars/id/eprint/12986> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://purl.org/ontology/bibo/Article> .
<https://khub.utp.edu.my/scholars/id/eprint/12986> <http://purl.org/dc/terms/title> "An improved meta-heuristic method to maximize the penetration of distributed generation in radial distribution networks"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://khub.utp.edu.my/scholars/id/eprint/12986> <http://purl.org/ontology/bibo/abstract> "This paper proposes a novel scheme based on an improved meta-heuristic method to determine the optimal number of distributed generation (DG) units to be installed in distribution networks for maximum DG penetration. The proposed meta-heuristic method is the quasi-oppositional chaotic symbiotic organisms search (QOCSOS) algorithm, which is the improved version of the original SOS algorithm. QOCSOS integrates two search strategies including quasi-opposition-based learning and chaotic local search into SOS to achieve better performance. In this study, QOCSOS was implemented to find the optimal number, location, size, and power factor of DG units considering different values of DG power factor (unity and non-unity), with the objective of maximum real power loss reduction. The effectiveness of the proposed method was validated on the standard IEEE radial distribution networks including 33, 69, and 118-bus test networks. The results obtained by QOCSOS were compared to those from other methods available in the literature and the standard SOS algorithm. Comparative results revealed that QOCSOS obtained better solutions than other compared methods, and performed greater than SOS. Accordingly, QOCSOS can be a very favourable method to cope with the optimal DG placement problem. Â© 2019, Springer-Verlag London Ltd., part of Springer Nature."^^<http://www.w3.org/2001/XMLSchema#string> .
<https://khub.utp.edu.my/scholars/id/eprint/12986> <http://purl.org/dc/terms/date> "2020" .
<https://khub.utp.edu.my/scholars/id/eprint/12986> <http://www.w3.org/2002/07/owl#sameAs> <https://doi.org/10.1007/s00521-019-04548-4> .
<https://khub.utp.edu.my/scholars/id/eprint/12986> <http://purl.org/ontology/bibo/volume> "32" .
<https://khub.utp.edu.my/scholars/id/eprint/12986> <http://purl.org/ontology/bibo/issue> "14" .
<https://khub.utp.edu.my/scholars/id/org/ext-1c5ddec173ca8cdfba8b274309638579> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://xmlns.com/foaf/0.1/Organization> .
<https://khub.utp.edu.my/scholars/id/org/ext-1c5ddec173ca8cdfba8b274309638579> <http://xmlns.com/foaf/0.1/name> "Springer"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://khub.utp.edu.my/scholars/id/eprint/12986> <http://purl.org/dc/terms/publisher> <https://khub.utp.edu.my/scholars/id/org/ext-1c5ddec173ca8cdfba8b274309638579> .
<https://khub.utp.edu.my/scholars/id/publication/ext-09410643> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://purl.org/ontology/bibo/Collection> .
<https://khub.utp.edu.my/scholars/id/publication/ext-09410643> <http://xmlns.com/foaf/0.1/name> "Neural Computing and Applications"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://khub.utp.edu.my/scholars/id/eprint/12986> <http://purl.org/dc/terms/isPartOf> <https://khub.utp.edu.my/scholars/id/publication/ext-09410643> .
<https://khub.utp.edu.my/scholars/id/publication/ext-09410643> <http://www.w3.org/2002/07/owl#sameAs> <urn:issn:09410643> .
<https://khub.utp.edu.my/scholars/id/publication/ext-09410643> <http://purl.org/ontology/bibo/issn> "09410643" .
<https://khub.utp.edu.my/scholars/id/eprint/12986> <http://purl.org/ontology/bibo/status> <http://purl.org/ontology/bibo/status/peerReviewed> .
<https://khub.utp.edu.my/scholars/id/eprint/12986> <http://purl.org/ontology/bibo/status> <http://purl.org/ontology/bibo/status/published> .
<https://khub.utp.edu.my/scholars/id/eprint/12986> <http://purl.org/dc/terms/creator> <https://khub.utp.edu.my/scholars/id/person/ext-7597318ff4ae6c398ed2025bb6410d32> .
<https://khub.utp.edu.my/scholars/id/eprint/12986> <http://purl.org/ontology/bibo/authorList> <https://khub.utp.edu.my/scholars/id/eprint/12986#authors> .
<https://khub.utp.edu.my/scholars/id/eprint/12986#authors> <http://www.w3.org/1999/02/22-rdf-syntax-ns#_1> <https://khub.utp.edu.my/scholars/id/person/ext-7597318ff4ae6c398ed2025bb6410d32> .
<https://khub.utp.edu.my/scholars/id/eprint/12986> <http://purl.org/dc/terms/creator> <https://khub.utp.edu.my/scholars/id/person/ext-2cbd298997a49c356661cf9b75a134ad> .
<https://khub.utp.edu.my/scholars/id/eprint/12986> <http://purl.org/ontology/bibo/authorList> <https://khub.utp.edu.my/scholars/id/eprint/12986#authors> .
<https://khub.utp.edu.my/scholars/id/eprint/12986#authors> <http://www.w3.org/1999/02/22-rdf-syntax-ns#_2> <https://khub.utp.edu.my/scholars/id/person/ext-2cbd298997a49c356661cf9b75a134ad> .
<https://khub.utp.edu.my/scholars/id/eprint/12986> <http://purl.org/dc/terms/creator> <https://khub.utp.edu.my/scholars/id/person/ext-3bcfce71bf52e7ad2bcbffe442286a7d> .
<https://khub.utp.edu.my/scholars/id/eprint/12986> <http://purl.org/ontology/bibo/authorList> <https://khub.utp.edu.my/scholars/id/eprint/12986#authors> .
<https://khub.utp.edu.my/scholars/id/eprint/12986#authors> <http://www.w3.org/1999/02/22-rdf-syntax-ns#_3> <https://khub.utp.edu.my/scholars/id/person/ext-3bcfce71bf52e7ad2bcbffe442286a7d> .
<https://khub.utp.edu.my/scholars/id/eprint/12986> <http://purl.org/dc/terms/creator> <https://khub.utp.edu.my/scholars/id/person/ext-7593710d57e7476bfd56c9a51a352d7e> .
<https://khub.utp.edu.my/scholars/id/eprint/12986> <http://purl.org/ontology/bibo/authorList> <https://khub.utp.edu.my/scholars/id/eprint/12986#authors> .
<https://khub.utp.edu.my/scholars/id/eprint/12986#authors> <http://www.w3.org/1999/02/22-rdf-syntax-ns#_4> <https://khub.utp.edu.my/scholars/id/person/ext-7593710d57e7476bfd56c9a51a352d7e> .
<https://khub.utp.edu.my/scholars/id/person/ext-7597318ff4ae6c398ed2025bb6410d32> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://xmlns.com/foaf/0.1/Person> .
<https://khub.utp.edu.my/scholars/id/person/ext-7597318ff4ae6c398ed2025bb6410d32> <http://xmlns.com/foaf/0.1/givenName> "K.H."^^<http://www.w3.org/2001/XMLSchema#string> .
<https://khub.utp.edu.my/scholars/id/person/ext-7597318ff4ae6c398ed2025bb6410d32> <http://xmlns.com/foaf/0.1/familyName> "Truong"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://khub.utp.edu.my/scholars/id/person/ext-7597318ff4ae6c398ed2025bb6410d32> <http://xmlns.com/foaf/0.1/name> "K.H. Truong"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://khub.utp.edu.my/scholars/id/person/ext-2cbd298997a49c356661cf9b75a134ad> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://xmlns.com/foaf/0.1/Person> .
<https://khub.utp.edu.my/scholars/id/person/ext-2cbd298997a49c356661cf9b75a134ad> <http://xmlns.com/foaf/0.1/givenName> "P."^^<http://www.w3.org/2001/XMLSchema#string> .
<https://khub.utp.edu.my/scholars/id/person/ext-2cbd298997a49c356661cf9b75a134ad> <http://xmlns.com/foaf/0.1/familyName> "Nallagownden"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://khub.utp.edu.my/scholars/id/person/ext-2cbd298997a49c356661cf9b75a134ad> <http://xmlns.com/foaf/0.1/name> "P. Nallagownden"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://khub.utp.edu.my/scholars/id/person/ext-3bcfce71bf52e7ad2bcbffe442286a7d> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://xmlns.com/foaf/0.1/Person> .
<https://khub.utp.edu.my/scholars/id/person/ext-3bcfce71bf52e7ad2bcbffe442286a7d> <http://xmlns.com/foaf/0.1/givenName> "I."^^<http://www.w3.org/2001/XMLSchema#string> .
<https://khub.utp.edu.my/scholars/id/person/ext-3bcfce71bf52e7ad2bcbffe442286a7d> <http://xmlns.com/foaf/0.1/familyName> "Elamvazuthi"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://khub.utp.edu.my/scholars/id/person/ext-3bcfce71bf52e7ad2bcbffe442286a7d> <http://xmlns.com/foaf/0.1/name> "I. Elamvazuthi"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://khub.utp.edu.my/scholars/id/person/ext-7593710d57e7476bfd56c9a51a352d7e> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://xmlns.com/foaf/0.1/Person> .
<https://khub.utp.edu.my/scholars/id/person/ext-7593710d57e7476bfd56c9a51a352d7e> <http://xmlns.com/foaf/0.1/givenName> "D.N."^^<http://www.w3.org/2001/XMLSchema#string> .
<https://khub.utp.edu.my/scholars/id/person/ext-7593710d57e7476bfd56c9a51a352d7e> <http://xmlns.com/foaf/0.1/familyName> "Vo"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://khub.utp.edu.my/scholars/id/person/ext-7593710d57e7476bfd56c9a51a352d7e> <http://xmlns.com/foaf/0.1/name> "D.N. Vo"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://khub.utp.edu.my/scholars/id/eprint/12986> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/EPrint> .
<https://khub.utp.edu.my/scholars/id/eprint/12986> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/ArticleEPrint> .
<https://khub.utp.edu.my/scholars/id/eprint/12986> <http://purl.org/dc/terms/isPartOf> <https://khub.utp.edu.my/scholars/id/repository> .
<https://khub.utp.edu.my/scholars/id/eprint/12986> <http://www.w3.org/2000/01/rdf-schema#seeAlso> <https://khub.utp.edu.my/scholars/12986/> .
<https://khub.utp.edu.my/scholars/12986/> <http://purl.org/dc/elements/1.1/title> "HTML Summary of #12986 \n\nAn improved meta-heuristic method to maximize the penetration of distributed generation in radial distribution networks\n\n" .
<https://khub.utp.edu.my/scholars/12986/> <http://purl.org/dc/elements/1.1/format> "text/html" .
<https://khub.utp.edu.my/scholars/12986/> <http://xmlns.com/foaf/0.1/primaryTopic> <https://khub.utp.edu.my/scholars/id/eprint/12986> .