A multiplier adjustment method for the generalized assignment problem
Management Science
Future paths for integer programming and links to artificial intelligence
Computers and Operations Research - Special issue: Applications of integer programming
A tabu search procedure for multicommodity location/allocation with balancing requirements
Annals of Operations Research - Special issue on Tabu search
Computers and Operations Research
Computers and Operations Research
Tabu Search
A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem
Mathematics of Operations Research
Near-optimal solutions to large-scale facility location problems
Discrete Optimization
Computers and Industrial Engineering
Hi-index | 0.00 |
This paper proposes efficient heuristics to solve large-scale production---distribution network design models. The problem studied is an extension of the two-echelon multicommodity CFLPSS (capacitated facility location problem with single sourcing) considering direct shipments from manufacturing facilities, alternative facility configurations, and concave inventory holding costs. After reviewing the relevant literature, a detailed description of the production---distribution network design problem studied is provided, and the problem is formulated as a mixed-integer program. The heuristic solution approach proposed is then presented. It is a variable neighborhood search (VNS) method integrating a tabu procedure. Experiments are designed to calibrate the heuristics developed, and to compare their performance with the CPLEX solver, for problems with different realistic characteristics. Computational results are presented and discussed.