A vertex ranking algorithm for the fixed-charge transportation problem

1982 ◽  
Vol 37 (2) ◽  
pp. 221-230 ◽  
Author(s):  
S. Sadagopan ◽  
A. Ravindran
Keyword(s):  
Transportation Problem ◽  
Fixed Charge ◽  
Ranking Algorithm ◽  
Fixed Charge Transportation Problem ◽  
Vertex Ranking

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 Nelder and Mead Methodology for Solving Small Fixed-Charge Transportation Problems

2011 ◽  
pp. 345-356
Author(s):  
G. Kannan ◽  
P. Senthil ◽  
P. Sasikumar ◽  
V. P. Vinay
Keyword(s):  
Supply Chain ◽  
Transportation Problem ◽  
Optimization Problems ◽  
Fixed Charge ◽  
Computational Time ◽  
Variable Cost ◽  
Fixed Cost ◽  
Supply Chain Optimization ◽  
Business World ◽  
Fixed Charge Transportation Problem

The term ‘supply chain management’ has become common in the business world, which can be understood from the positive results of research in the area, particularly in supply chain optimization. Transportation is a frontier in achieving the objectives of the supply chain. Thrust is also given to optimization problems in transportation. The fixed-charge transportation problem is an extension of the transportation problem that includes a fixed cost, along with a variable cost that is proportional to the amount shipped. This article approaches the problem with another meta-heuristics known as the Nelder and Mead methodology to save the computational time with little iteration and obtain better results with the help of a program in C++.

The noncooperative fixed charge transportation problem

2020 ◽  
Vol 284 (1) ◽  
pp. 373-382
Author(s):  
Simone Sagratella ◽  
Marcel Schmidt ◽  
Nathan Sudermann-Merx
Keyword(s):  
Transportation Problem ◽  
Fixed Charge ◽  
Fixed Charge Transportation Problem
Sign in / Sign up

Export Citation Format

Share Document