Improving the Computational Efficiency of Widening Highway Approach

2012 ◽  
Vol 204-208 ◽  
pp. 1648-1651
Author(s):  
Xiao Yu Sun ◽  
Zhen Qing Wang ◽  
Hong Tao Xing ◽  
Yong Heng Tong
Keyword(s):  
Genetic Algorithms ◽  
Computational Efficiency ◽  
Computation Time ◽  
Complex Structures ◽  
Spatial Analyses ◽  
Population Sizes ◽  
Highway Alignment Optimization ◽  
Highway Alignment ◽  
Real World Problems

In this paper we propose a stepwise genetic algorithms approach for optimizing highway alignments for improving computational efficiency and quality of solutions. Our previous work in highway alignment optimization has demonstrated that computational burden is a significant issue when working with a geographic information system (GIS) database requiring numerous spatial analyses. For solving real-world problems working directly with real maps through a GIS is highly desirable. Furthermore, saving computation time can enhance adoptability of a model especially when a study area is relatively large, or involves many sensitive properties, or if locating complex structures such as intersections, bridges and tunnels is necessary. It is well acknowledged that in many optimization processes subdividing large problems into smaller pieces can decrease the computation time and produce a better solution. In this research two different population sizes are used to develop a stepwise alignment optimization when employing genetic algorithms in suitably subdivided study areas. An example study shows that the proposed stepwise optimization gives more efficient results than the existing methods and also improves quality of solutions.

Comparative analysis of intelligent planning methods

2012 ◽  
Vol 9 (2) ◽  
pp. 53-57 ◽  
Author(s):  
O.V. Darintsev ◽  
A.B. Migranov
Keyword(s):  
Neural Networks ◽  
Genetic Algorithms ◽  
Fuzzy Logic ◽  
Comparative Analysis ◽  
Mobile Robots ◽  
Sensory Information ◽  
Working Environment ◽  
Planning Methods ◽  
Intelligent Planning

The main stages of solving the problem of planning movements by mobile robots in a non-stationary working environment based on neural networks, genetic algorithms and fuzzy logic are considered. The features common to the considered intellectual algorithms are singled out and their comparative analysis is carried out. Recommendations are given on the use of this or that method depending on the type of problem being solved and the requirements for the speed of the algorithm, the quality of the trajectory, the availability (volume) of sensory information, etc.

Computing the Medical Image Registration Using Meta-Heuristics

2014 ◽  
Vol 643 ◽  
pp. 237-242 ◽  
Author(s):  
Tahari Abdou El Karim ◽  
Bendakmousse Abdeslam ◽  
Ait Aoudia Samy
Keyword(s):  
Image Processing ◽  
Genetic Algorithms ◽  
Simulated Annealing ◽  
Image Registration ◽  
Cost Function ◽  
Population Genetic ◽  
Medical Image ◽  
Medical Image Registration ◽  
Anatomical Structures

The image registration is a very important task in image processing. In the field of medical imaging, it is used to compare the anatomical structures of two or more images taken at different time to track for example the evolution of a disease. Intensity-based techniques are widely used in the multi-modal registration. To have the best registration, a cost function expressing the similarity between these images is maximized. The registration problem is reduced to the optimization of a cost function. We propose to use neighborhood meta-heuristics (tabu search, simulated annealing) and a meta-heuristic population (genetic algorithms). An evaluation step is necessary to estimate the quality of registration obtained. In this paper we present some results of medical image registration

scholarly journals A Heuristics-Based Parthenogenetic Algorithm for the VRP with Potential Demands and Time Windows

2016 ◽  
Vol 2016 ◽  
pp. 1-12
Author(s):  
Chenghua Shi ◽  
Tonglei Li ◽  
Yu Bai ◽  
Fei Zhao
Keyword(s):  
Genetic Algorithm ◽  
Time Windows ◽  
Computation Time ◽  
Routing Problem ◽  
Split Delivery ◽  
Soft Time Windows ◽  
Comparison Results ◽  
Potential Demand ◽  
The Cost

We present the vehicle routing problem with potential demands and time windows (VRP-PDTW), which is a variation of the classical VRP. A homogenous fleet of vehicles originated in a central depot serves customers with soft time windows and deliveries from/to their locations, and split delivery is considered. Also, besides the initial demand in the order contract, the potential demand caused by conformity consuming behavior is also integrated and modeled in our problem. The objective of minimizing the cost traveled by the vehicles and penalized cost due to violating time windows is then constructed. We propose a heuristics-based parthenogenetic algorithm (HPGA) for successfully solving optimal solutions to the problem, in which heuristics is introduced to generate the initial solution. Computational experiments are reported for instances and the proposed algorithm is compared with genetic algorithm (GA) and heuristics-based genetic algorithm (HGA) from the literature. The comparison results show that our algorithm is quite competitive by considering the quality of solutions and computation time.

