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

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

Producción científica: Contribución a una revista › Reseña científica › revisión exhaustiva

30 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 original	Inglés estadounidense
Páginas (desde-hasta)	19-35
Número de páginas	17
Publicación	Journal of Applied Research and Technology
Volumen	9
N.º	1
Estado	Publicada - 1 abr. 2011
Publicado de forma externa	Sí

Palabras clave

Districting
Graph
GRASP
Hybrid algorithm
Metaheuristic
Tabu search

Otros archivos y enlaces

Citar esto

@article{6467203f1ab24805bbdf89b41c5390ee,

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, 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 = apr,

day = "1",

language = "American 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",

}

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

KW - Districting

KW - Graph

KW - GRASP

KW - Hybrid algorithm

KW - Metaheuristic

KW - Tabu search

UR - https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84860794103&origin=inward

UR - https://www.scopus.com/inward/citedby.uri?partnerID=HzOxMe3b&scp=84860794103&origin=inward

M3 - Scientific review

SN - 1665-6423

VL - 9

SP - 19

EP - 35

JO - Journal of Applied Research and Technology

JF - Journal of Applied Research and Technology

IS - 1

ER -

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

Resumen

Palabras clave

Otros archivos y enlaces

Huella

Citar esto