Spanning tree-based genetic algorithm for bicriteria transportation problem
ICC&IE Selected papers from the 22nd ICC&IE conference on Computers & industrial engineering
Genetic Algorithms
Direct Representation and Variation Operators for the Fixed Charge Transportation Problem
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Cross-facility management of production and transportation planning problem
Computers and Operations Research
Fuzzy fixed charge solid transportation problem and algorithm
Applied Soft Computing
The Fuzzy Fixed Charge Transportation Problem and Genetic Algorithm
FSKD '08 Proceedings of the 2008 Fifth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 05
Improved Genetic Algorithm for Fixed Charge Transportation Problem
ISCID '08 Proceedings of the 2008 International Symposium on Computational Intelligence and Design - Volume 01
Integrated multistage logistics network design by using hybrid evolutionary algorithm
Computers and Industrial Engineering
Computers and Industrial Engineering
Expert Systems with Applications: An International Journal
Expert Systems with Applications: An International Journal
A genetic algorithm based heuristic to the multi-period fixed charge distribution problem
Applied Soft Computing
A genetic algorithm for solving the fixed-charge transportation model: Two-stage problem
Computers and Operations Research
Nonlinear fixed charge transportation problem by minimum cost flow-based genetic algorithm
Computers and Industrial Engineering
An improved firefly algorithm for solving dynamic multidimensional knapsack problems
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
In this paper, we propose a genetic algorithm using priority-based encoding (pb-GA) for linear and nonlinear fixed charge transportation problems (fcTP) in which new operators for more exploration are proposed. We modify a priority-based decoding procedure proposed by Gen et al. [1] to adapt with the fcTP structure. After comparing well-known representation methods for a transportation problem, we explain our proposed pb-GA. We compare the performance of the pb-GA with the recently used spanning tree-based genetic algorithm (st-GA) using numerous examples of linear and nonlinear fcTPs. Finally, computational results show that the proposed pb-GA gives better results than the st-GA both in terms of the solution quality and computation time, especially for medium- and large-sized problems. Numerical experiments show that the proposed pb-GA better absorbs the characteristics of the nonlinear fcTPs.