default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIsmail M. Ali
Person information
- affiliation: University of New South Wales, Sydney, Australia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c8]Sara Salim
, Ismail M. Ali, Sondoss Elsawah:
A Secure Simulation-optimisation Framework for Fleet Mix Problem: A Defence-based Real-world Application. GECCO Companion 2024: 207-210- 2023
- [j6]Ismail M. Ali, Sumana Biswas, Hasan Hüseyin Turan, Ripon K. Chakrabortty, Sondoss Elsawah, Michael J. Ryan:
An integrated differential evolution algorithm for reconfigurable manufacturing systems. Appl. Soft Comput. 149(Part B): 111025 (2023) - [j5]Ismail M. Ali, Hasan Hüseyin Turan, Sondoss Elsawah:
A military fleet mix problem for high-valued defense assets: A simulation-based optimization approach. Expert Syst. Appl. 213(Part): 118964 (2023) - 2022
- [j4]Ismail M. Ali, Karam M. Sallam, Nour Moustafa, Ripon K. Chakrabortty, Michael J. Ryan, Kim-Kwang Raymond Choo:
An Automated Task Scheduling Model Using Non-Dominated Sorting Genetic Algorithm II for Fog-Cloud Systems. IEEE Trans. Cloud Comput. 10(4): 2294-2308 (2022) - [c7]Ismail M. Ali, Hasan Hüseyin Turan, Sondoss Elsawah:
A Discrete Differential Evolution Algorithm for a Military Fleet Modernization Problem. CEC 2022: 1-8 - 2021
- [j3]Ismail M. Ali, Daryl Essam, Kathryn Kasmarik:
Novel binary differential evolution algorithm for knapsack problems. Inf. Sci. 542: 177-194 (2021) - [c6]Ismail M. Ali, Hasan Hüseyin Turan, Ripon K. Chakrabortty, Sondoss Elsawah, Michael J. Ryan:
An Integrated Differential Evolution-based Heuristic Method for Product Family Design Problem. CEC 2021: 25-32 - 2020
- [b1]Ismail M. Ali:
A Differential Evolution Algorithm for Generic Combinatorial Optimization Problems. University of New South Wales, Sydney, Australia, 2020 - [j2]Ismail M. Ali, Daryl Essam, Kathryn Kasmarik:
A novel design of differential evolution for solving discrete traveling salesman problems. Swarm Evol. Comput. 52 (2020) - [c5]Ismail M. Ali, Daryl Essam, Kathryn Kasmarik:
Differential Evolution Algorithm for Multiple Inter-dependent Components Traveling Thief Problem. CEC 2020: 1-8
2010 – 2019
- 2019
- [j1]Ismail M. Ali, Daryl Essam, Kathryn Kasmarik:
A novel differential evolution mapping technique for generic combinatorial optimization problems. Appl. Soft Comput. 80: 297-309 (2019) - [c4]Ismail M. Ali, Daryl Essam, Kathryn Kasmarik:
New Designs of k-means Clustering and Crossover Operator for Solving Traveling Salesman Problems using Evolutionary Algorithms. IJCCI 2019: 123-130 - 2018
- [c3]Ismail M. Ali, Daryl Essam, Kathryn Kasmarik:
An Efficient Differential Evolution Algorithm for Solving 0-1 Knapsack Problems. CEC 2018: 1-8 - 2016
- [c2]Ismail M. Ali, Saber Mohammed Elsayed, Tapabrata Ray, Ruhul A. Sarker:
A Differential Evolution Algorithm for Solving Resource Constrained Project Scheduling Problems. ACALCI 2016: 209-220 - 2015
- [c1]Ismail M. Ali, Saber M. Elsayed, Tapabrata Ray, Ruhul A. Sarker:
Memetic algorithm for solving resource constrained project scheduling problems. CEC 2015: 2761-2767
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 2024-09-19 00:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
