MILP formulations and an Iterated Local Search Algorithm with Tabu Thresholding for the Order Batching Problem

Oncan, TEMEL

doi:10.1016/j.ejor.2014.11.025

MILP formulations and an Iterated Local Search Algorithm with Tabu Thresholding for the Order Batching Problem

Copy For Citation

Oncan T.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, vol.243, no.1, pp.142-155, 2015 (SCI-Expanded)

Publication Type: Article / Article
Volume: 243 Issue: 1
Publication Date: 2015
Doi Number: 10.1016/j.ejor.2014.11.025
Journal Name: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
Page Numbers: pp.142-155
Galatasaray University Affiliated: Yes

Abstract

In this work we deal with the Order Batching Problem (OBP) considering traversal, return and midpoint routing policies. For the first time, we introduce Mixed Integer Linear Programming (MILP) formulations for these three variants of the OBP. We also suggest an efficient Iterated Local Search Algorithm with Tabu Thresholding (ILST). According to our extensive computational experiments on standard and randomly generated instances we can say that the proposed ILST yields an outstanding performance in terms of both accuracy and efficiency. (C) 2014 Elsevier B.V. All rights reserved.