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

R. G. González-Ramírez; N. R. Smith; Ronald 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, Ronald Askin, Pablo A. Miranda, J. M. Sánchez

Research output: Contribution to journal › Review article › peer-review

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.

Original language	English (US)
Pages (from-to)	19-35
Number of pages	17
Journal	Journal of Applied Research and Technology
Volume	9
Issue number	1
State	Published - Apr 2011

Keywords

Districting
GRASP
Graph
Hybrid algorithm
Metaheuristic
Tabu search

ASJC Scopus subject areas

General Engineering

Cite this

@article{3c5b1b0010f54b8993a90469a0154b4a,

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, GRASP, Graph, Hybrid algorithm, Metaheuristic, Tabu search",

author = "Gonz{\'a}lez-Ram{\'i}rez, {R. G.} and Smith, {N. R.} and Ronald Askin and Miranda, {Pablo A.} and S{\'a}nchez, {J. M.}",

year = "2011",

month = apr,

language = "English (US)",

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, Ronald

AU - Miranda, Pablo A.

AU - Sánchez, J. M.

PY - 2011/4

Y1 - 2011/4

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 - GRASP

KW - Graph

KW - Hybrid algorithm

KW - Metaheuristic

KW - Tabu search

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

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

M3 - Review article

AN - SCOPUS:84860794103

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

Abstract

Keywords

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this