These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.
231 related articles for article (PubMed ID: 35867693)
1. A clustering metaheuristic for large orienteering problems. Elzein A; Di Caro GA PLoS One; 2022; 17(7):e0271751. PubMed ID: 35867693 [TBL] [Abstract][Full Text] [Related]
2. A solution approach to the orienteering problem with time windows and synchronisation constraints. Roozbeh I; Hearne JW; Pahlevani D Heliyon; 2020 Jun; 6(6):e04202. PubMed ID: 32596522 [TBL] [Abstract][Full Text] [Related]
3. Orienteering Problem with Functional Profits for multi-source dynamic path construction. Mukhina KD; Visheratin AA; Nasonov D PLoS One; 2019; 14(4):e0213777. PubMed ID: 30939132 [TBL] [Abstract][Full Text] [Related]
4. Exact and Metaheuristic Approaches for a Bi-Objective School Bus Scheduling Problem. Chen X; Kong Y; Dang L; Hou Y; Ye X PLoS One; 2015; 10(7):e0132600. PubMed ID: 26176764 [TBL] [Abstract][Full Text] [Related]
6. Automated Design of Multipass Heuristics for Resource-Constrained Job Scheduling With Self-Competitive Genetic Programming. Nguyen S; Thiruvady D; Zhang M; Alahakoon D IEEE Trans Cybern; 2022 Sep; 52(9):8603-8616. PubMed ID: 33710971 [TBL] [Abstract][Full Text] [Related]
7. A Case Study of Controlling Crossover in a Selection Hyper-heuristic Framework Using the Multidimensional Knapsack Problem. Drake JH; Özcan E; Burke EK Evol Comput; 2016; 24(1):113-41. PubMed ID: 25635698 [TBL] [Abstract][Full Text] [Related]
8. A computational efficient optimization of flow shop scheduling problems. Liang Z; Zhong P; Liu M; Zhang C; Zhang Z Sci Rep; 2022 Jan; 12(1):845. PubMed ID: 35039598 [TBL] [Abstract][Full Text] [Related]
9. An impatient evolutionary algorithm with probabilistic tabu search for unified solution of some NP-hard problems in graph and set theory via clique finding. Guturu P; Dantu R IEEE Trans Syst Man Cybern B Cybern; 2008 Jun; 38(3):645-66. PubMed ID: 18558530 [TBL] [Abstract][Full Text] [Related]
10. An Observation Scheduling Approach Based on Task Clustering for High-Altitude Airship. Chen J; Luo Q; Wu G Sensors (Basel); 2022 Mar; 22(5):. PubMed ID: 35271197 [TBL] [Abstract][Full Text] [Related]
11. An Innovative Excited-ACS-IDGWO Algorithm for Optimal Biomedical Data Feature Selection. Segera D; Mbuthia M; Nyete A Biomed Res Int; 2020; 2020():8506365. PubMed ID: 32908920 [TBL] [Abstract][Full Text] [Related]
12. Decomposition techniques with mixed integer programming and heuristics for home healthcare planning. Laesanklang W; Landa-Silva D Ann Oper Res; 2017; 256(1):93-127. PubMed ID: 31258236 [TBL] [Abstract][Full Text] [Related]
13. Novel metaheuristic based on multiverse theory for optimization problems in emerging systems. Hosseini E; Ghafoor KZ; Emrouznejad A; Sadiq AS; Rawat DB Appl Intell (Dordr); 2021; 51(6):3275-3292. PubMed ID: 34764565 [TBL] [Abstract][Full Text] [Related]
14. A novel metaheuristic algorithm inspired by COVID-19 for real-parameter optimization. Kadkhoda Mohammadi S; Nazarpour D; Beiraghi M Neural Comput Appl; 2023; 35(14):10147-10196. PubMed ID: 37155551 [TBL] [Abstract][Full Text] [Related]
15. A novel bio-heuristic computing algorithm to solve the capacitated vehicle routing problem based on Adleman-Lipton model. Wang Z; Ren X; Ji Z; Huang W; Wu T Biosystems; 2019 Oct; 184():103997. PubMed ID: 31369836 [TBL] [Abstract][Full Text] [Related]
16. Genetic Programming Hyper-Heuristics with Vehicle Collaboration for Uncertain Capacitated Arc Routing Problems. MacLachlan J; Mei Y; Branke J; Zhang M Evol Comput; 2020; 28(4):563-593. PubMed ID: 31730372 [TBL] [Abstract][Full Text] [Related]
17. Quarantine Vehicle Scheduling for Transferring High-Risk Individuals in Epidemic Areas. Zhang MX; Yan HF; Wu JY; Zheng YJ Int J Environ Res Public Health; 2020 Mar; 17(7):. PubMed ID: 32230995 [TBL] [Abstract][Full Text] [Related]
18. The coral reefs optimization algorithm: a novel metaheuristic for efficiently solving optimization problems. Salcedo-Sanz S; Del Ser J; Landa-Torres I; Gil-López S; Portilla-Figueras JA ScientificWorldJournal; 2014; 2014():739768. PubMed ID: 25147860 [TBL] [Abstract][Full Text] [Related]
19. Towards an efficient collection and transport of COVID-19 diagnostic specimens using genetic-based algorithms. Tlili T; Masri H; Krichen S Appl Soft Comput; 2022 Feb; 116():108264. PubMed ID: 34903957 [TBL] [Abstract][Full Text] [Related]
20. A survey on binary metaheuristic algorithms and their engineering applications. Pan JS; Hu P; Snášel V; Chu SC Artif Intell Rev; 2023; 56(7):6101-6167. PubMed ID: 36466763 [TBL] [Abstract][Full Text] [Related] [Next] [New Search]