A heuristic approach for a logistics districting problem

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

Research output: Contribution to journalArticle

6 Citations (Scopus)

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

Original languageEnglish (US)
Pages (from-to)3551-3562
Number of pages12
JournalInternational Journal of Innovative Computing, Information and Control
Volume6
Issue number8
StatePublished - Aug 2010

Fingerprint

Tabu search
Pickups
Logistics
Heuristics
Pickup and Delivery
Multistart
Industry
Tabu Search
Metaheuristics
Workload
Optimise
Formulation
Experimental Results

Keywords

  • Compactness
  • Districting
  • GRASP
  • Tabu search
  • Workload balance

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Information Systems
  • Software
  • Theoretical Computer Science

Cite this

A heuristic approach for a logistics districting problem. / González-Ramírez, Rosa G.; Smith, Neale R.; Askin, Ronald; Kalashinkov, Vyacheslav.

In: International Journal of Innovative Computing, Information and Control, Vol. 6, No. 8, 08.2010, p. 3551-3562.

Research output: Contribution to journalArticle

González-Ramírez, RG, Smith, NR, Askin, R & Kalashinkov, V 2010, 'A heuristic approach for a logistics districting problem', International Journal of Innovative Computing, Information and Control, vol. 6, no. 8, pp. 3551-3562.
González-Ramírez, Rosa G. ; Smith, Neale R. ; Askin, Ronald ; Kalashinkov, Vyacheslav. / A heuristic approach for a logistics districting problem. In: International Journal of Innovative Computing, Information and Control. 2010 ; Vol. 6, No. 8. pp. 3551-3562.
@article{7dd7c08f5d1e4464a349c460f40374c7,
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",
author = "Gonz{\'a}lez-Ram{\'i}rez, {Rosa G.} and Smith, {Neale R.} and Ronald Askin and Vyacheslav Kalashinkov",
year = "2010",
month = "8",
language = "English (US)",
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

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

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

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

M3 - Article

AN - SCOPUS:77956238907

VL - 6

SP - 3551

EP - 3562

JO - International Journal of Innovative Computing, Information and Control

JF - International Journal of Innovative Computing, Information and Control

SN - 1349-4198

IS - 8

ER -