Two-edge disjoint survivable network design problem with relays: a hybrid genetic algorithm and Lagrangian heuristic approach

2013 ◽  
Vol 46 (1) ◽  
pp. 130-145 ◽  
Author(s):  
Abdullah Konak
Keyword(s):  
Genetic Algorithm ◽  
Network Design ◽  
Design Problem ◽  
Hybrid Genetic Algorithm ◽  
Heuristic Approach ◽  
Network Design Problem ◽  
Survivable Network Design ◽  
Edge Disjoint ◽  
Survivable Network ◽  
Lagrangian Heuristic

Solving a Two-stage Supply Chain Network Design Problem with Fixed Costs by a Hybrid Genetic Algorithm

2021 ◽  
Author(s):  
Ovidiu Cosma ◽  
Petrică C Pop ◽  
Cosmin Sabo
Keyword(s):  
Genetic Algorithm ◽  
Supply Chain ◽  
Network Design ◽  
Design Problem ◽  
Optimization Problem ◽  
Hybrid Genetic Algorithm ◽  
Network Design Problem ◽  
Supply Chain Network Design ◽  
Supply Chain Network ◽  
Fixed Costs

Abstract In this paper we investigate a particular two-stage supply chain network design problem with fixed costs. In order to solve this complex optimization problem, we propose an efficient hybrid algorithm, which was obtained by incorporating a linear programming optimization problem within the framework of a genetic algorithm. In addition, we integrated within our proposed algorithm a powerful local search procedure able to perform a fine tuning of the global search. We evaluate our proposed solution approach on a set of large size instances. The achieved computational results prove the efficiency of our hybrid genetic algorithm in providing high-quality solutions within reasonable running-times and its superiority against other existing methods from the literature.

Sign in / Sign up

Export Citation Format

Share Document