A new hybrid algorithm for the balanced transportation problem-Reference-Cited by-同舟云学术

A new hybrid algorithm for the balanced transportation problem

Published:2015-04 Issue: Volume:82 Page:115-126
ISSN:0360-8352
Container-title:Computers & Industrial Engineering
language:en
Short-container-title:Computers & Industrial Engineering

Author:

Sabbagh Mohammad S.,Ghafari Hosein,Mousavi Sayyed Rasoul

Publisher

Elsevier BV

Subject

General Engineering,General Computer Science

Reference25 articles.

1. Network flows: Theory, algorithms, and applications;Ahuja,1993

2. A simplex type algorithm for general transportation problems: An alternative to stepping-stone;Arsham;Journal of the Operational Research Society,1989

3. Bertsekas, D. P. (1979). A distributed algorithm for the assignment problem. Laboratory for information and decision systems. Working paper. M.I.T.

4. The auction algorithm: A distributed relaxation method for the assignment Problem;Bertsekas;Annals of Operations Research,1988

5. The auction algorithm for the transportation problem;Bertsekas;Annals of Operations Research,1989

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An available-flow neural network for solving the dynamic groundwater network maximum flow problem;Soft Computing;2023-03-03

2. Mathematical estimation for maximum flow of goods within a cross-dock to reduce inventory;Mathematical Biosciences and Engineering;2022

3. Application of discrete Grey Wolf Algorithm in balanced transport problem;2021 3rd International Academic Exchange Conference on Science and Technology Innovation (IAECST);2021-12-10

4. Solution of multi-objective transportation-p-facility location problem with effect of variable carbon emission by evolutionary algorithms;Soft Computing;2021-02-08

5. A heuristic for obtaining better initial feasible solution to the transportation problem;OPSEARCH;2019-12-04