An exact solution approach for the order batching problem

İbrahim Muter and Temel Öncan

IISE Transactions, 2015, vol. 47, issue 7, 728-738

Abstract: In this article, we deal with the Order Batching Problem (OBP) considering traversal, return, and midpoint routing policies. We consider the Set Partitioning Problem formulation of the OBP and develop a specially tailored column generation–based algorithm for this problem. We suggest acceleration techniques such as a column pool strategy and a relaxation of the column generation subproblem. Also, a specially devised upper-bounding procedure and a lower-bounding method based on column generation that is strengthened by adding subset-row inequalities are employed. According to the computational results, the proposed solution approach manages to solve OBP instances with up to 100 orders to optimality.

Date: 2015
References: Add references at CitEc
Citations: View citations in EconPapers (10)

Downloads: (external link)
http://hdl.handle.net/10.1080/0740817X.2014.991478 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:uiiexx:v:47:y:2015:i:7:p:728-738

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/uiie20

DOI: 10.1080/0740817X.2014.991478

Access Statistics for this article

IISE Transactions is currently edited by Jianjun Shi

More articles in IISE Transactions from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().