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.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.