6,874 research outputs found
Uncertainty and Constraint Handling in Evolutionary Algorithms
This paper proposes two evolutionary algorithms. Firstly, a dynamic evolutionary algorithm is proposed that uses variable relocation vectors to adapt the current population to the new environment. The relocation vectors introduce a certain radius of uncertainty to be applied specifically to each individual and in effect restoring diversity and accelerating exploration. Furthermore, the algorithm provides higher re-usage, faster convergence and better adaptation. As a technique to be used at transient periods, the proposed algorithm provides the next evolutionary cycle with better initial population than any other randomly generated population. The algorithm can be easily integrated into standard evolutionary algorithms and other uncertainty handling techniques. Secondly, this paper proposes a new constraint handling technique for multi-objective evolutionary algorithms based on adaptive penalty functions and distance measures. Through this design, the objective space is modified to account for the performance and constraint violation of each individual. The modified objective functions are used in the non-dominance sorting to facilitate in evolution of optimal solutions not only in the feasible space but also in the infeasible space. The number of feasible individuals in the population is used to guide the search process either toward finding more feasible solutions or toward locating optimal solutions. The proposed method is simple to implement and does not need any parameter tuning.School of Electrical & Computer Engineerin
On the performance of a hybrid genetic algorithm in dynamic environments
The ability to track the optimum of dynamic environments is important in many
practical applications. In this paper, the capability of a hybrid genetic
algorithm (HGA) to track the optimum in some dynamic environments is
investigated for different functional dimensions, update frequencies, and
displacement strengths in different types of dynamic environments. Experimental
results are reported by using the HGA and some other existing evolutionary
algorithms in the literature. The results show that the HGA has better
capability to track the dynamic optimum than some other existing algorithms.Comment: This paper has been submitted to Applied Mathematics and Computation
on May 22, 2012 Revised version has been submitted to Applied Mathematics and
Computation on March 1, 201
Tackling Dynamic Vehicle Routing Problem with Time Windows by means of Ant Colony System
The Dynamic Vehicle Routing Problem with Time Windows (DVRPTW) is an
extension of the well-known Vehicle Routing Problem (VRP), which takes into
account the dynamic nature of the problem. This aspect requires the vehicle
routes to be updated in an ongoing manner as new customer requests arrive in
the system and must be incorporated into an evolving schedule during the
working day. Besides the vehicle capacity constraint involved in the classical
VRP, DVRPTW considers in addition time windows, which are able to better
capture real-world situations. Despite this, so far, few studies have focused
on tackling this problem of greater practical importance. To this end, this
study devises for the resolution of DVRPTW, an ant colony optimization based
algorithm, which resorts to a joint solution construction mechanism, able to
construct in parallel the vehicle routes. This method is coupled with a local
search procedure, aimed to further improve the solutions built by ants, and
with an insertion heuristics, which tries to reduce the number of vehicles used
to service the available customers. The experiments indicate that the proposed
algorithm is competitive and effective, and on DVRPTW instances with a higher
dynamicity level, it is able to yield better results compared to existing
ant-based approaches.Comment: 10 pages, 2 figure
Deadline Constrained Cloud Computing Resources Scheduling through an Ant Colony System Approach
Cloud computing resources scheduling is essential for executing workflows in the cloud platform because it relates to both execution time and execution cost. In this paper, we adopt a model that optimizes the execution cost while meeting deadline constraints. In solving this problem, we propose an Improved Ant Colony System (IACS) approach featuring two novel strategies. Firstly, a dynamic heuristic strategy is used to calculate a heuristic value during an evolutionary process by taking the workflow topological structure into consideration. Secondly, a double search strategy is used to initialize the pheromone and calculate the heuristic value according to the execution time at the beginning and to initialize the pheromone and calculate heuristic value according to the execution cost after a feasible solution is found. Therefore, the proposed IACS is adaptive to the search environment and to different objectives. We have conducted extensive experiments based on workflows with different scales and different cloud resources. We compare the result with a particle swarm optimization (PSO) approach and a dynamic objective genetic algorithm (DOGA) approach. Experimental results show that IACS is able to find better solutions with a lower cost than both PSO and DOGA do on various scheduling scales and deadline conditions
A framework for the joint placement of edge service infrastructure and User Plane Functions for 5G
Achieving less than 1 ms end-to-end communication latency, required for certain 5G services and use cases, is imposing severe technical challenges for the deployment of next-generation networks. To achieve such an ambitious goal, the service infrastructure and User Plane Function (UPF) placement at the network edge, is mandatory. However, this solution implies a substantial increase in deployment and operational costs. To cost-effectively solve this joint placement problem, this paper introduces a framework to jointly address the placement of edge nodes (ENs) and UPFs. Our framework proposal relies on Integer Linear Programming (ILP) and heuristic solutions. The main objective is to determine the ENs and UPFs’ optimal number and locations to minimize overall costs while satisfying the service requirements. To this aim, several parameters and factors are considered, such as capacity, latency, costs and site restrictions. The proposed solutions are evaluated based on different metrics and the obtained results showcase over 20% cost savings for the service infrastructure deployment. Moreover, the gap between the UPF placement heuristic and the optimal solution is equal to only one UPF in the worst cases, and a computation time reduction of over 35% is achieved in all the use cases studied.Postprint (author's final draft
- …