392 related articles for article (PubMed ID: 26176764)
1. 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]
2. School bus routing problem in the stochastic and time-dependent transportation network.
Sun S; Duan Z; Xu Q
PLoS One; 2018; 13(8):e0202618. PubMed ID: 30138472
[TBL] [Abstract][Full Text] [Related]
3. Methodology of mixed load customized bus lines and adjustment based on time windows.
Li Z; Song R; He S; Bi M
PLoS One; 2018; 13(1):e0189763. PubMed ID: 29320505
[TBL] [Abstract][Full Text] [Related]
4. Time scheduling of transit systems with transfer considerations using genetic algorithms.
Deb K; Chakroborty P
Evol Comput; 1998; 6(1):1-24. PubMed ID: 10021738
[TBL] [Abstract][Full Text] [Related]
5. Modeling and solving the dynamic patient admission scheduling problem under uncertainty.
Ceschia S; Schaerf A
Artif Intell Med; 2012 Nov; 56(3):199-205. PubMed ID: 23122690
[TBL] [Abstract][Full Text] [Related]
6. Optimizing schools' start time and bus routes.
Bertsimas D; Delarue A; Martin S
Proc Natl Acad Sci U S A; 2019 Mar; 116(13):5943-5948. PubMed ID: 30862730
[TBL] [Abstract][Full Text] [Related]
7. The school bus routing and scheduling problem with transfers.
Bögl M; Doerner KF; Parragh SN
Networks (N Y); 2015 Mar; 65(2):180-203. PubMed ID: 28163329
[TBL] [Abstract][Full Text] [Related]
8. Correction: Exact and Metaheuristic Approaches for a Bi-Objective School Bus Scheduling Problem.
Chen X; Kong Y; Dang L; Hou Y; Ye X
PLoS One; 2016; 11(4):e0153614. PubMed ID: 27054616
[No Abstract] [Full Text] [Related]
9. 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]
10. Metaheuristic Algorithms for Convolution Neural Network.
Rere LM; Fanany MI; Arymurthy AM
Comput Intell Neurosci; 2016; 2016():1537325. PubMed ID: 27375738
[TBL] [Abstract][Full Text] [Related]
11. Some metaheuristic algorithms for solving multiple cross-functional team selection problems.
Ngo ST; Jaafar J; Izzatdin AA; Tong GT; Bui AN
PeerJ Comput Sci; 2022; 8():e1063. PubMed ID: 36092009
[TBL] [Abstract][Full Text] [Related]
12. Waste collection routing problem: A mini-review of recent heuristic approaches and applications.
Liang YC; Minanda V; Gunawan A
Waste Manag Res; 2022 May; 40(5):519-537. PubMed ID: 33764243
[TBL] [Abstract][Full Text] [Related]
13. A smart school routing and scheduling problem for the new normalcy.
Díaz-Ramírez J; Leal-Garza CM; Gómez-Acosta C
Comput Ind Eng; 2022 Jun; 168():108101. PubMed ID: 36569989
[TBL] [Abstract][Full Text] [Related]
14. A room-oriented artificial bee colony algorithm for optimizing the patient admission scheduling problem.
Bolaji AL; Bamigbola AF; Adewole LB; Shola PB; Afolorunso A; Obayomi AA; Aremu DR; Almazroi AAA
Comput Biol Med; 2022 Sep; 148():105850. PubMed ID: 35901536
[TBL] [Abstract][Full Text] [Related]
15. 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]
16. Routing in waste collection: A simulated annealing algorithm for an Argentinean case study.
Rossit DG; Toncovich AA; Fermani M
Math Biosci Eng; 2021 Nov; 18(6):9579-9605. PubMed ID: 34814359
[TBL] [Abstract][Full Text] [Related]
17. Directed Bee Colony Optimization Algorithm to Solve the Nurse Rostering Problem.
Rajeswari M; Amudhavel J; Pothula S; Dhavachelvan P
Comput Intell Neurosci; 2017; 2017():6563498. PubMed ID: 28473849
[TBL] [Abstract][Full Text] [Related]
18. A PSO-based hybrid metaheuristic for permutation flowshop scheduling problems.
Zhang L; Wu J
ScientificWorldJournal; 2014; 2014():902950. PubMed ID: 24672389
[TBL] [Abstract][Full Text] [Related]
19. A global repair operator for capacitated arc routing problem.
Mei Y; Tang K; Yao X
IEEE Trans Syst Man Cybern B Cybern; 2009 Jun; 39(3):723-34. PubMed ID: 19211356
[TBL] [Abstract][Full Text] [Related]
20. A model for solving the prescribed burn planning problem.
Rachmawati R; Ozlen M; Reinke KJ; Hearne JW
Springerplus; 2015; 4():630. PubMed ID: 26543764
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
