Please use this identifier to cite or link to this item:
Title: A branch and efficiency algorithm for the optimal design of supply chain networks
Authors: Petridis, Konstantinos
Dey, Prasanta Kumar
Emrouznejad, Ali
Type: Article
Subjects: FRASCATI::Natural sciences::Mathematics::Applied Mathematics
Issue Date: 2016
Source: Annals of Operations Research
Volume: 253
Issue: 1
First Page: 545
Last Page: 571
Abstract: Supply chain operations directly affect service levels. Decision on amendment of facilities is generally decided based on overall cost, leaving out the efficiency of each unit. Decomposing the supply chain superstructure, efficiency analysis of the facilities (warehouses or distribution centers) that serve customers can be easily implemented. With the proposed algorithm, the selection of a facility is based on service level maximization and not just cost minimization as this analysis filters all the feasible solutions utilizing Data Envelopment Analysis (DEA) technique. Through multiple iterations, solutions are filtered via DEA and only the efficient ones are selected leading to cost minimization. In this work, the problem of optimal supply chain networks design is addressed based on a DEA based algorithm. A Branch and Efficiency (B&E) algorithm is deployed for the solution of this problem. Based on this DEA approach, each solution (potentially installed warehouse, plant etc) is treated as a Decision Making Unit, thus is characterized by inputs and outputs. The algorithm through additional constraints named “efficiency cuts”, selects only efficient solutions providing better objective function values. The applicability of the proposed algorithm is demonstrated through illustrative examples.
ISSN: 0254-5330
Other Identifiers: 10.1007/s10479-016-2268-3
Appears in Collections:Department of Applied Informatics

Files in This Item:
File Description SizeFormat 
2016-01-28-ANOR-D-15-00091.R2.pdf334,88 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.