Hybrid two-stage algorithm for solving transportation problem

8Citations
Citations of this article
29Readers
Mendeley users who have this article in their library.

Abstract

In this paper a hybrid two-stage algorithm is proposed to find the optimal solution for transportation problem (TP). The proposed algorithm consists of two stages: the first stage uses genetic algorithm (GA) to find an improved nonartificial feasible solution for the problem and the second stage utilizes this solution as a starting point in the RSM algorithm to find the optimal solution for the problem. The algorithm utilizes big M method to handle ≥ constraints and northwest corner method, minimum cost method, and Vogel's method are also used to generate the initial population for the GA. Performance of the algorithm is tested under different simulated scenarios and compared to both GA and revised simplex method (RSM). The results showed that the new hybrid algorithm performs competitively against GA and RSM. The proposed algorithm can be easily extended to cover different kinds of linear programming (LP) problems with minor changes such as inventory control, employment scheduling, personnel assignment and transshipment problems.

References Powered by Scopus

A concept of the optimal solution of the transportation problem with fuzzy cost coefficients

288Citations
N/AReaders
Get full text

A tabu search heuristic procedure for the fixed charge transportation problem

156Citations
N/AReaders
Get full text

A simple heuristic for solving small fixed-charge transportation problems

109Citations
N/AReaders
Get full text

Cited by Powered by Scopus

An efficient heuristic to obtain a better initial feasible solution to the transportation problem

56Citations
N/AReaders
Get full text

A heuristic solution technique to attain the minimal total cost bounds of transporting a homogeneous product with varying demands and supplies

29Citations
N/AReaders
Get full text

Total opportunity cost matrix – Minimal total: A new approach to determine initial basic feasible solution of a transportation problem

25Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Ramadan, S. Z., & Ramadan, I. Z. (2012). Hybrid two-stage algorithm for solving transportation problem. Modern Applied Science, 6(4), 12–22. https://doi.org/10.5539/mas.v6n4p12

Readers' Seniority

Tooltip

Researcher 4

44%

PhD / Post grad / Masters / Doc 3

33%

Lecturer / Post doc 2

22%

Readers' Discipline

Tooltip

Computer Science 4

33%

Mathematics 4

33%

Engineering 3

25%

Earth and Planetary Sciences 1

8%

Save time finding and organizing research with Mendeley

Sign up for free