default search action
Khoa Hoang Truong
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j8]Truong Hoang Bao Huy
, Dieu N. Vo
, Khoa Hoang Truong, Thanh Van Tran
:
Optimal Distributed Generation Placement in Radial Distribution Networks Using Enhanced Search Group Algorithm. IEEE Access 11: 103288-103305 (2023) - [c5]Truong Hoang Bao Huy, Dieu N. Vo, Hung Duc Nguyen, Hoa Phuoc Truong, Khanh Tuan Dang, Khoa Hoang Truong:
Short-Term Load Forecasting in Power System Using Recurrent Neural Network. ICSSE 2023: 67-71 - [c4]Truong Hoang Bao Huy, Dieu N. Vo, Hung Duc Nguyen, Phuoc Hoa Truong, Khanh Tuan Dang, Khoa Hoang Truong:
Enhanced Power System State Estimation Using Machine Learning Algorithms. ICSSE 2023: 401-405 - 2022
- [j7]Truong Hoang Bao Huy
, Perumal Nallagownden, Khoa Hoang Truong, Ramani Kannan, Dieu N. Vo
, Nguyen Ho:
Multi-Objective Search Group Algorithm for engineering design problems. Appl. Soft Comput. 126: 109287 (2022) - 2021
- [j6]Bao-Huy Truong, Perumal Nallagownden, Khoa Hoang Truong
, Ramani Kannan, Dieu N. Vo
, Nguyen Ho:
Multi-objective search group algorithm for thermo-economic optimization of flat-plate solar collector. Neural Comput. Appl. 33(19): 12661-12687 (2021) - 2020
- [j5]Khoa Hoang Truong
, Perumal Nallagownden, Irraivan Elamvazuthi
, Dieu N. Vo
:
A Quasi-Oppositional-Chaotic Symbiotic Organisms Search algorithm for optimal allocation of DG in radial distribution networks. Appl. Soft Comput. 88: 106067 (2020) - [j4]Khoa Hoang Truong
, Perumal Nallagownden, Irraivan Elamvazuthi, Vo Ngoc Dieu:
An improved meta-heuristic method to maximize the penetration of distributed generation in radial distribution networks. Neural Comput. Appl. 32(14): 10159-10181 (2020)
2010 – 2019
- 2019
- [j3]Khoa Hoang Truong
, Perumal Nallagownden, Zuhairi Baharudin, Dieu N. Vo
:
A Quasi-Oppositional-Chaotic Symbiotic Organisms Search algorithm for global optimization problems. Appl. Soft Comput. 77: 567-583 (2019) - 2017
- [j2]Khoa Hoang Truong
, Pandian Vasant
, Balbir Singh Mahinder Singh, Dieu N. Vo:
Hybrid Mean-Variance Mapping Optimization for Non-Convex Economic Dispatch Problems. Int. J. Swarm Intell. Res. 8(4): 34-59 (2017) - [j1]Khoa Hoang Truong
, Pandian Vasant
, Balbir Singh Mahinder Singh, Dieu N. Vo:
Swarm based mean-variance mapping optimization for convex and non-convex economic dispatch problems. Memetic Comput. 9(2): 91-108 (2017) - 2016
- [c3]Khoa Hoang Truong
, Pandian Vasant
, Balbir Singh Mahinder Singh, Dieu N. Vo:
Hybrid Mean-Variance Mapping Optimization for Economic Dispatch with Multiple Fuels Considering Valve-Point Effects. ICTCC 2016: 203-216 - 2015
- [c2]Khoa Hoang Truong
, Pandian Vasant
, Balbir Singh Mahinder Singh, Dieu N. Vo
:
Swarm Based Mean-Variance Mapping Optimization for Solving Economic Dispatch with Cubic Fuel Cost Function. ACIIDS (2) 2015: 3-12 - 2014
- [c1]Khoa Hoang Truong
, Pandian Vasant
, Balbir Singh Mahinder Singh, Dieu N. Vo
:
Swarm based mean-variance mapping optimization (MVMOs) for economic dispatch problem with valve - Point effects. IEEM 2014: 59-63
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:55 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint