Dynamic design of sales territories

Hongtao Lei; Gilbert Laporte; Yajie Liu; Tao Zhang

doi:10.1016/j.cor.2014.11.008

Dynamic design of sales territories

Hongtao Lei, Gilbert Laporte, Yajie Liu, Tao Zhang

Research output: Contribution to journal › Article › peer-review

22 Citations (Scopus)

Abstract

We introduce the Multiple Traveling Salesmen and Districting Problem with Multi-periods and Multi-depots. In this problem, the compactness of the subdistricts, the dissimilarity measure of districts and an equity measure of salesmen profit are considered as part of the objective function, and the salesman travel cost on each subdistrict is approximated by the Beardwood-Halton-Hammersley formula. An adaptive large neighbourhood search metaheuristic is developed for the problem. It was tested on modified Solomon and Gehring & Homberger instances. Computational results confirm the effectiveness of the proposed metaheuristic.

Original language	English
Pages (from-to)	84-92
Number of pages	9
Journal	Computers and Operations Research
Volume	56
DOIs	https://doi.org/10.1016/j.cor.2014.11.008
Publication status	Published - Apr 2015

Keywords

Adaptive large neighbourhood search
Districting
Traveling salesman

ASJC Scopus subject areas

Computer Science(all)
Modelling and Simulation
Management Science and Operations Research

Access to Document

10.1016/j.cor.2014.11.008

Link to publication in Scopus

Fingerprint Dive into the research topics of 'Dynamic design of sales territories'. Together they form a unique fingerprint.

Cite this

@article{4f1abeb3f92e40239cc606fd76547102,

title = "Dynamic design of sales territories",

abstract = "We introduce the Multiple Traveling Salesmen and Districting Problem with Multi-periods and Multi-depots. In this problem, the compactness of the subdistricts, the dissimilarity measure of districts and an equity measure of salesmen profit are considered as part of the objective function, and the salesman travel cost on each subdistrict is approximated by the Beardwood-Halton-Hammersley formula. An adaptive large neighbourhood search metaheuristic is developed for the problem. It was tested on modified Solomon and Gehring & Homberger instances. Computational results confirm the effectiveness of the proposed metaheuristic.",

keywords = "Adaptive large neighbourhood search, Districting, Traveling salesman",

author = "Hongtao Lei and Gilbert Laporte and Yajie Liu and Tao Zhang",

year = "2015",

month = apr,

doi = "10.1016/j.cor.2014.11.008",

language = "English",

volume = "56",

pages = "84--92",

journal = "Computers and Operations Research",

issn = "0305-0548",

publisher = "Elsevier",

}

TY - JOUR

T1 - Dynamic design of sales territories

AU - Lei, Hongtao

AU - Laporte, Gilbert

AU - Liu, Yajie

AU - Zhang, Tao

PY - 2015/4

Y1 - 2015/4

N2 - We introduce the Multiple Traveling Salesmen and Districting Problem with Multi-periods and Multi-depots. In this problem, the compactness of the subdistricts, the dissimilarity measure of districts and an equity measure of salesmen profit are considered as part of the objective function, and the salesman travel cost on each subdistrict is approximated by the Beardwood-Halton-Hammersley formula. An adaptive large neighbourhood search metaheuristic is developed for the problem. It was tested on modified Solomon and Gehring & Homberger instances. Computational results confirm the effectiveness of the proposed metaheuristic.

AB - We introduce the Multiple Traveling Salesmen and Districting Problem with Multi-periods and Multi-depots. In this problem, the compactness of the subdistricts, the dissimilarity measure of districts and an equity measure of salesmen profit are considered as part of the objective function, and the salesman travel cost on each subdistrict is approximated by the Beardwood-Halton-Hammersley formula. An adaptive large neighbourhood search metaheuristic is developed for the problem. It was tested on modified Solomon and Gehring & Homberger instances. Computational results confirm the effectiveness of the proposed metaheuristic.

KW - Adaptive large neighbourhood search

KW - Districting

KW - Traveling salesman

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

U2 - 10.1016/j.cor.2014.11.008

DO - 10.1016/j.cor.2014.11.008

M3 - Article

AN - SCOPUS:85000167986

VL - 56

SP - 84

EP - 92

JO - Computers and Operations Research

JF - Computers and Operations Research

SN - 0305-0548

ER -