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

 

M.G. Baldoquin de la Peña¹, A. Escalera Fariñas² and R. Linfati*³

 

¹ Facultad de Ingeniería, Pontificia Universidad Javeriana Cali Cali, Colombia.

² Centro de Estudios de Matemática, ISPJAE La Habana, Cuba.

³ Departamento de Ingeniería Industrial, Universidad del Bío-Bío Concepción, Chile. * rlinfati@ubiobio.cl

 

Abstract

Some of the complex logistical problems faced by companies combine the needs for strategic and tactical decisions concerning the interrelated issues of clustering, scheduling, and routing. Various strategies can be used to solve these problems. We present a problem of this type, involving a company whose fundamental objective is the commercialization of its product in the domestic market. The paper focuses on a model of and method for a solution to the problem of scheduling visits to customers, taking into account the relationship with other phases of product marketing. The model is nonlinear, involves binary and continuous variables, and solved heuristically. Computational experiments show that the proposed solution performed very well for both real-life and theoretical instances.

Keywords: logistics, scheduling, heuristic.

 

DESCARGAR ARTÍCULO EN FORMATO PDF

 

References

[1] B.Y. Zhao, J. Kubiatowicz, and A.D. Joseph, "Tapestry: An infrastructure for fault-tolerant wide-area location and routing," Computer Science, vol. 74, no. 46, pp. 11-20, 2001.         [ Links ]

[2] G. Nagy and S. Salhi. "Location-routing: Issues, models and methods," European Journal of Operational Research, vol. 177, no. 2, pp. 649-672, 2007.         [ Links ]

[3] M.E. Cortés, and R.A. García, "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, vol. 20, pp. 51-57, 2007.         [ Links ]

[4] Y. Deng and J.F. Bard, "A reactive GRASP with path relinking for capacitated clustering," Journal of Heuristics, vol. 17, no. 2, pp. 119-152, 2011.         [ Links ]

[5] G. González and F. González, "Metaheurísticas aplicadas al ruteo de vehículos. Un caso de estudio, Parte 3: Genetic clustering and Tabu routing," Ing. Investig., vol. 27, no. 2, pp. 106-113, 2007.         [ Links ]

[6] R. Freling, D. Huisman and A.P.M. Wagelmans, "Models and algorithms for integration of vehicle and crew scheduling," Journal of Scheduling, vol. 6 no. 1, pp. 63-85, 2003.         [ Links ]

[7] J.E. Korsvik and K. Fagerholt, "A tabu search heuristic for ship routing and scheduling with flexible cargo quantities," Journal of Heuristics, vol. 16 no. 2, pp. 117-137, 2010.         [ Links ]

[8] I. Averbakh and O. Berman, "A simple heuristic for machine flow-shop and its applications in routing-scheduling problems," Operations Research, vol. 47, no. 1, pp. 165-170, 1999.         [ Links ]

[9] V. Jayaraman, "Transportation, facility location and inventory issues in distribution network design," International Journal of Operations & Production Management, vol. 18, no. 5, pp. 471-494, 1998.         [ Links ]

[10] P. Chakroborty, "Genetic algorithms for optimal urban transit network design," Computer-Aided Civil and Infrastructure Engineering, vol. 18, no. 3, pp. 184-200, 2003.         [ Links ]

[11] S. Guillén-Burguete, H. Sánchez-Larios, J.G. Vázquez-Vázquez, "An Optimal Transportation Schedule of Mobile Equipment," Journal of Applied Research and Technology, vol. 10, no. 5, pp. 713-723, 2012.         [ Links ]

[12] A. Caprara, M. Monaci and P. Toth, A global method for crew planning in railway applications. In: Daduna, J., Voss, S. (eds.) Computer-Aided Transit Scheduling. Lecture Notes in Economics and Mathematical Systems, 505, pp. 17-36. Springer, New York. 2001.         [ Links ]

[13] J. Bar-Ilan, G. Kortsarz and D. Peleg, "How to allocate network centers," J. Algorithms, vol. 15, no. 3, pp. 385-41, 1993.         [ Links ]

[14] D.W. Pentico, "Assignment problems: A golden anniversary survey," European Journal of Operational Research, vol. 176, no. 2, pp. 774-793, 2007.         [ Links ]

[15] A. Letchford and S. Burer, "Non-convex mixed-integer nonlinear programming: a survey," Surveys in Operations Research and Management Science, vol. 17, no. 2, pp. 97-106, 2012.         [ Links ]

[16] A. Escalera, "Sistema soporte a la decisión para el agrupamiento en zonas de distribución de los customeres de BRASCUBA S.A.," Tesis de maestría en Ciencias en Informática Empresarial, La Habana, Cuba, Mayo 2011.         [ Links ]

[17] J. Pacheco and M. Beltrán, "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, vol. 43, no. 148, pp. 209-224, 2001.         [ Links ]

[18] E. Taillard, "Heuristic Methods for Large Centroid Clustering Problems," Journal of Heuristics, vol. 9, no. 1, pp. 51-73, 2003.         [ Links ]

[19] J. Homberger, Extended SOLOMON's VRPTW instances (online), 1998, http://www.fernunihagen.de/WINF/touren/inhalte/probinst.htm.         [ Links ]