All Title Author
Keywords Abstract

Publish in OALib Journal
ISSN: 2333-9721
APC: Only $99


Relative Articles


Evolutionary Algorithm for the Vehicles Routing Problem with Time Windows Based on a Constraint Satisfaction Technique

Keywords: memetic algorithm (ga-pcp), constraints satisfaction problem, precedence constraint posting, local search, vrptw.

Full-Text   Cite this paper   Add to My Lib


in this paper a memetic algorithm (ma) is proposed for solving the vehicles routing problem with time windows (vrptw) multi-objective, using a constraint satisfaction heuristic that allows pruning of the search space to direct a search towards good solutions that represent the individuals of the population. an evolutionary heuristic is applied in order to establish the crossover and mutation between sub-routes. the results of ma demonstrate that the use of constraints satisfaction technique permits ma to work more efficiently in the vrptw.


comments powered by Disqus

Contact Us


WhatsApp +8615387084133

WeChat 1538708413