A NOVEL EXPERIMENTAL ANALYSIS OF THE MINIMUM COST FLOW PROBLEM

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

SADEGHIEH A.; DRAKE P.R.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: International Journal of Engineering Year:2009 | Volume:22 | Issue:(3 TRANSACTIONS A: BASIC) Page(s): 251-268

Download Full-Text

View:

318

Download:

168

Cites:

Information Journal Paper

Title

A NOVEL EXPERIMENTAL ANALYSIS OF THE MINIMUM COST FLOW PROBLEM

Author(s)

SADEGHIEH A. | DRAKE P.R. | Issue Writer Certificate

Keywords

LINEAR PROGRAMMING

INTELLIGENT OPTIMIZATION TECHNIQUES

MINIMUM COST FLOW PROBLEM

TRANSPORTATION PROBLEM

Abstract

In the GA approach the parameters that influence its performance include population size, crossover rate and mutation rate. Genetic algorithms are suitable for traversing large search spaces since they can do this relatively fast and because the mutation operator diverts the method away from local optima, which will tend to become more common as the search space increases in size. GA’s are based in concept on natural genetic and evolutionary mechanisms working on populations of solutions in contrast to other search techniques that work on a single solution. An important aspect of GA’s is that although they do not require any prior knowledge or any space limitations such as smoothness, convexity or unimodality of the function to be optimized, they exhibit very good performance in most applications. The MINIMUM COST FLOW PROBLEM is formulated as genetic algorithm and simulated annealing. This paper shows genetic algorithms and simulated annealing are much easier to implement for solving TRANSPORTATION PROBLEMs compared with constructing mathematical programming formulations. Finally, a new empirical study for the effect of parameters on the rate of convergence of the GA and SA are demonstrated.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

SADEGHIEH, A., & DRAKE, P.R.. (2009). A NOVEL EXPERIMENTAL ANALYSIS OF THE MINIMUM COST FLOW PROBLEM. INTERNATIONAL JOURNAL OF ENGINEERING, 22((3 TRANSACTIONS A: BASIC)), 251-268. SID. https://sid.ir/paper/568179/en

Vancouver: Copy

SADEGHIEH A., DRAKE P.R.. A NOVEL EXPERIMENTAL ANALYSIS OF THE MINIMUM COST FLOW PROBLEM. INTERNATIONAL JOURNAL OF ENGINEERING[Internet]. 2009;22((3 TRANSACTIONS A: BASIC)):251-268. Available from: https://sid.ir/paper/568179/en

IEEE: Copy

A. SADEGHIEH, and P.R. DRAKE, “A NOVEL EXPERIMENTAL ANALYSIS OF THE MINIMUM COST FLOW PROBLEM,” INTERNATIONAL JOURNAL OF ENGINEERING, vol. 22, no. (3 TRANSACTIONS A: BASIC), pp. 251–268, 2009, [Online]. Available: https://sid.ir/paper/568179/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops