An Enhanced Dynamic Slope Scaling Procedure with Tabu Scheme for Fixed Charge Network Flow Problems

Authors:
Dukwon Kim;Xinyan Pan;Panos M. Pardalos
Affiliations:
Industrial and Information Engineering, University of Tennessee, Knoxville, USA 37996;Industrial and Information Engineering, University of Tennessee, Knoxville, USA 37996;Center for Applied Optimization, Industrial and Systems Engineering, University of Florida, Gainesville, USA 32611
Venue:
Computational Economics
Year:
2006

Citing 7
Cited 0

A branch-and-bound method for the fixed charge transportation problem

Management Science
Optimization by ghost image processes in neural networks

Computers and Operations Research - Special issue: heuristic, genetic and tabu search
Tabu Search

Tabu Search
Bundle-based relaxation methods for multicommodity capacitated fixed charge network design

Discrete Applied Mathematics - Special issue on the combinatorial optimization symposium
A Tabu Search Heuristic Procedure for Solving the Transportation Problem with Exclusionary Side Constraints

Journal of Heuristics
A Simplex-Based Tabu Search Method for Capacitated Network Design

INFORMS Journal on Computing
A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

A heuristic algorithm for solving large scale fixed charge network flow problems (FCNFP) based on the dynamic slope scaling procedure (DSSP) and tabu search strategies is presented. The proposed heuristic integrates the DSSP with short-term memory intensification and long-term memory diversification mechanisms in the tabu scheme to improve the performance of the pure DSSP. With the feature of dynamically evolving memory, the enhanced DSSP evaluates the solutions in the search history and iteratively adjusts the linear factors in the linear approximation of the FCNFP to produce promising search neighborhoods for good quality solutions. The comprehensive numerical experiments on various test problems ranging from sparse to dense network structures are reported. The overall comparison of the pure DSSP, the enhanced DSSP, and branch and bound (B&B by cutting-edge MIP optimizer in CPLEX) is shown in terms of solution quality and CPU time. The results show that the enhanced DSSP approach has a higher solution quality than the pure DSSP for larger scale problems.