SOLVING A STEP FIXED CHARGE TRANSPORTATION PROBLEM BY A SPANNING TREE-BASED MEMETIC ALGORITHM

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.

MOLLA ALIZADEH ZAVARDEHI S.; SANEI M.; SOLTANI R.; MAHMOODIRAD A.

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

Journal Paper

Paper Information

Journal: INTERNATIONAL JOURNAL OF MATHEMATICAL MODELLING & COMPUTATION Year:2014 | Volume:4 | Issue:2 Page(s): 177-187

Download Full-Text

View:

434

Download:

116

Cites:

Information Journal Paper

Title

SOLVING A STEP FIXED CHARGE TRANSPORTATION PROBLEM BY A SPANNING TREE-BASED MEMETIC ALGORITHM

Author(s)

MOLLA ALIZADEH ZAVARDEHI S. | SANEI M. | SOLTANI R. | MAHMOODIRAD A. | Issue Writer Certificate

Keywords

STEP FIXED CHARGE TRANSPORTATION PROBLEMS

GENETIC ALGORITHM

MEMETIC ALGORITHM

SPANNING TREE

Abstract

In this paper, we consider the step fixed-charge transportation problem (FCTP) in which a step fixed cost, sometimes called a setup cost, is incurred if another related variable assumes a nonzero value. In order to solve the problem, two metaheuristic, a SPANNING TREE-based GENETIC ALGORITHM (GA) and a SPANNING TREE-based MEMETIC ALGORITHM (MA), are developed for this NP-hard problem. For comparing GA and MA, twenty eight problems with different specifics have been generated at random and then the quality of the proposed algorithms was evaluated using the relative percentage deviation (RPD) method. Finally, based on RPD method, we investigate the impact of increasing the problem size on the performance of our proposed algorithms.

Cites

No record.

References

Cite

APA: Copy

MOLLA ALIZADEH ZAVARDEHI, S., SANEI, M., SOLTANI, R., & MAHMOODIRAD, A.. (2014). SOLVING A STEP FIXED CHARGE TRANSPORTATION PROBLEM BY A SPANNING TREE-BASED MEMETIC ALGORITHM. INTERNATIONAL JOURNAL OF MATHEMATICAL MODELLING & COMPUTATION, 4(2), 177-187. SID. https://sid.ir/paper/328330/en

Vancouver: Copy

MOLLA ALIZADEH ZAVARDEHI S., SANEI M., SOLTANI R., MAHMOODIRAD A.. SOLVING A STEP FIXED CHARGE TRANSPORTATION PROBLEM BY A SPANNING TREE-BASED MEMETIC ALGORITHM. INTERNATIONAL JOURNAL OF MATHEMATICAL MODELLING & COMPUTATION[Internet]. 2014;4(2):177-187. Available from: https://sid.ir/paper/328330/en

IEEE: Copy

S. MOLLA ALIZADEH ZAVARDEHI, M. SANEI, R. SOLTANI, and A. MAHMOODIRAD, “SOLVING A STEP FIXED CHARGE TRANSPORTATION PROBLEM BY A SPANNING TREE-BASED MEMETIC ALGORITHM,” INTERNATIONAL JOURNAL OF MATHEMATICAL MODELLING & COMPUTATION, vol. 4, no. 2, pp. 177–187, 2014, [Online]. Available: https://sid.ir/paper/328330/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops