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.
89
datasets available to search
ShareScore release 0.7.1
Dataset results
89 results for “genetic algorithm”
Solutions and Genetic algorithm dataset of the Scenarios used for the Validation of the Conflict Detection and Resolution Use Case (ARTIMATION )
<p>This dataset contains the <strong>solution </strong>of the scenarios used for one of the validation of the ARTIMATION project: Conflict Detection and Resolution (CD&R) use case (link).</p> <p>The solution are computed by a Genetic Algorithm developped by Nicolas Durand.<br> <br> Inside, one can find:</p> <p>-One archive, "GA_Scenario_Solution_Dataset.zip", containing 10 couple of files (so 20 files). Each couple of file "sol_X_1.csv" and "sols_X_1.csv" are reciprocally the solutino given by the Genetic Algorithm to scenario X, and all the candidate solution explroed by the GA while solving scenario X. This archive also contain other versions of the solutions made by the GA with other parameters.<br> <br> -One archive, "GA_Toy_Dataset.zip" , containing solution to random scenarios, used to develop the first interfaces.</p> <p>Those solutions are used to developp the heatmatrix and heatmaps of the project (link), and visualisations for the validation (link).</p>
Data for "Unfolding the structural stability of nanoalloys via symmetry-constrained genetic algorithm and neural network potential"
<p><strong>PtNi_alloy_eam.db</strong> is the dataset (ase.db object) consisting of 55982 intially sampled Pt-Ni alloy structures with EAM energies and forces.</p> <p><strong>PtNi_alloy_dft.db</strong> is the dataset (ase.db object) consisting of the final 6828 resampled Pt-Ni alloy structures with DFT energies and forces calculated by VASP. This is the training set for the NNP, and could be very useful for fitting other machine learning models.</p> <p><strong>PtNi_nanoalloy_vertices_nnp.db</strong> is the dataset (ase.db object) consisting of all the vertices (stable structures) on the convex hulls obtained from NNP-based SCGA runs on 36 Pt-Ni nanoalloy systems. The energies are given by the NNP. Additional information such as mixing energy, motif and symmetry axis are also saved in the dataset and can be queried by the 'data' keyword. An xyz format trajectory of these stable structures is also uploaded.</p> <p>All the input files and scripts for hybrid MC-MD simulations, QBC resampling, DFT calculations, NNP training, NNP-based SCGA runs and convex hull analysis are provided in <strong>inputs_and_scripts.zip</strong>.</p>
Optimisation of business processes tenant distribution in the Cloud with a genetic algorithm
<p>Used data and obtained results for the paper Optimisation of business processes tenant distribution in the Cloud with a genetic algorithm.</p> <p>The reader can find the following files :</p> <ul> <li>configuration_types.csv contains the cloud resource types (the name is the EC2 instance for database, and for the BPM engine separated by an underscore), their price and their capacity</li> <li>tenants_uni.csv contains the customers and their minimum and maximum BPM task throughput</li> <li>results_[number of tenants]_seg.csv files contain the results for the previous heuristic (segmentation only)</li> <li>results_<em>[number of tenants]</em>_ga_<em>[duration]</em>.csv files contain the results for the genetic algorithm coupled to the iterative heuristic tests</li> <li>solver_<em>[number of tenants]</em>_ga_<em>[duration]</em>.csv files contain the results for the genetic algorithm coupled to the restricted model solved tests</li> </ul>
A Linked Application of Discrete Differential Evolution Algorithm Coupled with Simulation- Optimization Model and Comparative Analysis by Genetic Algorithm for Discrete Groundwater Management Problems
<p>Complete dataset of publication name as "The complete publication dataset is "A Discrete Differential Evolution- Linear Programming Algorithm for Groundwater Management Problems." You can find all the written codes in the zip file.</p>
Characterization data for the manuscript: "Using genetic algorithms to systematically improve the synthesis conditions of Al-PMOF"
<p>This entry contains characterization data for the manuscript "Using genetic algorithms to systematically improve the synthesis conditions of Al-PMOF", which we exported from the electronic lab notebook (ELN).</p> <p>To visualize the data in this dataset: <a href="https://www.cheminfo.org/flavor/zenodo/index.html?id=6620502">open entry</a></p>
Figure 5 in Hybrid neural network with genetic algorithms for predicting distribution pattern of Tetranychus urticae (Acari: Tetranychidae) in cucumbers field of Ramhormoz, Iran
Figure 5. Tetranychus urticae distribution maps in actual (b, d and f) and classified conditions by MLPNN (c, e and a). The maps of a, c, e and b, d, f have been drawn according to economic threshold of 4, 8 and 12, respectively.
Figure 6. One chromosome from the population and the five chromosomes existing in the evaluation partition.-Genetic Algorithms Principles Towards Hidden Markov Model
<p>For example comparing the<br> chromosome given in Figure 6 with the first chromosome in the evaluation partition, the<br> difference between the relation Med-Med and Med-High as a pair is 0.0 and the difference<br> between the relation High-High and High-Med as a pair is 0.1. Similarly the difference between<br> the relation Med-Cold and Med-Hot as a pair is 0.1 and the difference between the relation<br> High-Cold and High-Hot as a pair is 0.2. We sum all these differences to get the value of<br> compare(i,j), the sum value is 0+0.1+0.1+0.2 = 0.4. Using the same approach we compute the<br> compare function with the other four chromosomes and we get values 0.4, 0.5,0.4 and 0.6. Now<br> we sum the five values 0.4 + 0.4 + 0.5+ 0.4 +0.6 = 2.3. The fitness value is then 1/ 2.3 = 0.434.<br> The highest is the fitness value, the better is the performance of the chromosome.</p>
Figure 4. Incorrect crossover operation. The High-High and High-Med probability values summation should be 1.-Genetic Algorithms Principles Towards Hidden Markov Model
<p>In this genetic operator, we choose two chromosomes at random and apply crossover between<br> them. Figure 3 shows the proposed crossover. We choose a crossing cut site at random. It is to be<br> noted that the crossing cut site should be even number. We should have two crossing cut sites. If<br> we make crossing cut site odd number, the resultant child will not have a correct value of<br> probability. The incorrect crossover is shown in Figure 4.</p>
Figure 5. Mutation process. This is happened by decreasing 0.2 from Med-Cold probability and adding 0.2 to Med- Hot.-Genetic Algorithms Principles Towards Hidden Markov Model
<p>Figure 5 illustrates an example of mutation process. In Figure 5, Med-Cold:0.9 and Med-Hot:0.1<br> before mutation and become Med-Cold:0.7 and Med-Hot:0.3 after mutation. This is done by<br> decreasing 0.2 from Med-Cold probability and adding 0.2 to Med-Hot probability.</p>
Figure 3. The crossover operation between two HMM chromosomes Figure-Genetic Algorithms Principles Towards Hidden Markov Model
<p>Crossover<br> In this genetic operator, we choose two chromosomes at random and apply crossover between<br> them. Figure 3 shows the proposed crossover. We choose a crossing cut site at random. It is to be<br> noted that the crossing cut site should be even number. We should have two crossing cut sites. If<br> we make crossing cut site odd number, the resultant child will not have a correct value of<br> probability. The incorrect crossover is shown in Figure 4.</p>
Figure 2. The general structure of the proposed approach-Genetic Algorithms Principles Towards Hidden Markov Model
<p>The chromosome contains 8 genes, each is represented by the relation between two states<br> accompanied with a probability value. The genes should be formed in this way because this is<br> important in the crossover operation as to be explained later. The most important thing is that each<br> two genes has the probability summation of 1.0. For example Med-Med:02 and Med-High:08 have<br> the summation of 1.0. Similarly High-High:0.6 and High-Med:0.4 have the summation of 1.0. Each<br> two genes with summation of 1.0 should be neighbors.</p>
Figure 1. HMM to describe a relation between the states Med. and High with the observations (invisible states) cold and hot.-Genetic Algorithms Principles Towards Hidden Markov Model
<p>Hewahi [4] presented a modified version of Censored Production Rule (CPR) called<br> Modified Censored Production Rules (MCPR). CPR is proposed by Michalski and Winston [6 ] to<br> capture real time situations. MCPR can fit with hidden Markov model and present a scheme to<br> compute the certainty values of the obtained conclusions out of the induced rules. To compute the<br> certainty values for the rule actions (conclusions), the approach exploited only the probability<br> values associated with the hidden Markov model without using any of the other well known<br> certainty computation approaches. Hewahi [3] also proposed an intelligent networking<br> management system based on the induced MCPRs extracted from a networking structure based on<br> HMM. The advantage of using this technique is that MCPRs are very useful in real time<br> applications and can be adapted over time based on the obtained experience of the networking<br> working process.<br> Let us consider the HMM presented in Figure 1.</p>
BRAIN Journal-Evolving Spiking Neural Networks for Control of Artificial Creatures-Figure 12. Genetic Algorithm flowchart
<p>Then next generation are produced by combination of the elites (15%), crossover (55%) and mutation (30%) of the initial population. Elites are the best chromosomes which are directly transferred to the next generation. Because of long chromosome length, for crossover, five points are randomly chosen in each parent as cut points. Figure 11 shows a typical crossover with two cutpoints and Figure 12 illustrates a flowchart for the proposed evolutionary model. Selections are based on Roulette Wheel selection, more detailed information can be found in.</p>
Using the Genetic Algorithm for the Optimization of Dynamic School Bus Routing Problem-Figure 9. Step by step drawing of the selected route solution
<p>When the solution that is desired to be viewed is double clicked, the connections between bus stops are drawn in turn, and the route is shown as can be seen in Figure 9.</p>
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 6. Mutation process
<p>The individuals obtained at the end of crossing over might not provide the desired level of variability. In that case, the produced individuals are mutated independently from another individual in such a way that their own gene sequence will change. The mutation process is performed in the event that the mutation possibility that is specified in the beginning comes true. The results obtained from mutation can enhance the outcome or make it worse. It is of utmost importance to specify the most suitable mutation possibility. This possibility should be high enough to prevent the method from becoming stuck at a local point, but at the same time, low enough to allow the best results produced by crossing over and multiplexing. In this study, the mutation possibility was selected as 10%, and the locations of two randomly selected bus stops were changed during the mutation process. As in the crossing over, also during this process, the limitations regarding producing a new individual (route) were adapted. Figure 6 shows an example to mutation process.</p>
Using the Genetic Algorithm for the Optimization of Dynamic School Bus Routing Problem-Figure 4. Example of a chromosome structure with permutation coding
<p>Each chromosome found in the population formed in the GA is structurally an equal-length coded series. The chromosomes are made of genes. For coding purposes, binary, permutation, and value coding methods are widely used. In the travelling salesman or other similar VRPs, permutation coding technique is preferred over the other techniques. Using the permutation coding technique, each chromosome found in the population is expressed in terms of the numbers of each stop to be followed in the route, as shown in Figure 4.</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 10. Obtained experimental results
<p>The GA procedure was carried out using the parameter values that can be seen in Table 1, for a total of 10 school bus services’ routes identified by means of mobile-based software for a school located in the Ankara Province. The obtained experimental results are shown in Table 2 and Figure 10. The algorithm working duration also includes the formation of a distances’ matrix.</p>
Using the Genetic Algorithm for the Optimization of Dynamic School Bus Routing Problem-Figure 1. Example of a VRP solution
<p>VRP is widely described as the process where the distribution vehicles deliver goods in a depot to the clients found in geographically dispersed locations and then return to the depot on the optimum route. The VRP, first introduced by Dantzig and Ramser in 1959, aims to minimize the total distance to be covered during the routing of the vehicles in a centrally-located depot (Dantzig & Ramser, 1959). The routing process is operated by taking the vehicle capacities into consideration so as to ensure that each client located on the routing plan is visited only once. The depot, vehicle, and goods concepts mentioned in the general description of VRP can be re-adapted as school, student and bus stop, based on different sectors that the problem applies to. Figure 1 shows a scheme indicating the VRP solution applied to a distribution system, where the clientele network is dispersed over three different zones.</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.