An Efficient Hybrid Genetic Algorithm for Solving a Particular Two-Stage Fixed-Charge Transportation Problem

Author(s):  
Ovidiu Cosma ◽  
Petrica C. Pop ◽  
Cosmin Sabo
2017 ◽  
Vol 33 (3) ◽  
pp. 365-371
Author(s):  
PETRICA C. POP ◽  
◽  
COSMIN SABO ◽  
BENJAMIN BIESINGER ◽  
BIN HU ◽  
...  

This article considers the two-stage fixed-charge transportation problem which models an important transportation application in a supply chain, from manufacturers to customers through distribution centers. For solving this optimization problem we describe a hybrid algorithm that combines a steady-state genetic algorithm with a local search procedure. The computational results for an often used collection of benchmark instances show that our proposed hybrid method delivers results that are competitive to those of other state-of-the-art algorithms for solving the two-stage fixed-charge transportation problem.


2016 ◽  
Vol 32 (2) ◽  
pp. 225-232
Author(s):  
PETRICA POP ◽  
◽  
OLIVIU MATEI ◽  
CORINA POP SITAR ◽  
IOANA ZELINA ◽  
...  

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.


Informatica ◽  
2020 ◽  
pp. 1-26
Author(s):  
Ovidiu Cosma ◽  
Petrică C. Pop ◽  
Daniela Dănciulescu

Sign in / Sign up

Export Citation Format

Share Document