The Multiple Traveling Salesman Problem (MTSP) is considered as an NP-complete problem due to the difficulty of finding shortest tour between different cities with a set constraints such visiting each city once by one salesman. solution represents sum all tours' costs performed n salesmen. In this research, we propose novel approach find solutions for various instances MTSP based on memetic alg...

We present an approach for regression problems that employs analytic continued fractions as a novel representation. Comparative computational results using memetic algorithm are reported in this work. Our experiments included fifteen other different machine learning approaches including five genetic programming methods symbolic and ten methods. The comparison on training test generalization was...

The lifetime of wireless sensor networks could be extended and it could cover all targets is based on memetic algorithm approach. Darwinian evolutionary and Lamarckian enhancement uses memetic algorithm. This algorithm also gives better solution than any other algorithms. Many Task Assignment Problems(TAP) and particle swarm optimization techniques formulated this harmony search algorithm. The ...

Memetic algorithms(MAs) represent one of the promising areas of evolutionary algorithms. However, there are many issues to be solved to design a robust MA. In this paper, we introduce an adaptive memetic algorithm, named GADEDHC, which combines a genetic algorithm and a differential evolution algorithm as global search methods with a directional hill climbing algorithm as local search method. I...

Evolutionary Algorithms (EAs) are population based algorithms, which allow for simultaneous exploration of different parts in the Pareto optimal set. This paper presents Memetic Elitist Pareto Evolutionary Algorithm of Three-Term Backpropagation Network for Classification Problems. This memetic elitist Pareto evolutionary algorithm is called METBP and used to evolve Three-term Backpropagation (...

In allusion to such problems as low accuracy and long convergence time in traditional two-echelon vehicle routing optimization algorithm, a Memetic algorithm (QDEMA) based on Q learning theory and differential evolution is proposed in this article to solve above problems. Firstly, it is necessary to research the two-echelon vehicle routing optimization problem and adopt the optimal segmentation...

Inspired by a real-life case in the Brussels Capital Region, Belgium, this paper provides Memetic Algorithm with Sequential Split procedure (MASS) for solving large variety of waste collection problems multiple depots, restricted vehicle fleet at each depot, (intermediate) processing facilities, capacity restrictions per facility and partial pick-ups. MASS first generates satisfactory initial s...