A Hybrid Iterated Local Search for Solving a Particular Two-Stage Fixed-Charge Transportation Problem

2018 ◽  
pp. 684-693 ◽  
Author(s):  
Ovidiu Cosma ◽  
Petrica Pop ◽  
Matei Oliviu ◽  
Ioana Zelina
Keyword(s):  
Local Search ◽  
Transportation Problem ◽  
Iterated Local Search ◽  
Fixed Charge ◽  
Two Stage ◽  
Fixed Charge Transportation Problem

An efficient iterated local search heuristic algorithm for the two-stage fixed-charge transportation problem

2019 ◽  
Vol 35 (2) ◽  
pp. 153-164 ◽  
Author(s):  
OVIDIU COSMA ◽  
PETRICA C. POP ◽  
CORINA POP SITAR ◽  
◽  
◽  
...  
Keyword(s):  
Local Search ◽  
Transportation Problem ◽  
Iterated Local Search ◽  
Two Stage ◽  
Solution Approach ◽  
Local Search Heuristic ◽  
Fixed Charges ◽  
Fixed Charge Transportation Problem ◽  
Benchmark Instances ◽  
Local Search Procedure

This paper concerns the two-stage transportation problem with fixed charges associated to the routes and proposes an efficient multi-start Iterated Local Search (ILS) procedure for the total distribution costs minimization. Our heuristic approach constructs an initial solution, uses a local search procedure to increase the exploration, a perturbation mechanism and a neighborhood operator in order to diversify the search. Computational experiments were performed on two sets of instances: one that consists of 20 benchmark instances available in the literature and a second one that contains 10 new randomly generated larger instances. The achieved computational results prove that our proposed solution approach is highly competitive in comparison with the existing approaches from the literature.

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.

A Parallel Algorithm for Solving a Two-Stage Fixed-Charge Transportation Problem

Informatica ◽  
2020 ◽  
pp. 1-26
Author(s):  
Ovidiu Cosma ◽  
Petrică C. Pop ◽  
Daniela Dănciulescu
Keyword(s):  
Parallel Algorithm ◽  
Transportation Problem ◽  
Fixed Charge ◽  
Two Stage ◽  
Fixed Charge Transportation Problem

Extending the solid step fixed-charge transportation problem to consider two-stage networks and multi-item shipments

2019 ◽  
Vol 137 ◽  
pp. 106008 ◽  
Author(s):  
Hosna Mollanoori ◽  
Reza Tavakkoli-Moghaddam ◽  
Chefi Triki ◽  
Mostafa Hajiaghaei-Keshteli ◽  
Fatemeh Sabouhi
Keyword(s):  
Transportation Problem ◽  
Fixed Charge ◽  
Two Stage ◽  
Fixed Charge Transportation Problem

Solving the two-stage fixed-charge transportation problem with a hybrid genetic algorithm

2017 ◽  
Vol 33 (3) ◽  
pp. 365-371
Author(s):  
PETRICA C. POP ◽  
◽  
COSMIN SABO ◽  
BENJAMIN BIESINGER ◽  
BIN HU ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Transportation Problem ◽  
Optimization Problem ◽  
Hybrid Genetic Algorithm ◽  
Fixed Charge ◽  
Distribution Centers ◽  
Two Stage ◽  
Fixed Charge Transportation Problem ◽  
Benchmark Instances ◽  
Local Search Procedure

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.

Sign in / Sign up

Export Citation Format

Share Document