A hybrid metaheuristic approach to optimize the districting design of a parcel company

R. G. González-Ramírez, N. R. Smith, R. G. Askin, Pablo A. Miranda, J. M. Sánchez

Resultado de la investigación: Review article

18 Citas (Scopus)

Resumen

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.

Idioma originalEnglish
Páginas (desde-hasta)19-35
Número de páginas17
PublicaciónJournal of Applied Research and Technology
Volumen9
N.º1
EstadoPublished - 1 abr 2011

Huella dactilar

Pickups
Heuristic algorithms
Industry

ASJC Scopus subject areas

  • Engineering(all)

Citar esto

González-Ramírez, R. G., Smith, N. R., Askin, R. G., Miranda, P. A., & Sánchez, J. M. (2011). A hybrid metaheuristic approach to optimize the districting design of a parcel company. Journal of Applied Research and Technology, 9(1), 19-35.
González-Ramírez, R. G. ; Smith, N. R. ; Askin, R. G. ; Miranda, Pablo A. ; Sánchez, J. M. / A hybrid metaheuristic approach to optimize the districting design of a parcel company. En: Journal of Applied Research and Technology. 2011 ; Vol. 9, N.º 1. pp. 19-35.
@article{1bf129591649453399307d0a727d780f,
title = "A hybrid metaheuristic approach to optimize the districting design of a parcel company",
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, Graph, GRASP, Hybrid algorithm, Metaheuristic, Tabu search",
author = "Gonz{\'a}lez-Ram{\'i}rez, {R. G.} and Smith, {N. R.} and Askin, {R. G.} and Miranda, {Pablo A.} and S{\'a}nchez, {J. M.}",
year = "2011",
month = "4",
day = "1",
language = "English",
volume = "9",
pages = "19--35",
journal = "Journal of Applied Research and Technology",
issn = "1665-6423",
publisher = "Centro de Ciencias Aplicadas y Desarrollo Tecnologico, Universidad Nacional Autonoma de Mexico",
number = "1",

}

González-Ramírez, RG, Smith, NR, Askin, RG, Miranda, PA & Sánchez, JM 2011, 'A hybrid metaheuristic approach to optimize the districting design of a parcel company', Journal of Applied Research and Technology, vol. 9, n.º 1, pp. 19-35.

A hybrid metaheuristic approach to optimize the districting design of a parcel company. / González-Ramírez, R. G.; Smith, N. R.; Askin, R. G.; Miranda, Pablo A.; Sánchez, J. M.

En: Journal of Applied Research and Technology, Vol. 9, N.º 1, 01.04.2011, p. 19-35.

Resultado de la investigación: Review article

TY - JOUR

T1 - A hybrid metaheuristic approach to optimize the districting design of a parcel company

AU - González-Ramírez, R. G.

AU - Smith, N. R.

AU - Askin, R. G.

AU - Miranda, Pablo A.

AU - Sánchez, J. M.

PY - 2011/4/1

Y1 - 2011/4/1

N2 - 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.

AB - 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.

KW - Districting

KW - Graph

KW - GRASP

KW - Hybrid algorithm

KW - Metaheuristic

KW - Tabu search

UR - http://www.scopus.com/inward/record.url?scp=84860794103&partnerID=8YFLogxK

M3 - Review article

AN - SCOPUS:84860794103

VL - 9

SP - 19

EP - 35

JO - Journal of Applied Research and Technology

JF - Journal of Applied Research and Technology

SN - 1665-6423

IS - 1

ER -