A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
DNA Solution of the Shortest Path Problem by Concentration Control
2000
Genome Informatics Series
Preserved Fulltext
In order to show the effectiveness of our proposed method, we demonstrate that the shortest path problem can be solved by DNA computing based on the concentration control. ...
Concentration control enables us to handle such an optimization problem, because we can translate numerical data to the concentration of DNAs. ...
doi:10.11234/gi1990.11.466
fatcat:sg3sap66hjdffl2iq5aktx3y4i
Hybrid Concentration-Controlled Direct-Proportional Length-Based DNA Computing for Numerical Optimization of the Shortest Path Problem
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
The experimental results show the effectiveness of the proposed CCDPLB-DNAC for solving weighted graph problems, such as the shortest path problem. ...
On the other hand, the hybridization control by concentration is done by varying the amount of oligos, as the input of computation, before the computation begins. ...
Acknowledgements This research was supported partly by the IEEE Computational Intelligence Society (CIS) Walter J Karplus Student Summer Research Grant 2004 for a research visit in September 2004 at the ...
doi:10.1007/11613022_18
fatcat:gvrn6gkndngrlcytyudlgc5fxa
Experimental Implementation of Hybrid Concentration-Controlled Direct-Proportional Length-Based DNA Computing for Numerical Optimization of the Shortest Path Problem(BIOMETRICS AND ITS APPLICATIONS)
2009
International journal of biomedical soft computing and human sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The definition of the shortest path problem is placed in Chapter 2. ...
The output of the shortest path problem is a (vstart,vend)E V path with the smallest cost. ...
doi:10.24466/ijbschs.14.1_27
fatcat:ul3bloukmrbpnp7spfn4srj35u
Marangoni Flow Driven Maze Solving
[chapter]
2016
Emergence, Complexity and Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The solutions of the maze problem are revealed by paths of a passive dye which is transported on the surface of the liquid in the direction of the acidic area, which is chosen to be the exit of the maze ...
The shortest path is visualized first, as the Marangoni flow advecting the dye particles is the most intense along the shortest path. ...
solution paths to the maze problem. ...
doi:10.1007/978-3-319-33921-4_10
fatcat:xrszkfuw3nehthit5oaqems5me
In Vitro Implementation of k-shortest Paths Computation with Graduated PCR
2005
International Journal of Computational Intelligence Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
In this paper, an in vitro implementation of DNA computing for solving k-shortest paths problem of a weighted graph is reported. ...
After the initial solution is subjected to amplification by polymerase chain reaction (PCR), k-shortest paths could be visualized by polyacrylamide gel electrophoresis (PAGE) and the selection can be done ...
Yamamoto et al. carried out concentration-controlled DNA computing for accomplishing a local search for solving shortest path problem [6] by avoiding the generation of hopeless solutions. ...
doi:10.5019/j.ijcir.2005.30
fatcat:l7y76gtjbrfrpeiovpesdgthkq
Analysis of Different Pheromone Decay Techniques for ACO based Routing in Ad Hoc Wireless Networks
2012
International Journal of Computer Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Ant Colony Optimization (ACO) technique deals with exploratory behavior of ants while finding food by following a path based on the concentration of the pheromone. ...
for the exponential decay of pheromone by fine tuning of pheromone concentration to alleviate stagnation problem. ...
These factors alter the selection of the best path and avoid the stagnation. Last approach for stagnation problem is controlling the pheromone concentration. ...
doi:10.5120/8866-2833
fatcat:66dl2bvgm5dnjpkjmiposgwxku
Planning Tourists Evacuation Routes with Minimal Navigation Errors
2020
Transportation Research Procedia
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Such errors can be avoided by providing electronic guidance at various intersections along the evacuation path (controlled intersections). ...
Such errors can be avoided by providing electronic guidance at various intersections along the evacuation path (controlled intersections). ...
Acknowledgments This research was supported by a grant from the Ministry of Science & Technology, Israel & the Japan Science and Technology Agency (herein referred to as "JST"). ...
doi:10.1016/j.trpro.2020.03.094
fatcat:q2ey3ugek5e7fnax65y3lapbkq
A solution of TSP based on the ant colony algorithm improved by particle swarm optimization
2019
Discrete and Continuous Dynamical Systems. Series S
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
TSP is a classic problem in the field of logistics, and ant colony algorithm is an important way to solve the problem. ...
In this paper, the ant colony algorithm is improved by particle swarm optimization algorithm, and the ant colony algorithm is obtained by giving the ant colony a certain "particle property". ...
process is controlled by a taboo list. ...
doi:10.3934/dcdss.2019066
fatcat:xkay4js5dnennhns5lnvpiwn5y
Optimal search and rescue route design using an improved ant colony optimization
2020
Information Technology and Control
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
To solve the problem that the ant colony algorithm is easy to fall into local optimal solutions in the process of searching, the pheromone concentration updating strategy of the original ant colony algorithm ...
According to the actual situation of maritime search and rescue, the path weight based on the time of falling into the water is introduced into the algorithm to obtain the optimal route. ...
If the current shortest path length is shorter than the global shortest path length, the global solution is replaced by the current solution. Step6. ...
doi:10.5755/j01.itc.49.3.25295
fatcat:4622qrk5brd5nbbeygj2s3aygm
An Improved Ant Colony Optimization Algorithm for Solving TSP
2015
International Journal of Multimedia and Ubiquitous Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
An adaptive dynamic factor is introduced into pheromone updating rule to control the updating proportion of pheromone concentration with optimal solution in single iteration. ...
In the CEULAC algorithm, the direction guidance and real variable function are used to initialize pheromone concentration according to the path information of undirected graph. ...
Acknowledgment The program for the initialization, study, training, and simulation of the proposed algorithm in this article was written with the tool-box of MATLAB 2010b produced by the Math-Works. ...
doi:10.14257/ijmue.2015.10.12.16
fatcat:ssu2dv65vvdgtnroesu6dgwdta
Extreme Narrow Escape: shortest paths for the first particles to escape through a small window
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Escape trajectories concentrate along these geodesics, as confirmed by stochastic simulations when an obstacle is positioned in front of the narrow window. ...
Specifically, we show that in a large ensemble of independent Brownian trajectories, the first moment of the shortest arrival time is associated with the minimization of the energy-action and the optimal ...
To conclude, in the limit of large n, the Brownian paths contributing to the first moment of τ (n) are concentrated on the geodesics, solution of the variational problem 14. ...
arXiv:1804.10808v1
fatcat:ftmcizk3vzc53lu6zouxr5rafa
Dynamic Routing Optimization Algorithm for Software Defined Networking
2022
Computers Materials & Continua
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Due to the dynamic nature of SDNs, the proposed algorithm uses a mutation operator to overcome the memory-based problem of the ant colony algorithm. ...
Time and space complexity is the most critical problem of the current routing optimization algorithms for Software Defined Networking (SDN). ...
Time and space complexity is the most critical problem of the current SDN routing optimization algorithms. These algorithms use Dijkstra algorithm in exploring the shortest path. ...
doi:10.32604/cmc.2022.017787
fatcat:7yqedj3fsbf63p2jqa6ejplekm
Olympic Torch Relay Route Planning Based on Ant Colony Optimization
2018
Innovative Computing Information and Control Express Letters, Part B: Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
To increase competitiveness, the costs of personnel and time must be effectively controlled by minimization of unnecessary expenditure and wasted time. ...
The method used in this study can also be applied to many problems such as route planning, allocation, combination, scale, where risk and expenditure of manpower and resources need to be effectively reduced ...
The number of ants will change with time, and the pheromone concentration of the shortest path will become stronger. ...
doi:10.24507/icicelb.09.02.125
fatcat:ijgibr4ltjhjzi67a432yzrblm
Path Planning of an autonomous Mobile Robot using Swarm Based Optimization Techniques
2017
˜Al-œKhawarizmi engineering journal
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
conditions by providing the shortest path for multiple testing environments. ...
(ACO) has been proposed in this work to find the shortest and safest path for a mobile robot in different static environments with different complexities. ...
Pheromone control adopts several approaches to reduce the influence of experience and encourage the exploration of new paths that experience can also be reduced by controlling the amount of pheromone deposited ...
doi:10.22153/kej.2016.08.002
fatcat:orzahles4fdmzigtujrmkcyune
Based on Ant Colony Algorithm to Solve the Mobile Robots Intelligent Path Planning for Avoid Obstacles
2014
International Journal of Artificial Intelligence & Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
We tried to find a good way in mobile robot path planning by using ant colony algorithm, and it also provides some solving methods. ...
This paper analyzes the current development of robot and path planning algorithm for path planning to avoid obstacles in practice. ...
There existed some advantages to use above model to solve the robot avoid obstacles, we can get the best solution in the relative optimization by using of path optimization of multiple solutions. ...
doi:10.5121/ijaia.2014.5101
fatcat:k6xgaj6tojg45lwthzpo36zyli
« Previous
Showing results 1 — 15 out of 43,917 results