Integer and combinatorial optimization
Integer and combinatorial optimization
Minimum concave-cost network flow problems: applications, complexity, and algorithms
Annals of Operations Research
A Comparison of Two Representations for the Fixed Charge Transportation Problem
PPSN VI Proceedings of the 6th International Conference on Parallel Problem Solving from Nature
New Genetic Local Search Operators for the Traveling Salesman Problem
PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
Characterizing Locality in Decoder-Based EAs for the Multidimensional Knapsack Problem
AE '99 Selected Papers from the 4th European Conference on Artificial Evolution
'Adaptive Link Adjustment' Applied to the Fixed Charge Transportation Problem
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
A closed-loop logistic model with a spanning-tree based genetic algorithm
Computers and Operations Research
The property analysis of evolutionary algorithms applied to spanning tree problems
Applied Intelligence
On a property analysis of representations for spanning tree problems
EA'05 Proceedings of the 7th international conference on Artificial Evolution
A genetic algorithm for solving the fixed-charge transportation model: Two-stage problem
Computers and Operations Research
| Hi-index | 0.00 |
The fixed charge transportation problem (FCTP) has been tackled by evolutionary algorithms (EAs) using representations like permutations, Pr眉fer numbers, or matrices. We present a new direct representation that restricts search to basic solutions and allows using problem-specific variation operators. This representation is compared w.r.t. locality and performance to permutations and Pr眉fer numbers. It clearly outperforms all other EAs and even reaches the solution quality of tabu search, the most successful heuristic for the FCTP we are aware of.