Information retrieval in P2P networks using genetic algorithm
WWW '05 Special interest tracks and posters of the 14th international conference on World Wide Web
On the practical genetic algorithms
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Optimizing parameters of a mobile ad hoc network protocol with a genetic algorithm
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
A new approach for shortest path routing problem by random key-based GA
Proceedings of the 8th annual conference on Genetic and evolutionary computation
A hybrid method for solving ARWA problem on WDM network
Computer Communications
Group multicast routing problem: A genetic algorithms based approach
Computer Networks: The International Journal of Computer and Telecommunications Networking
Energy-aware topology control for wireless sensor networks using memetic algorithms
Computer Communications
Solving the shortest path problem in vehicle navigation system by ant colony algorithm
ISCGAV'07 Proceedings of the 7th WSEAS International Conference on Signal Processing, Computational Geometry & Artificial Vision
An improved genetic algorithm with initial population strategy and self-adaptive member grouping
Computers and Structures
A fastest route planning for LBS based on traffic prediction
ICS'05 Proceedings of the 9th WSEAS International Conference on Systems
Dynamic route planning for car navigation systems using virus genetic algorithms
International Journal of Knowledge-based and Intelligent Engineering Systems
Crossover can provably be useful in evolutionary computation
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Solving shortest path problem using particle swarm optimization
Applied Soft Computing
A Study on Genetic Algorithms for the DARP Problem
IWINAC '07 Proceedings of the 2nd international work-conference on The Interplay Between Natural and Artificial Computation, Part I: Bio-inspired Modeling of Cognitive Tasks
A polygon description based similarity measurement of stock market behavior
Expert Systems with Applications: An International Journal
Find multi-objective paths in stochastic networks via chaotic immune PSO
Expert Systems with Applications: An International Journal
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
IEEE Transactions on Audio, Speech, and Language Processing
Computer Networks: The International Journal of Computer and Telecommunications Networking
On potential energy models for ea-based ab initio protein structure prediction
Evolutionary Computation
Genetic algorithm based routing method for efficient data transmission in sensor networks
ICIC'07 Proceedings of the intelligent computing 3rd international conference on Advanced intelligent computing theories and applications
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part III
Genetic algorithms with immigrants schemes for dynamic multicast problems in mobile ad hoc networks
Engineering Applications of Artificial Intelligence
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
International Journal of Metaheuristics
Efficient node distribution techniques in mobile ad hoc networks using game theory
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Expert Systems with Applications: An International Journal
Design of a route guidance system with shortest driving time based on genetic algorithm
ACACOS'11 Proceedings of the 10th WSEAS international conference on Applied computer and applied computational science
A genetic-algorithm-based approach to UAV path planning problem
SMO'05 Proceedings of the 5th WSEAS international conference on Simulation, modelling and optimization
ICONIP'06 Proceedings of the 13th international conference on Neural information processing - Volume Part III
Development of hybrid evolutionary algorithms for production scheduling of hot strip mill
Computers and Operations Research
Time-dependent personal tour planning and scheduling in metropolises
Expert Systems with Applications: An International Journal
Explorations on template-directed genetic repair using ancient ancestors and other templates
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
Grouping packet scheduling for virtual networks by genetic algorithm
Proceedings of the 6th International Conference on Future Internet Technologies
A Cross-Layer Multi-Hop Simulator for IEEE 802.11e
Wireless Personal Communications: An International Journal
Genetic optimization for transportation problem
Proceedings of the 15th WSEAS international conference on Systems
A novel multi-objective evolutionary algorithm for shortest path routing problem
International Journal of Communication Networks and Distributed Systems
Expert Systems with Applications: An International Journal
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part II
Simultaneous multiobjective multiple route selection using genetic algorithm for car navigation
PReMI'05 Proceedings of the First international conference on Pattern Recognition and Machine Intelligence
A hybrid genetic algorithm for solving the length-balanced two arc-disjoint shortest paths problem
IEA/AIE'06 Proceedings of the 19th international conference on Advances in Applied Artificial Intelligence: industrial, Engineering and Other Applications of Applied Intelligent Systems
EvoApplicatons'10 Proceedings of the 2010 international conference on Applications of Evolutionary Computation - Volume Part I
Crossover can provably be useful in evolutionary computation
Theoretical Computer Science
Optimal route determination technology based on trajectory querying moving object database
DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications
Chaotic populations in genetic algorithms
Applied Soft Computing
Mathematical and Computer Modelling: An International Journal
Sequence design for MPG QS-CDMA systems based on heuristic combinatorial optimization
Wireless Communications & Mobile Computing
FWM aware evolutionary programming algorithm for transparent optical networks
Photonic Network Communications
Multi-objective optimal path selection in electric vehicles
Artificial Life and Robotics
Information Sciences: an International Journal
A genetic algorithm for finding a path subject to two constraints
Applied Soft Computing
A metaheuristic approach for optical network optimization problems
Applied Soft Computing
Using genetic algorithms for navigation planning in dynamic environments
Applied Computational Intelligence and Soft Computing
An intelligent routing approach using genetic algorithms for quality graded network
International Journal of Intelligent Systems Technologies and Applications
A space search optimization algorithm with accelerated convergence strategies
Applied Soft Computing
Meta-heuristic algorithms for optimized network flow wavelet-based image coding
Applied Soft Computing
Federation Lifecycle Management Incorporating Coordination of Bio-inspired Self-management Processes
Journal of Network and Systems Management
Hi-index | 0.01 |
This paper presents a genetic algorithmic approach to the shortest path (SP) routing problem. Variable-length chromosomes (strings) and their genes (parameters) have been used for encoding the problem. The crossover operation exchanges partial chromosomes (partial routes) at positionally independent crossing sites and the mutation operation maintains the genetic diversity of the population. The proposed algorithm can cure all the infeasible chromosomes with a simple repair function. Crossover and mutation together provide a search capability that results in improved quality of solution and enhanced rate of convergence. This paper also develops a population-sizing equation that facilitates a solution with desired quality. It is based on the gambler ruin model; the equation has been further enhanced and generalized. The equation relates the size of the population, quality of solution, cardinality of the alphabet, and other parameters of the proposed algorithm. Computer simulations show that the proposed algorithm exhibits a much better quality of solution (route optimality) and a much higher rate of convergence than other algorithms. The results are relatively independent of problem types for almost all source-destination pairs. Furthermore, simulation studies emphasize the usefulness of the population-sizing equation. The equation scales to larger networks. It is felt that it can be used for determining an adequate population size in the SP routing problem.