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 Scopus citations

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 1 2010

Keywords

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

ASJC Scopus subject areas

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

Fingerprint Dive into the research topics of 'A heuristic approach for a logistics districting problem'. Together they form a unique fingerprint.

  • Cite this