A Hybrid Metaheuristic Approach to Optimize the Districting Design of

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

Descripción completa

Detalles Bibliográficos
Autores: González-Ramírez, R.G., Smith, N. R., Askin, R. G., Miranda, Pablo A., Sánchez, J.M.
Tipo de recurso: artículo
Estado:Versión publicada
Fecha de publicación:2011
País:México
Institución:UNIVERSIDAD NACIONAL AUTÓNOMA DE MÉXICO
Repositorio:Journal of Applied Research and Technology
Idioma:inglés
OAI Identifier:oai:ojs2.localhost:article/441
Acceso en línea:https://jart.icat.unam.mx/index.php/jart/article/view/441
Access Level:acceso abierto
Palabra clave:Districting
hybrid algorithm
metaheuristic
graph
Tabu search
GRASP.
id MX_ee02fcc99b099af5cd7d6fd609e1af39
oai_identifier_str oai:ojs2.localhost:article/441
network_acronym_str MX
network_name_str México
repository_id_str
spelling A Hybrid Metaheuristic Approach to Optimize the Districting Design ofA Hybrid Metaheuristic Approach to Optimize the Districting Design ofGonzález-Ramírez, R.G.Smith, N. R.Askin, R. G.Miranda, Pablo A.Sánchez, J.M.Districtinghybrid algorithmmetaheuristicgraphTabu searchGRASP.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.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.Universidad Nacional Autónoma de México2011-04-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionPeer-reviewed Articleapplication/pdfhttps://jart.icat.unam.mx/index.php/jart/article/view/44110.22201/icat.16656423.2011.9.01.441Journal of Applied Research and Technology; Vol. 9 No. 01Journal of Applied Research and Technology; Vol. 9 Núm. 012448-67361665-642310.22201/icat.24486736e.2011.9.01reponame:Journal of Applied Research and Technologyinstname:UNIVERSIDAD NACIONAL AUTÓNOMA DE MÉXICOinstacron:UNAMenghttps://jart.icat.unam.mx/index.php/jart/article/view/441/437Copyright (c) 2018 Journal of Applied Research and Technologyinfo:eu-repo/semantics/openAccessoai:ojs2.localhost:article/4412024-08-16T17:54:15Z
dc.title.none.fl_str_mv A Hybrid Metaheuristic Approach to Optimize the Districting Design of
A Hybrid Metaheuristic Approach to Optimize the Districting Design of
title A Hybrid Metaheuristic Approach to Optimize the Districting Design of
spellingShingle A Hybrid Metaheuristic Approach to Optimize the Districting Design of
González-Ramírez, R.G.
Districting
hybrid algorithm
metaheuristic
graph
Tabu search
GRASP.
title_short A Hybrid Metaheuristic Approach to Optimize the Districting Design of
title_full A Hybrid Metaheuristic Approach to Optimize the Districting Design of
title_fullStr A Hybrid Metaheuristic Approach to Optimize the Districting Design of
title_full_unstemmed A Hybrid Metaheuristic Approach to Optimize the Districting Design of
title_sort A Hybrid Metaheuristic Approach to Optimize the Districting Design of
dc.creator.none.fl_str_mv González-Ramírez, R.G.
Smith, N. R.
Askin, R. G.
Miranda, Pablo A.
Sánchez, J.M.
author González-Ramírez, R.G.
author_facet González-Ramírez, R.G.
Smith, N. R.
Askin, R. G.
Miranda, Pablo A.
Sánchez, J.M.
author_role author
author2 Smith, N. R.
Askin, R. G.
Miranda, Pablo A.
Sánchez, J.M.
author2_role author
author
author
author
dc.subject.none.fl_str_mv Districting
hybrid algorithm
metaheuristic
graph
Tabu search
GRASP.
topic Districting
hybrid algorithm
metaheuristic
graph
Tabu search
GRASP.
description 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.
publishDate 2011
dc.date.none.fl_str_mv 2011-04-01
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv https://jart.icat.unam.mx/index.php/jart/article/view/441
10.22201/icat.16656423.2011.9.01.441
url https://jart.icat.unam.mx/index.php/jart/article/view/441
identifier_str_mv 10.22201/icat.16656423.2011.9.01.441
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv https://jart.icat.unam.mx/index.php/jart/article/view/441/437
dc.rights.none.fl_str_mv Copyright (c) 2018 Journal of Applied Research and Technology
info:eu-repo/semantics/openAccess
rights_invalid_str_mv Copyright (c) 2018 Journal of Applied Research and Technology
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Universidad Nacional Autónoma de México
publisher.none.fl_str_mv Universidad Nacional Autónoma de México
dc.source.none.fl_str_mv Journal of Applied Research and Technology; Vol. 9 No. 01
Journal of Applied Research and Technology; Vol. 9 Núm. 01
2448-6736
1665-6423
10.22201/icat.24486736e.2011.9.01
reponame:Journal of Applied Research and Technology
instname:UNIVERSIDAD NACIONAL AUTÓNOMA DE MÉXICO
instacron:UNAM
instname_str UNIVERSIDAD NACIONAL AUTÓNOMA DE MÉXICO
instacron_str UNAM
institution UNAM
reponame_str Journal of Applied Research and Technology
collection Journal of Applied Research and Technology
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1858177569419952128
score 15,812429

Similares en LA Referencia