A heuristic approach for a logistics districting problem

Rosa G. González-Ramírez; Neale R. Smith; Ronald G. Askin; Vyacheslav Kalashinkov

A heuristic approach for a logistics districting problem

Rosa G. González-Ramírez, Neale R. Smith, Ronald G. Askin, Vyacheslav Kalashinkov

Producción científica: Contribución a una revista › Artículo › revisión exhaustiva

8 Citas (Scopus)

Resumen

This article addresses a logistics districting problem for a company whose operations consist of the pickup and delivery of packages within a region. The service region is to be divided into districts, each served by a single vehicle that departs from a central depot. The district design aims to optimize two criteria: compact district shape and balance of workload content among districts. We present a mathematical formulation of the problem as well as a multi-start heuristic procedure to solve the problem. The procedure combines some elements of metaheuristics such as Tabu Search and GRASP. Experimental results in comparison with CPLEX solutions are presented.

Idioma original	Inglés
Páginas (desde-hasta)	3551-3562
Número de páginas	12
Publicación	International Journal of Innovative Computing, Information and Control
Volumen	6
N.º	8
Estado	Publicada - ago. 2010

Palabras clave

Compactness
Districting
GRASP
Tabu search
Workload balance

Otros archivos y enlaces

Citar esto

@article{f5f52e53eb4344eba9335eae0498111f,

title = "A heuristic approach for a logistics districting problem",

abstract = "This article addresses a logistics districting problem for a company whose operations consist of the pickup and delivery of packages within a region. The service region is to be divided into districts, each served by a single vehicle that departs from a central depot. The district design aims to optimize two criteria: compact district shape and balance of workload content among districts. We present a mathematical formulation of the problem as well as a multi-start heuristic procedure to solve the problem. The procedure combines some elements of metaheuristics such as Tabu Search and GRASP. Experimental results in comparison with CPLEX solutions are presented. ICIC International",

keywords = "Compactness, Districting, GRASP, Tabu search, Workload balance, Compactness, Districting, GRASP, Tabu search, Workload balance",

author = "Gonz{\'a}lez-Ram{\'i}rez, {Rosa G.} and Smith, {Neale R.} and Askin, {Ronald G.} and Vyacheslav Kalashinkov",

year = "2010",

month = aug,

language = "English",

volume = "6",

pages = "3551--3562",

journal = "International Journal of Innovative Computing, Information and Control",

issn = "1349-4198",

publisher = "IJICIC Editorial Office",

number = "8",

}

TY - JOUR

T1 - A heuristic approach for a logistics districting problem

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

AU - Smith, Neale R.

AU - Askin, Ronald G.

AU - Kalashinkov, Vyacheslav

PY - 2010/8

Y1 - 2010/8

N2 - This article addresses a logistics districting problem for a company whose operations consist of the pickup and delivery of packages within a region. The service region is to be divided into districts, each served by a single vehicle that departs from a central depot. The district design aims to optimize two criteria: compact district shape and balance of workload content among districts. We present a mathematical formulation of the problem as well as a multi-start heuristic procedure to solve the problem. The procedure combines some elements of metaheuristics such as Tabu Search and GRASP. Experimental results in comparison with CPLEX solutions are presented. ICIC International

AB - This article addresses a logistics districting problem for a company whose operations consist of the pickup and delivery of packages within a region. The service region is to be divided into districts, each served by a single vehicle that departs from a central depot. The district design aims to optimize two criteria: compact district shape and balance of workload content among districts. We present a mathematical formulation of the problem as well as a multi-start heuristic procedure to solve the problem. The procedure combines some elements of metaheuristics such as Tabu Search and GRASP. Experimental results in comparison with CPLEX solutions are presented. ICIC International

KW - Compactness

KW - Districting

KW - GRASP

KW - Tabu search

KW - Workload balance

KW - Compactness

KW - Districting

KW - GRASP

KW - Tabu search

KW - Workload balance

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

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

M3 - Article

SN - 1349-4198

VL - 6

SP - 3551

EP - 3562

JO - International Journal of Innovative Computing, Information and Control

JF - International Journal of Innovative Computing, Information and Control

IS - 8

ER -

A heuristic approach for a logistics districting problem

Resumen

Palabras clave

Otros archivos y enlaces

Huella

Citar esto