The balancing traveling salesman problem: application to warehouse order picking

Atieh Madani; Rajan Batta; Mark Karwan

doi:10.1007/s11750-020-00557-y

The balancing traveling salesman problem: application to warehouse order picking

Atieh Madani
, Rajan Batta
, Mark Karwan

Department of Industrial and Systems Engineering

SUNY Buffalo

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

12 Scopus citations

Abstract

This paper discusses the problem of predicting the length of Traveling Salesman Problem (TSP) tour in dynamic and uncertain environments. Our findings, which are guided by extensive simulation runs, provide statistical estimations for the tour length under different scenarios. One of the applications that can benefit from these estimates includes warehouse order picking, which has seen increased importance due to online shopping. The utility of statistical estimates for TSP tour length for order picking is demonstrated on a common warehouse layout.

Original language	English
Pages (from-to)	442-469
Number of pages	28
Journal	TOP
Volume	29
Issue number	2
DOIs	https://doi.org/10.1007/s11750-020-00557-y
State	Published - Jul 2021

Keywords

Routing
Traveling salesman problem
Warehousing systems

Access to Document

10.1007/s11750-020-00557-y

Cite this

@article{92c80f72746d46389b8a855918e002f2,

title = "The balancing traveling salesman problem: application to warehouse order picking",

abstract = "This paper discusses the problem of predicting the length of Traveling Salesman Problem (TSP) tour in dynamic and uncertain environments. Our findings, which are guided by extensive simulation runs, provide statistical estimations for the tour length under different scenarios. One of the applications that can benefit from these estimates includes warehouse order picking, which has seen increased importance due to online shopping. The utility of statistical estimates for TSP tour length for order picking is demonstrated on a common warehouse layout.",

keywords = "Routing, Traveling salesman problem, Warehousing systems",

author = "Atieh Madani and Rajan Batta and Mark Karwan",

note = "Publisher Copyright: {\textcopyright} 2020, Sociedad de Estad{\'i}stica e Investigaci{\'o}n Operativa.",

year = "2021",

month = jul,

doi = "10.1007/s11750-020-00557-y",

language = "English",

volume = "29",

pages = "442--469",

journal = "TOP",

issn = "1134-5764",

publisher = "Springer Nature",

number = "2",

}

TY - JOUR

T1 - The balancing traveling salesman problem

T2 - application to warehouse order picking

AU - Madani, Atieh

AU - Batta, Rajan

AU - Karwan, Mark

PY - 2021/7

Y1 - 2021/7

N2 - This paper discusses the problem of predicting the length of Traveling Salesman Problem (TSP) tour in dynamic and uncertain environments. Our findings, which are guided by extensive simulation runs, provide statistical estimations for the tour length under different scenarios. One of the applications that can benefit from these estimates includes warehouse order picking, which has seen increased importance due to online shopping. The utility of statistical estimates for TSP tour length for order picking is demonstrated on a common warehouse layout.

AB - This paper discusses the problem of predicting the length of Traveling Salesman Problem (TSP) tour in dynamic and uncertain environments. Our findings, which are guided by extensive simulation runs, provide statistical estimations for the tour length under different scenarios. One of the applications that can benefit from these estimates includes warehouse order picking, which has seen increased importance due to online shopping. The utility of statistical estimates for TSP tour length for order picking is demonstrated on a common warehouse layout.

KW - Routing

KW - Traveling salesman problem

KW - Warehousing systems

UR - https://www.scopus.com/pages/publications/85085344068

U2 - 10.1007/s11750-020-00557-y

DO - 10.1007/s11750-020-00557-y

M3 - Article

AN - SCOPUS:85085344068

SN - 1134-5764

VL - 29

SP - 442

EP - 469

JO - TOP

JF - TOP

IS - 2

ER -

The balancing traveling salesman problem: application to warehouse order picking

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this