Abstract
This paper presents an energy saving approach to the problem of order picking in warehousing environment, which is directly related to the well-known Traveling Salesman Problem (TSP). While the available heuristic algorithms for the order-picking problem search for the route that minimizes the travel time, here the problem is addressed from the energy saving point of view. In a few words, the least energy-consuming route is identified in order to quantify the trade off in time and energy between the fastest route and the most energy economic one. Keeping in mind that often energy is as important as time, especially during a low-demand period, the current paper sheds some light into a two dimensional way of addressing the warehouse material handling problem, which saves time as well as energy. A very interesting finding is that a relatively small loss of service time in many cases may lead to a significant decrease of consumed energy without any additional cost.
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.
