A survey on the Traveling Salesman Problem and its variants in a warehousing context
Authors:
- Stefan BockSBStefan Bock
- Stefan BomsdorfSBStefan Bomsdorf
- Nils BoysenNBNils Boysen
- Michael SchneiderMSMichael Schneider
Top Cited Papers
Open Access
- 21 April 2024
- journal article
- review article
- Published by Elsevier in European Journal of Operational Research
- Vol. 322 (1) , 1-14
Abstract
No abstract availableKeywords
Funding Information
- Deutsche Forschungsgemeinschaft
This publication has 98 references indexed in Scilit:
- Cost-neutral reduction of infection risk in picker-to-parts warehousing systemsOR Spectrum, 2022
- The family traveling salesman problem with incompatibility constraintsNetworks, 2021
- A parallel variable neighborhood search for solving covering salesman problemOptimization Letters, 2020
- Solving the equality generalized traveling salesman problem using the Lin–Kernighan–Helsgaun AlgorithmMathematical Programming Computation, 2015
- Solving the Asymmetric Travelling Salesman Problem with time windows by branch-and-cutMathematical Programming, 2001
- The precedence-constrained asymmetric traveling salesman polytopeMathematical Programming, 1995
- Special cases of traveling salesman and repairman problems with time windowsNetworks, 1992
- The prize collecting traveling salesman problemNetworks, 1989
- The orienteering problemNaval Research Logistics (NRL), 1987
- Local search in routing problems with time windowsAnnals of Operations Research, 1985