Evolutionary Algorithm for the Vehicles Routing Problem with Time Windows Based on a Constraint Satisfaction Technique
2011
IN THIS PAPER A MEMETIC ALGORITHM (MA) IS PROPOSED FOR SOLVING THE VEHICLES ROUTING PROBLEM WITH TIME WIN-DOWS (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.
Keywords:
- Correction
- Cite
- Save
- Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI