An algorithm for solving fixed-charge problems using surrogate constraints
Computers and Operations Research
A branch-and-bound method for the fixed charge transportation problem
Management Science
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Revised-modified penalties for fixed charge transportation problems
Management Science
An analysis of the behavior of a class of genetic adaptive systems.
An analysis of the behavior of a class of genetic adaptive systems.
Graph Theory With Applications
Graph Theory With Applications
Cross-facility management of production and transportation planning problem
Computers and Operations Research
Fuzzy fixed charge solid transportation problem and algorithm
Applied Soft Computing
Algorithms for solving the single-sink fixed-charge transportation problem
Computers and Operations Research
A Heuristic Algorithm for Solving Fixed-Charge Transportation Problem
CSIE '09 Proceedings of the 2009 WRI World Congress on Computer Science and Information Engineering - Volume 02
On Capacitated Transportation Problem with Bounds on Rim Conditions
NISS '09 Proceedings of the 2009 International Conference on New Trends in Information and Service Science
Computers and Industrial Engineering
Expert Systems with Applications: An International Journal
A faster polynomial algorithm for the unbalanced Hitchcock transportation problem
Operations Research Letters
A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
Operations Research Letters
A maximum flow algorithm using MA ordering
Operations Research Letters
Computers and Industrial Engineering
| Hi-index | 0.00 |
Nonlinear Fixed Charge Transportation Problem (NFCTP) is a variant of fixed charge transportation problem, which is to ship available amounts of goods to satisfy the demands at minimal total cost, on condition that any route has a fixed cost irrelative to its shipping amount if it is used, and a variable cost directly proportional to the quadratic of its shipping amount as a nonlinear term. This paper aims at developing an efficient method to solve NFCTP. In this paper, NFCTP is formulated using a mixed integer programming model. Based on steady-state genetic algorithm as framework, and minimum cost flow algorithm as decoder, a hybrid genetic algorithm named NFCTP-HGA is proposed as a solution method of the model. Taking advantage of nonlinear structure and special network structure of NFCTP, the NFCTP-HGA algorithm has good performance in the sense of being implemented on computer, computational time, required memory for computation, and ability to search global optimum. The application of the NFCTP-HGA algorithm is illustrated with examples. Numerical experiments demonstrate that the NFCTP-HGA algorithm is an efficient and robust method to solve NFCTP, especially applicable to large scale problems.