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 journalReview articlepeer-review

20 Scopus citations

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 languageEnglish (US)
Pages (from-to)19-35
Number of pages17
JournalJournal of Applied Research and Technology
Volume9
Issue number1
StatePublished - Apr 1 2011

Keywords

  • Districting
  • GRASP
  • Graph
  • Hybrid algorithm
  • Metaheuristic
  • Tabu search

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'A hybrid metaheuristic approach to optimize the districting design of a parcel company'. Together they form a unique fingerprint.

Cite this