Approaches for the Order-Picking Problem in Parallel-Aisle Warehouses

*********************************
There is now a CONTENT FREEZE for Mercury while we switch to a new platform. It began on Friday, March 10 at 6pm and will end on Wednesday, March 15 at noon. No new content can be created during this time, but all material in the system as of the beginning of the freeze will be migrated to the new platform, including users and groups. Functionally the new site is identical to the old one. webteam@gatech.edu
*********************************

Event Details
  • Date/Time:
    • Friday November 6, 2009 - Saturday November 7, 2009
      11:00 am - 11:59 am
  • Location: Executive classroom
  • Phone:
  • URL:
  • Email:
  • Fee(s):
    $0.00
  • Extras:
Contact
Anita Race
H. Milton Stewart School of Industrial and Systems Engineering
Contact Anita Race
Summaries

Summary Sentence: Approaches for the Order-Picking Problem in Parallel-Aisle Warehouses

Full Summary: Approaches for the Order-Picking Problem in Parallel-Aisle Warehouses

TITLE: Approaches for the Order-Picking Problem in Parallel-Aisle Warehouses

SPEAKER: Melih Celik

ABSTRACT:

Order-picking operations constitute the costliest activities in a warehouse. The order-picking problem (OPP) aims to determine the route of the picker(s) in such a way that the total order-picking time, hence the order-picking costs are minimized. In this study, a warehouse that consists of parallel pick aisles is assumed, and various versions of the OPP are considered.

The single-picker version of the OPP can be solved to optimality in polynomial time for warehouses without middle aisles. However, no polynomial time algorithm exists for the cases where middle aisles exist. In this study, we briefly discuss the complexity of the problem when middle aisles exist and propose a heuristic procedure, which makes use of the exact algorithm for the OPP with no middle aisles. Computational results on randomly generated problems are given.

Although the single-picker version of the problem has been well studied in the literature, the multiple-picker version has not received much attention in terms of algorithmic approaches. For this case, we propose an evolutionary algorithm that makes use of the well-known cluster-first, route-second and route-first, cluster-second heuristics for the Vehicle Routing Problem. The parameters of the algorithm are determined based on preliminary runs and the algorithm is also tested on randomly generated problems, with different weights given to the cluster-first, route-second and route-first, cluster-second approaches.

This study is part of a master’s thesis work in Middle East Technical University (Turkey) under the advisory of Dr. Haldun Sural.

Additional Information

In Campus Calendar
No
Groups

School of Industrial and Systems Engineering (ISYE)

Invited Audience
No audiences were selected.
Categories
Seminar/Lecture/Colloquium
Keywords
warehouse
Status
  • Created By: Anita Race
  • Workflow Status: Draft
  • Created On: Feb 16, 2010 - 9:48am
  • Last Updated: Oct 7, 2016 - 9:50pm