A hybrid approach for a constrained routing problem

Proceedings - HIS'04: 4th International Conference on Hybrid Intelligent Systems

Volumn , Issue , 2005, Pages 422-427

  Pérez, Jesús Fabián López ^a  

^a FACPYA UANL   (Mexico)

Author keywords

Genetic Algorithm; Logistics; NP Hard; Routing; Time Windows

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; COST BENEFIT ANALYSIS; GENETIC ALGORITHMS; LOGISTICS;

COMPUTATIONAL RESOURCE; ROUTING; TIME WINDOWS;

PROBLEM SOLVING;

EID: 28344442601     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. Applegate, D; Bixby, R; Chvátal, V; (1998), On the solution of traveling salesman problems. "Documenta Mathematica Extra Volume ICM III", USA.
2. Ascheuer, N; Fischetti, M; Grotschel, M. (2001), Solving ATSP with time windows by branch-and-cut, Springer-Verlag, Germany.
3. Ascheuer, N; Jünger, M; Reinelt, G. (2000), A branch & cut algorithm for the asymmetric Traveling Salesman Problem with precedence constraints, "Computational Optimization and Applications 17(1)", USA, pp. 2-7.
4. Cook, W; Rich, Jennifer. (1999), A parallel cutting-plane algorithm for the vehicle routing problem with time windows, Computational and Applied Mathematics Rice University, Houston USA.
5. Dumas, Y; Desrosiers, J; Solomon, M. (1995), An algorithm for the traveling salesman problem with time windows, "Operations Research 43(2)", USA, pp. 23-25.
6. Eijl Van, C. (1995), A polyhedral approach to the delivery man problem, "Technical Report 95-19", Department of Mathematics and Computer Science, Eindhoven University of Technology, the Netherlands.
7. Fisher, R. (1971), The Design of Experiments, Macmillan Publishers, London England, pp. 25-50.
8. Goldberg, D. (1995), Genetic Algorithms in Search, Optimization and Machine Learning, Addison Wesley Pub Co, University of Massachusetts, USA.
9. Lenstra, K. (1990), A Variable Depth Approach for the Single-Vehicle Pickup and Delivery Problem with Time Windows, "COSOR No. 90-48", Eindhoven University of Technology, Germany, pp. 35-90.
10. López, Fabián. (2004), Aplicación de un algoritmo Genético para un problema de logística de ruteo; Doctoral Thesis non published, FACPYA, Universidad Autónoma de Nuevo León, México, pp 170-220.
11. Mitrovic, Snezana. (1998), Pickup and Delivery Problem with Time Windows, "Technical Report SFU CMPT TR 1998-12", Canada, pp 38-39.
12. Palmgren, Myrna, (2001), A Column Generation Algorithm for the Log Truck Scheduling Problem, Department of Science and Technology (ITN), Linköping University, Norrköping Sweden, pp 3.
13. Savelsberg, M. (1995), Local search in Routing Problem with Time Windows, Annals of Operations Research, Rotherdam, the Netherlands, pp. 1-7.
14. Solomon, M. (1984), On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints, "Report 83-05-03", The Wharton School, USA.
15. Tsitsiklis, J. (1992), Special cases of traveling salesman and repairman problems with time windows, "Networks No. 22", USA.