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

Authors:
Dukwon Kim;Panos M. Pardalos
Affiliations:
Center for Applied Optimization, Department of Industrial and Systems Engineering, 303 Weil Hall, University of Florida, Gainesville, FL 32611, USA;Center for Applied Optimization, Department of Industrial and Systems Engineering, 303 Weil Hall, University of Florida, Gainesville, FL 32611, USA
Venue:
Operations Research Letters
Year:
1999

Citing 5
Cited 20

Constrained global optimization: algorithms and applications

Constrained global optimization: algorithms and applications
Integer and combinatorial optimization

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

Management Science
Minimum concave-cost network flow problems: applications, complexity, and algorithms

Annals of Operations Research
Revised-modified penalties for fixed charge transportation problems

Management Science

Linear Approximations in a Dynamic Programming Approach for the Uncapacitated Single-Source Minimum Concave Cost Network Flow Problem in Acyclic Networks

Journal of Global Optimization
A Dynamic Domain Contraction Algorithm for Nonconvex Piecewise Linear Network Flow Problems

Journal of Global Optimization
A parallel hybrid heuristic for the multicommodity capacitated location problem with balancing requirements

Parallel Computing - Special issue: Parallel computing in logistics
A Slope Scaling/Lagrangean Perturbation Heuristic with Long-Term Memory for Multicommodity Capacitated Fixed-Charge Network Design

Journal of Heuristics
On network design problems: fixed cost flows and the covering steiner problem

ACM Transactions on Algorithms (TALG)
Parametric Ghost Image Processes for Fixed-Charge Problems: A Study of Transportation Networks

Journal of Heuristics
A Branch-and-Bound Algorithm for Concave Network Flow Problems

Journal of Global Optimization
Lower Bounds from State Space Relaxations for Concave Cost Network Flow Problems

Journal of Global Optimization
Dynamic Slope Scaling Procedure and Lagrangian Relaxation with Subproblem Approximation

Journal of Global Optimization
An Enhanced Dynamic Slope Scaling Procedure with Tabu Scheme for Fixed Charge Network Flow Problems

Computational Economics
Adaptive dynamic cost updating procedure for solving fixed charge network flow problems

Computational Optimization and Applications
Algorithms for simultaneous consideration of multiple physical synthesis transforms for timing closure

Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design
Large-Scale, Less-than-Truckload Service Network Design

Operations Research
Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem

INFORMS Journal on Computing
The Uncapacitated Time-Space Fixed-Charge Network Flow Problem: An Empirical Investigation of Procedures for Arc Capacity Assignment

INFORMS Journal on Computing
A heuristic method for the minimum toll booth problem

Journal of Global Optimization
Piecewise Linear Multicriteria Programs: The Continuous Case and Its Discontinuous Generalization

Operations Research
Nonlinear fixed charge transportation problem by minimum cost flow-based genetic algorithm

Computers and Industrial Engineering
Computational risk management techniques for fixed charge network flow problems with uncertain arc failures

Journal of Combinatorial Optimization
Solving the Single-Sink, Fixed-Charge, Multiple-Choice Transportation Problem by Dynamic Programming

Transportation Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider the Fixed Charge Network Flow Problem (FCNFP) which is known to be NP-hard. It has many practical applications including transportation, network design, communication, and production scheduling. Although many exact methods have been developed to solve the FCNFP, their computational requirements increase exponentially with the size of the problem. Hence, heuristic approaches are needed to solve suboptimally large-scale problems. Here, we propose a new approach for solving the general capacitated (or uncapacitated) FCNFP by adapting an economic viewpoint of the fixed cost. A new concept of the dynamic slope scaling procedure is presented and some computational results on a wide range of test problems are reported. The largest problem has 202 nodes and 10200 arcs. The results show that the proposed procedure generates solutions within 0% to 0.65% of optimality in all cases.