A New Memetic Algorithm for the Asymmetric Traveling Salesman Problem
Journal of Heuristics
Hybrid multi-agent architecture as a real-time problem-solving model
Expert Systems with Applications: An International Journal
A memetic algorithm for evolutionary prototype selection: A scaling up approach
Pattern Recognition
Memetic Algorithm for Intense Local Search Methods Using Local Search Chains
HM '08 Proceedings of the 5th International Workshop on Hybrid Metaheuristics
A memetic-clustering-based evolution strategy for traveling salesman problems
RSKT'07 Proceedings of the 2nd international conference on Rough sets and knowledge technology
| Hi-index | 0.00 |
The main purpose of this study is to find out a good solution to the vehicle routing problem considering heterogeneous vehicles. This problem tries to solve the generation of paths and the assignment of buses on these routes. The objective of this problem is to minimize the number of vehicles required and to maximize the number of demands transported. This paper considers a Memetic Algorithm for the vehicle routing problem with heterogeneous fleet for any transport problem between many origins and many destinations. A Memetic Algorithm always maintains a population of different solutions to the problem, each of which operates as an agent. These agents interact between themselves within a framework of competition and cooperation. Extensive computational tests on some instances taken from the literature reveal the effectiveness of the proposed algorithm.