Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.14365/2139
Title: | A Pseudo-Polynomial Time Algorithm for a Special Multiobjective Order Picking Problem | Authors: | Özpeynirci, Özgür Kandemir, Cansu |
Keywords: | Multiple criteria decision making order picking problem traveling salesperson problem solvable case Traveling Salesman Problem Pyramidal Tours Aisle Warehouses Profits |
Publisher: | World Scientific Publ Co Pte Ltd | Abstract: | In this study, we work on the order picking problem (OPP) in a specially designed warehouse with a single picker. Ratliff and Rosenthal [Operations Research 31(3) (1983) 507-521] show that the special design of the warehouse and use of one picker lead to a polynomially solvable case. We address the multiobjective version of this special case and investigate the properties of the nondominated points. We develop an exact algorithm that finds any nondominated point and present an illustrative example. Finally we conduct a computational test and report the results. | URI: | https://doi.org/10.1142/S0219622015500169 https://hdl.handle.net/20.500.14365/2139 |
ISSN: | 0219-6220 1793-6845 |
Appears in Collections: | Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection |
Show full item record
CORE Recommender
SCOPUSTM
Citations
4
checked on Mar 26, 2025
WEB OF SCIENCETM
Citations
4
checked on Mar 26, 2025
Page view(s)
160
checked on Mar 31, 2025
Download(s)
6
checked on Mar 31, 2025
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.