Dynamisches Verhalten von Gestellwerkstoffen in Werkzeugmaschinen*/Dynamic behavior of different machine frame materials

2015 ◽  
Vol 105 (05) ◽  
pp. 263-268
Author(s):  
P. H. Nebeling
Keyword(s):  
Dynamic Behavior ◽  
Machine Tools ◽  
Dynamic Behaviour ◽  
Influencing Factor ◽  
Complex Structures ◽  
Geometric Properties ◽  
Long Time

Das dynamische Verhalten von Werkzeugmaschinen ist für die Stabilität während der Bearbeitung sowie die Qualität der erzeugten Werkstücke von besonderer Bedeutung. Ein Einflussfaktor darauf ist die Dämpfung. Im Bereich der Maschinengestelle kommen seit langer Zeit unterschiedliche Materialien zum Einsatz. In diesem Fachbeitrag werden die Dämpfungskennwerte unterschiedlicher Gestellwerkstoffe an geometrisch gleichen Proben vergleichend gegenübergestellt. Als weitere Kenngröße wurde die Lage der (1. Biege-) Eigenfrequenz als Maß für die massebezogene dynamische Steifigkeit verwendet. Die Effekte beim Übergang von einfachen Bauteilen zu komplexen Strukturen runden den Fachartikel ab.   The dynamic behaviour of machine tools is of great importance for stability and quality of the machined work pieces. One influencing factor in this area is damping. In the field of machine bases different materials have been use since long time. In this article the damping values of different materials with equal geometric properties are compared. As further parameter the first bending Eigenfrequency as dimension for mass related stiffness is use. The transition from simple components to complex structures is touched at the end of the paper.

scholarly journals Great differences in performance and outcome of high-throughput sequencing data analysis platforms for fungal metabarcoding

MycoKeys ◽  
2018 ◽  
Vol 39 ◽  
pp. 29-40 ◽  
Author(s):  
Sten Anslan ◽  
R. Henrik Nilsson ◽  
Christian Wurzbacher ◽  
Petr Baldrian ◽  
Leho Tedersoo ◽  
...  
Keyword(s):  
High Throughput ◽  
High Throughput Sequencing ◽  
Computation Time ◽  
Potential Effect ◽  
Data Sets ◽  
Sequencing Data ◽  
Operational Taxonomic Units ◽  
High Throughput Sequencing Data ◽  
Recent Developments

Along with recent developments in high-throughput sequencing (HTS) technologies and thus fast accumulation of HTS data, there has been a growing need and interest for developing tools for HTS data processing and communication. In particular, a number of bioinformatics tools have been designed for analysing metabarcoding data, each with specific features, assumptions and outputs. To evaluate the potential effect of the application of different bioinformatics workflow on the results, we compared the performance of different analysis platforms on two contrasting high-throughput sequencing data sets. Our analysis revealed that the computation time, quality of error filtering and hence output of specific bioinformatics process largely depends on the platform used. Our results show that none of the bioinformatics workflows appears to perfectly filter out the accumulated errors and generate Operational Taxonomic Units, although PipeCraft, LotuS and PIPITS perform better than QIIME2 and Galaxy for the tested fungal amplicon dataset. We conclude that the output of each platform requires manual validation of the OTUs by examining the taxonomy assignment values.

scholarly journals Strategic Team AI Path Plans: Probabilistic Pathfinding

2008 ◽  
Vol 2008 ◽  
pp. 1-6 ◽  
Author(s):  
Tng C. H. John ◽  
Edmond C. Prakash ◽  
Narendra S. Chaudhari
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Computer Games ◽  
Fitness Function ◽  
New Method ◽  
High Quality ◽  
Plan Generation ◽  
Novel Method ◽  
Games And Simulations

This paper proposes a novel method to generate strategic team AI pathfinding plans for computer games and simulations using probabilistic pathfinding. This method is inspired by genetic algorithms (Russell and Norvig, 2002), in that, a fitness function is used to test the quality of the path plans. The method generates high-quality path plans by eliminating the low-quality ones. The path plans are generated by probabilistic pathfinding, and the elimination is done by a fitness test of the path plans. This path plan generation method has the ability to generate variation or different high-quality paths, which is desired for games to increase replay values. This work is an extension of our earlier work on team AI: probabilistic pathfinding (John et al., 2006). We explore ways to combine probabilistic pathfinding and genetic algorithm to create a new method to generate strategic team AI pathfinding plans.

Sign in / Sign up

Export Citation Format

Share Document