An exact solution approach for the order batching problem

Ibrahim Muter, Temel Oncan

Research output: Contribution to journalArticle

9 Citations (Scopus)

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.
Original languageEnglish
Pages (from-to)728-738
JournalIIE Transactions
Volume47
Issue number7
Early online date13 Jan 2015
DOIs
Publication statusPublished - 2015

Cite this

An exact solution approach for the order batching problem. / Muter, Ibrahim; Oncan, Temel .

In: IIE Transactions, Vol. 47, No. 7, 2015, p. 728-738.

Research output: Contribution to journalArticle

Muter, Ibrahim ; Oncan, Temel . / An exact solution approach for the order batching problem. In: IIE Transactions. 2015 ; Vol. 47, No. 7. pp. 728-738.
@article{48cef6e129764dc6aebca914fc6f838e,
title = "An exact solution approach for the order batching problem",
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.",
author = "Ibrahim Muter and Temel Oncan",
year = "2015",
doi = "10.1080/0740817X.2014.991478",
language = "English",
volume = "47",
pages = "728--738",
journal = "IIE Transactions",
issn = "0740-817X",
publisher = "Taylor and Francis",
number = "7",

}

TY - JOUR

T1 - An exact solution approach for the order batching problem

AU - Muter, Ibrahim

AU - Oncan, Temel

PY - 2015

Y1 - 2015

N2 - 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.

AB - 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.

UR - http://dx.doi.org/10.1080/0740817X.2014.991478

U2 - 10.1080/0740817X.2014.991478

DO - 10.1080/0740817X.2014.991478

M3 - Article

VL - 47

SP - 728

EP - 738

JO - IIE Transactions

JF - IIE Transactions

SN - 0740-817X

IS - 7

ER -