An Evolutionary Approach for a Topologic Constrained Routing Problem

Authors:
Jesus Fabian;Lopez Perez
Affiliations:
FACPYA UANL, Monterrey, México;FACPYA UANL, Monterrey, México
Venue:
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 6 - Volume 07
Year:
2005

Citing 2
Cited 0

A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints

Computational Optimization and Applications
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning

Quantified Score

Hi-index	0.00

Visualization

Abstract

Our problem is about a routing of a vehicle with pickup and delivery of product with time window constraints.This problem requires to be attended with instances of medium scale (nodes驴100).A strong active time window exists (驴90%) with a large factor of amplitude (驴75%). This problem is NP-hard and for such motive the application of an exact method is limited by the computational time.This paper proposes a specialized genetic algorithm.We report good solutions in computational times below 5 minutes.The previous finding allows its application in business environment where the decision time is critical.