Genetic Algorithm Based Optimisation for Bandwidth Allocation for Virtual Paths ( Ga - Bavp )
نویسندگان
چکیده
Genetic Algorithm does not increase as fast as the classical constrained optimisation algorithm. A hybrid scheme is also introduced, combining the benefits of both algorithms. It exhibited better overall convergence rate but the same solution as CCO-BAVP.
منابع مشابه
Bandwidth Allocation for Virtual Paths (BAVP): Investigation of Performance of Classical Constrained and Genetic Algorithm Based Optimisation Techniques
−We investigate the performance of a classical constrained optimisation (CCO) algorithm and a constrained optimisation Genetic Algorithm (GA) for solving the Bandwidth Allocation for Virtual Paths (BAVP) problem. We compare throughput, fairness and time complexity of GA-BAVP and CCO-BAVP for several node topologies. The results on maximising the throughput obtained with GA-BAVP and CCOBAVP are ...
متن کاملOptimisation of assembly scheduling in VCIM systems using genetic algorithm
Assembly plays an important role in any production system as it constitutes a significant portion of the lead time and cost of a product. Virtual computer-integrated manufacturing (VCIM) system is a modern production system being conceptually developed to extend the application of traditional computer-integrated manufacturing (CIM) system to global level. Assembly scheduling in VCIM systems is ...
متن کاملAggregated bandwidth allocation: investigation of performance of classical constrained and genetic algorithm based optimisation techniques
Algorithm does not increase as fast as the classical constrained optimisation algorithm. A hybrid scheme is also introduced, combining the benefits of both algorithms. It exhibited better overall convergence rate but the same solution as CCO-BAVP. More work is needed to investigate the usefulness of GAs in larger network topologies, as well as to multiobjective bandwidth allocation problems.
متن کاملScheduling Problem of Virtual Cellular Manufacturing Systems (VCMS); Using Simulated Annealing and Genetic Algorithm based Heuristics
In this paper, we present a simulated annealing (SA) and a genetic algorithm (GA) based on heuristics for scheduling problem of jobs in virtual cellular manufacturing systems. A virtual manufacturing cell (VMC) is a group of resources that is dedicated to the manufacturing of a part family. Although this grouping is not reflected in the physical structure of the manufacturing system, but machin...
متن کاملScheduling Problem of Virtual Cellular Manufacturing Systems (VCMS); Using Simulated Annealing and Genetic Algorithm based Heuristics
In this paper, we present a simulated annealing (SA) and a genetic algorithm (GA) based on heuristics for scheduling problem of jobs in virtual cellular manufacturing systems. A virtual manufacturing cell (VMC) is a group of resources that is dedicated to the manufacturing of a part family. Although this grouping is not reflected in the physical structure of the manufacturing system, but machin...
متن کامل