Abstract
Research of travel distance on single - depot position in warehouse is tremendous. This study focuses more on the effect of two-depot position on travel distance in order picking problem (OPP) by using the concept of traveling salesman problem (TSP) and exact method – Branch and Bound (B\&B) algorithm. The total distance of one-depot position is shorter than two-depot position for single and double block warehouses and the difference is less than 5%. The total distance is also compared with approximate methods – SA and TS which show that the differences are less than 5%. The sequence of location visit for one depot and two depot is similar about two third from the total location visits. For order picking problem that has more than 25 location visits, one need to consider to apply approximate approach to get the solution faster even the difference will be higher from exact approach when the number of location visit or aisle increases.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
