scholarly journals Spanning Tree-based Genetic Algorithm for Bicriteria Fixed Charge Transportation Problem

2000 ◽  
Vol 12 (2) ◽  
pp. 295-303 ◽  
Author(s):  
Mitsuo GEN ◽  
Yinzhen LI ◽  
Kenichi IDA
Keyword(s):  
Genetic Algorithm ◽  
Spanning Tree ◽  
Transportation Problem ◽  
Fixed Charge ◽  
Fixed Charge Transportation Problem

Addressing a nonlinear fixed-charge transportation problem using a spanning tree-based genetic algorithm

2010 ◽  
Vol 59 (2) ◽  
pp. 259-271 ◽  
Author(s):  
M. Hajiaghaei-Keshteli ◽  
S. Molla-Alizadeh-Zavardehi ◽  
R. Tavakkoli-Moghaddam
Keyword(s):  
Genetic Algorithm ◽  
Spanning Tree ◽  
Transportation Problem ◽  
Fixed Charge ◽  
Fixed Charge Transportation Problem

scholarly journals A hybrid based genetic algorithm for solving a capacitated fixed-charge transportation problem

2016 ◽  
Vol 32 (2) ◽  
pp. 225-232
Author(s):  
PETRICA POP ◽  
◽  
OLIVIU MATEI ◽  
CORINA POP SITAR ◽  
IOANA ZELINA ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Transportation Problem ◽  
Hash Table ◽  
Fixed Charge ◽  
Two Stage ◽  
Hybrid Heuristic ◽  
Fixed Charge Transportation Problem ◽  
Hybrid Heuristic Algorithm ◽  
Benchmark Instances ◽  
Local Search Procedure

This paper is focusing on an important transportation application encountered in supply chains, namely the capacitated two-stage fixed-charge transportation problem. For solving this complex optimization problem we described a novel hybrid heuristic approach obtained by combining a genetic algorithm based on a hash table coding of the individuals with a powerful local search procedure. The proposed algorithm was implemented and tested on an often used collection of benchmark instances and the computational results obtained showed that our proposed hybrid heuristic algorithm delivered competitive results compared to the state-of-the-art algorithms for solving the considered capacitated two-stage fixed-charge transportation problem.

Sign in / Sign up

Export Citation Format

Share Document