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 materiabúsqueda de artículos
Home Pagelista alfabética de revistas  

Journal of applied research and technology

versión impresa ISSN 1665-6423

Resumen

GONZALEZ-RAMIREZ, R.G. et al. A Hybrid Metaheuristic Approach to Optimize the Districting Design of a Parcel Company. J. appl. res. technol [online]. 2011, vol.9, n.1, pp. 19-35. ISSN 1665-6423.

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.

Palabras llave : Districting; hybrid algorithm; metaheuristic; graph; Tabu search; GRASP.

        · resumen en Español     · texto en Inglés     · pdf en Inglés