Logic-based Benders decomposition for an inventory-location problem with service constraints. (September 2015)

• Record Type: Journal Article
• Authors: Wheatley, David; Gzara, Fatma; Jewkes, Elizabeth
• Is Part Of: Omega. Volume 55(2015:Sep.)
• Page Start: 10
• Page End: 23
• Publication Date: 2015-09
• Subjects: Integer programming -- Inventory control -- Location -- Mathematical programming -- Operational/OR -- Optimization; Management -- Periodicals; 658.4005
• DOI: 10.1016/j.omega.2015.02.001
• Languages: English
• ISSNs: 0305-0483

Abstract

Abstract: We study an integrated inventory-location problem with service requirements faced by an aerospace company in designing its service parts logistics network. Customer demand is Poisson distributed and the service levels are time-based leading to highly non-linear, stochastic service constraints and a nonlinear, mixed-integer optimization problem. Unlike previous work in the literature, which propose approximations for the nonlinear constraints, we present an exact solution methodology using logic-based Benders decomposition. We decompose the problem to separate the location decisions in the master problem from the inventory decisions in the subproblem. We propose a new family of valid cuts and prove that the algorithm is guaranteed to converge to optimality. This is the first attempt to solve this type of problem exactly. Then, we present a new restrict-and-decompose scheme to further decompose the Benders master problem by part. We test on industry instances as well as random instances. Using the exact algorithm and restrict-and-decompose scheme we are able to solve industry instances with up to 60 parts within reasonable time, while the maximum number of parts attempted in the literature is 5. Abstract : Highlights: We model an integrated inventory-location problem with time-based service levels. We present the first exact method used to solve this problem. Logic-based Benders decomposition is used to find a novel family of cuts. Large-scale industry instances are solved, with up to 60 parts.