Using Logic-Based Benders Decomposition to Solve the Capacity-and Distance-Constrained Plant Location Problem

Authors:
Mohammad M. Fazel-Zarandi;J. Christopher Beck
Affiliations:
Rotman School of Management, University of Toronto, Toronto, Ontario M5S 3E6, Canada;Department of Mechanical and Industrial Engineering, University of Toronto, Toronto, Ontario M5S 3G8, Canada
Venue:
INFORMS Journal on Computing
Year:
2012

Citing 21
Cited 1

A method for solving to optimality uncapacitated location problems

Annals of Operations Research
On the use of genetic algorithms to solve location problems

Computers and Operations Research - Location analysis
Logic-Based Methods for Optimization

PPCP '94 Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming
Constraint Programming Contribution to Benders Decomposition: A Case Study

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems

INFORMS Journal on Computing
Vehicle Routing and Scheduling with Full Truckloads

Transportation Science
Genetic algorithms for the single source capacitated location problem

Metaheuristics
A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem

Management Science
A branch-and-price algorithm for the capacitated p-median problem

Networks
A Hybrid Method for the Planning and Scheduling

Constraints
Solving the uncapacitated facility location problem using tabu search

Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
Bounds for the single source modular capacitated plant location problem

Computers and Operations Research
Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem

INFORMS Journal on Computing
The capacity and distance constrained plant location problem

Computers and Operations Research
Planning and Scheduling by Logic-Based Benders Decomposition

Operations Research
A Benders'Approach to a Transportation Network Design Problem

CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
A simulated annealing heuristic for the capacitated location routing problem

Computers and Industrial Engineering
Multi-stage benders decomposition for optimizing multicore architectures

CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Solving a location-allocation problem with logic-based Benders' decomposition

CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Checking-up on branch-and-check

CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Propagating the bin packing constraint using linear programming

CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming

Scheduling a dynamic aircraft repair shop with limited repair resources

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We address an optimization problem that requires deciding the location of a set of facilities, the allocation of customers to those facilities under capacity constraints, and the allocation of customers to trucks at those facilities under truck travel-distance constraints. We present a hybrid approach that combines integer and constraint programming using logic-based Benders decomposition. Computational experiments demonstrate that the Benders model is able to find and prove optimal solutions up to three orders-of-magnitude faster than an existing integer programming approach; it also finds better feasible solutions in less time when compared with an existing tabu search algorithm.