Open Access Paper
28 December 2022 An optimization algorithm for TSP-like problem in warehouse picking
Author Affiliations +
Proceedings Volume 12506, Third International Conference on Computer Science and Communication Technology (ICCSCT 2022); 125060K (2022) https://doi.org/10.1117/12.2661781
Event: International Conference on Computer Science and Communication Technology (ICCSCT 2022), 2022, Beijing, China
Abstract
In order to solve the problem of the order picking optimization in warehouse line, this study puts forward the concept of class TSP (Travelling Salesman Problem) based on a model using graph theory knowledge modelling. With the aid of the thought of classical TSP, it puts forward three principles, based on a fixed starting point (not repeatable) integer programming model; The solution of the model is also based on a simple optimization algorithm (vertex translocation method) of the classical TSP, and the appropriate modification is made. For the problem of unfixed starting point, the global traversal algorithm is added. Through the reconstruction of the line sequence, a TSP-like problem is successfully transformed into a TSP, and a model is finally established, which is a prominent innovation point of this paper. The calculation method of adjacency matrix W is given in the postscript.
© (2022) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Wan Quan, Suhui Ge, and Shulian Zhang "An optimization algorithm for TSP-like problem in warehouse picking", Proc. SPIE 12506, Third International Conference on Computer Science and Communication Technology (ICCSCT 2022), 125060K (28 December 2022); https://doi.org/10.1117/12.2661781
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Computer programming

Mathematical optimization

MATLAB

Technology

Algorithms

Engineering

Mathematical modeling

Back to Top