Now showing items 11-20 of 28
Evolutionary algorithms with segment-based search for multiobjective optimization problems
(IEEE Press, 2013-10-10)
This paper proposes a variation operator, called segment-based search (SBS), to improve the performance of evolutionary algorithms on continuous multiobjective optimization problems. SBS divides the search space into many ...
Fourth party logistics routing problem with fuzzy duration time
Benchmark Generator for the IEEE WCCI-2014 Competition on Evolutionary Computation for Dynamic Optimization Problems: Dynamic Travelling Salesman Problem Benchmark Generator
(De Montfort University, U.K., 2013-10)
In this report, the dynamic benchmark generator for permutation-encoded problems for the travelling salesman problem (DBGPTSP) proposed in is used to convert any static travelling salesman problem benchmark to a dynamic ...
IPESA-II: Improved Pareto envelope-based selection algorithm II
Analyzing evolutionary algorithms for dynamic optimization problems based on the dynamical system.
Evolutionary dynamic optimization: methodologies.
Genetic algorithms for dynamic routing problems in mobile ad hoc networks.