Abstract
In this paper, an order picking problem with the capacitated forklift in a warehouse is studied by considering the total distance and the penalized earliness/tardiness. These objectives are important to reduce transportation costs and to satisfy customer expectations. Since this problem has been known as NP-hard, a genetic algorithm (GA) is proposed to solve the bi-objective order picking problem. The proposed approach is applied to auto components industry that produces wire harnesses responsible for all electrical functions in the vehicle. Experimental design is used for tuning the influential parameters of the proposed GA. The GA approach was solved by weighted sum scalarization.
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.
