Find research datasets worth reusing
Search datasets from major research repositories and use ShareScore to quickly assess how well each record supports discovery, access, and reuse.
4
datasets available to search
ShareScore release 0.9.0
Dataset results
4 results for “Genetic Algorithm (GA),”
Using the Genetic Algorithm for the Optimization of Dynamic School Bus Routing Problem-Figure 7. Application main form which includes route, bus stops and GA parameters
<p>For this study, the school bus routes within the Ankara Province were used as case studies. The school bus routes were recorded by using the Android application and instantaneous GPS monitoring method. The home address of each student was taken as a stopping point. At the end of each route, the distances between the beginning and end points were recorded. After transferring the obtained route data into the database, the ill-adapted points were eliminated. By means of the developed application, the existing school bus routes are dynamically optimized using GA. It was developed both as a mobile and desktop application. Using Android- based mobile software, the information regarding GPS locations of bus stops and school buses is transferred to the server on a real-time basis. Using the desktop software, where GAs are run, these coordinates are shown on a Google map, and the most suitable route is produced and sent to the school bus via server. This method provides the opportunity to dynamically reflect certain factors such as a different initial point for the school bus, some students being absent from the school on a particular day, and eventual changes on the existing roads on the route production process.</p>
Using the Genetic Algorithm for the Optimization of Dynamic School Bus Routing Problem-Figure 3. The flow diagram of the SBRP solution by using GA
<p>The distance optimization needed for the formation of the objective function that can be seen in equation number 1 was done using GA operators and parameters. The flowchart that can be seen in Figure 3 shows how the school bus routes are formed using GA.</p>
Using the Genetic Algorithm for the Optimization of Dynamic School Bus Routing Problem-Figure 8. Listing of obtained solutions after running GA on the route
<p>During the route planning, school is the initial point if the students are going home from school, whereas it is the final point if they are going to the school from their homes. The application provides the opportunity to fix not only the school, but also the bus stops as initial or final points. Since the authors hope to develop a routing solution for more than one school in a future study, both the initial and final bus stops were given the opportunity to be selected so that the school bus can complete distribution/collection duties for one school and can go to another school for routing. When these selections are made, the initial and final genes of the chromosomes produced in the population were fixed through these selections. When the TSP option is on, on the other hand, the school bus returning to the initial point after completing the distribution/collection duties is included in the routing process. The information regarding solutions, route distances and the number of iterations produced after all the parameters are defined and the relevant selections are made are listed as shown in Figure 8. Under the solutions list, total crossover, total number of mutations, and algorithm working times are shown.</p>
A Genetic Algorithm Approach to Regenerate Image from a Reduce Scaled Image Using Bit Data Count-Figure 4. Image regeneration using GA
<p>In 2008, Roger Johansson was able to regenerate a Mona Lisa image from random sampling (Roger Johansson, 2017). It uses a genetic algorithm to model a population of individuals, each containing a string of DNA which can be visualized in the form of an image (Grow Your Own Picture Genetic Algorithms & Generative Art, 2017).</p> <p>By starting with a population consisting of a randomly generated gene pool, each individual is compared to the reference image (the one on the left), and the individuals can then be ranked by their likeness to it, known as their "fitness", with the best fit being displayed on the output image (the one on the right) (Grow Your Own Picture Genetic Algorithms & Generative Art, 2017). By breeding the fittest individuals from the population, the DNA which produces the most accurate representation of the reference image is selected over successive generations, effectively demonstrating the power of a natural selection process to produce the best candidate for any given environment (Grow Your Own Picture Genetic Algorithms & Generative Art, 2017).</p>
ScienceDex guides
Understand access before you commit
These curated guides explain access requirements, typical timelines, costs, and reuse considerations for widely used research datasets.
Allen Brain Atlas
Allen Brain Atlas is an Allen Institute collection of brain map atlases, datasets, APIs, and analysis tools covering mouse, human, and non-human primate brain resources.
Annotated Behaviour and Observability Dataset (ABODe)
ABODe is a University of Edinburgh DataShare dataset for behavior classification in group-housed mice using home-cage video, identities, bounding boxes, ground-plate positions, and annotator labels.
DANDI Archive for NWB datasets
DANDI is a BRAIN Initiative archive for publishing and sharing neurophysiology data, including electrophysiology, optophysiology, and behavioral data packaged as NWB and related standards.
International Brain Laboratory public data
The International Brain Laboratory public data releases expose standardized mouse decision-making experiments, including Neuropixels recordings, widefield calcium imaging, behavior, and session metadata accessed through the ONE API.
OpenNeuro
OpenNeuro is a free, open platform for sharing neuroimaging datasets, with public search, dataset pages, and download paths for web, S3, DataLad, and the OpenNeuro CLI.