A Model and Solution Method for Solving the Real-world and Complex Problem of Scheduling Visits to Customers

Zhao, 2001, Tapestry: An infrastructure for fault-tolerant wide-area location and routing, Computer Science, 74, 11 Nagy, 2007, Location-routing: Issues, models and methods, European Journal of Operational Research, 177, 649, 10.1016/j.ejor.2006.04.004 Cortés, 2007, Solución al problema de asignación-distribución. Mosaicos Matemáticos, Memorias de la XVII Semana Regional de Investigación y Docencia en Matemáticas, Universidad de Sonora México, 20, 51 Deng, 2011, A reactive GRASP with path relinking for capacitated clustering, Journal of Heuristics, 17, 119, 10.1007/s10732-010-9129-z González, 2007, Metaheurísticas aplicadas al ruteo de vehículos. Un caso de estudio, Parte 3: Genetic clustering and Tabu routing, Ing. Investig., 27, 106, 10.15446/ing.investig.v27n2.14838 Freling, 2003, Models and algorithms for integration of vehicle and crew scheduling, Journal of Scheduling, 6, 63, 10.1023/A:1022287504028 Korsvik, 2010, A tabu search heuristic for ship routing and scheduling with flexible cargo quantities, Journal of Heuristics, 16, 117, 10.1007/s10732-008-9092-0 Averbakh, 1999, A simple heuristic for machine flow-shop and its applications in routing-scheduling problems, Operations Research, 47, 165, 10.1287/opre.47.1.165 Jayaraman, 1998, Transportation, facility location and inventory issues in distribution network design, International Journal of Operations & Production Management, 18, 471, 10.1108/01443579810206299 Chakroborty, 2003, Genetic algorithms for optimal urban transit network design, Computer-Aided Civil and Infrastructure Engineering, 18, 184, 10.1111/1467-8667.00309 Guillén - Burguete, 2012, An Optimal Transportation Schedule of Mobile Equipment, Journal of Applied Research and Technology, 10, 713, 10.22201/icat.16656423.2012.10.5.362 Caprara, 2001, A global method for crew planning in railway applications, 505, 17, 10.1007/978-3-642-56423-9_2 Bar-Ilan, 1993, How to allocate network centers, J. Algorithms, 15, 341 Pentico, 2007, Assignment problems: A golden anniversary survey, European Journal of Operational Research, 176, 774, 10.1016/j.ejor.2005.09.014 Letchford, 2012, Non-convex mixed-integer nonlinear programming: a survey, Surveys in Operations Research and Management Science, 17, 97, 10.1016/j.sorms.2012.08.001 Escalera, 2011 Pacheco, 2001, Análisis de nuevos métodos de clasificación. Un ejemplo ilustrativo de su uso en la agrupación de los municipios de Castilla y León, Estadística Española, 43, 209 Taillard, 2003, Heuristic Methods for Large Centroid Clustering Problems, Journal of Heuristics, 9, 51, 10.1023/A:1021841728075 J. Homberger, Extended SOLOMON’s VRPTW instances (online), 1998, http://www.fernuni-hagen.de/WINF/touren/inhalte/probinst.htm