SciELO - Scientific Electronic Library Online

 
vol.9 número1Maximum Likelihood Position Location with a Limited Number of ReferencesOn the Weight Distribution of the Dual of some Cyclic Codes with Two Non Conjugated Zeros índice de autoresíndice de assuntospesquisa de artigos
Home Pagelista alfabética de periódicos  

Journal of applied research and technology

versão impressa ISSN 1665-6423

J. appl. res. technol vol.9 no.1 México Abr. 2011

 

A Hybrid Metaheuristic Approach to Optimize the Districting Design of a Parcel Company

 

R.G. González–Ramírez*1, N. R. Smith2, R. G. Askin3, Pablo A. Miranda4, J.M. Sánchez5

 

1,4 Pontificia Universidad Católica de Valparaíso, Escuela de Ingeniería Industrial, Av. Brasil 2251, Valparaíso, Chile. *E–mail: rosa.gonzalez@ucv.cl

2,5 ITESM, Campus Monterrey, Centro de Calidad y Manufactura. 2501 Eugenio Garza Sada South Av. Monterrey, Nuevo León, Mexico. CP. 64849.

3Arizona State University. School of Computing, Informatics and Decision Systems Engineering, Arizona State University, Tempe, AZ 85287–8809, USA

 

ABSTRACT

In this article we address a districting problem faced by a pickup and delivery parcel company over a determined service region. The service region is divided into districts, each served by a single vehicle that departs from a central depot. Two objectives are optimized: compactness and balance of the workload content among the districts. We present a mathematical formulation of the problem and a heuristic algorithm to solve the problem. Numerical results are presented in comparison to CPLEX 11.1 solutions for the smaller size instances. The results show that the heuristic performs well. The algorithm is able to solve moderate size instances in reasonable computational time, given the strategic nature of the problem.

Keywords: Districting, hybrid algorithm, metaheuristic, graph, Tabu search, GRASP.

 

RESUMEN

En este artículo abordamos un problema de sectorización para actividades logísticas que enfrenta una empresa de entrega y recolección de paquetería en una determinada región. La región a la que se da servicio es dividida en distritos, cada uno atendido por un solo vehículo que sale de un depósito central. Se busca optimizar dos objetivos: compacidad y balance de la carga de trabajo. Presentamos la formulación matemática del problema y un algoritmo heurístico para resolverlo. Se presentan resultados numéricos en comparación con las soluciones encontradas por CPLEX 11.1 para las instancias de menor tamaño. Los resultados muestran un buen desempeño del algoritmo heurístico, el cual es capaz de resolver instancias de tamaño moderado en tiempos razonables, dada la naturaleza estratégica del problema.

 

DESCARGAR ARTÍCULO EN FORMATO PDF

 

References

[1] Altman M., "Is Automation the Answer: The Computational Complexity of Automated Redistricting". Rutgers Computer and Law Technology Journal, Vol. 23 No.1, 1997, pp. 81–142.         [ Links ]

[2] Feo T.A. and Resende M.G.C. "Greedy randomized adaptive search procedures". J. Of Global Optimization, 6: 109–133, 1995.         [ Links ]

[3]Glover, F. (1986) "Future Paths for Integer Programming and Links to Artificial Intelligence", Computers and Operations Research, 5, 533–549.         [ Links ]

[4] Glover F. and Laguna M. "Tabu Search". Kluwer Academic Publishers, 1997        [ Links ]

[5] Glover F., and Laguna M., "Tabu Search", Modern Heuristic Techniques for Combinatorial Problems, C.R. Reeves, ed., Blackwell Scientific Publishing, 71–140, 1993.         [ Links ]

[6]Langevin A, Soumis F. "Design of multiple–vehicle delivery tours satisfying time constraints". Transportation Research–B, Vol. 23B No. 2, 1989, pp.123–138.         [ Links ]

[7] Novaes A G.N, Graciolli O.D, "Designing multi–delivery tours in a grid–cell format." European Journal of Operational Research, Vol. 119, 1999, pp.613–634.         [ Links ]

[8] Novaes, A.G.N., Souza de Cursi, J.E., Graciolli, O.D. "A continuous approach to the design of physical distribution systems". Computers & Operations Research. Vol. 27, 2000, pp. 877–893.         [ Links ]

[9] Muyldermans L, Cattrysse D, Oudheusden D, Lotan T. "Districting for salt spreading operations" European Journal of the Operational Research, Vol. 139 No. 3, 2002, pp. 521–532.         [ Links ]

[10] Muyldermans, L., Cattrysse D. and Van Oudheusden, D. "District Design for arc–routing applications". Journal of Operational Research Society, Vol. 54, 2003, pp. 1209–1221.         [ Links ]

[11] Haugland, D. Ho, S.C, Laporte G. (2007) "Designing delivery districts for the vehicle routing problem with stochastic demands", European Journal of Operational Research, 180(3): 997–1010.         [ Links ]

[12] Moonen M. "Patrol deployment, districting, and dispatching within the urban police: state of the art". Leuven, Belgium: Centre for Industrial Management, Katholieke Universiteit Leuven, 68, HV 8080 .P2 M77, 2004.         [ Links ]

 [13] Erkut, E., Neuman S. "Comparison of four models for dispersing facilities". INFOR, Vol. 29, No. 2, 1991, pp. 68–86.         [ Links ]