Solving the Fixed Charge Transportation Problem by New Heuristic Approach

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.

Yousefi Komeil; J. Afshari Ahmad; Hajiaghaei Keshteli Mostafa

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

Journal Paper

Paper Information

Journal: JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING) Year:2019 | Volume:12 | Issue:1 (25) Page(s): 41-52

Download Full-Text

View:

191

Download:

142

Cites:

Information Journal Paper

Title

Solving the Fixed Charge Transportation Problem by New Heuristic Approach

Author(s)

Yousefi Komeil | J. Afshari Ahmad | Hajiaghaei Keshteli Mostafa | Issue Writer Certificate

Keywords

Fixed charge transportation problem

Heuristic

Metaheuristic algorithms

Priority-based

Abstract

The Fixed charge transportation problem (FCTP) is a deployment of the classical transportation problem in which a fixed cost is incurred, independent of the amount transported, along with a variable cost that is proportional to the amount shipped. Since the problem is considered as an NP-hard, the computational time grows exponentially as the size of the problem increases. In this paper, we propose a new Heuristic along with well-known metaHeuristic like Genetic algorithm (GA), simulated annealing (SA) and recently developed one, Keshtel algorithm (KA) to solve the FCTP. Contrary to previous works, we develop a simple and strong Heuristic according to the nature of the problem and compare the result with metaHeuristics. In addition, since the researchers recently used the Priority-based representation to encode the transportation graphs and achieved very good results, we consider this representation in metaHeuristics and compare the results with the proposed Heuristic. Furthermore, we apply the Taguchi experimental design method to set the proper values of algorithms in order to improve their performances. Finally, computational results of Heuristic and metaHeuristics with different encoding approaches, both in terms of the solution quality and computation time, are studied in different problem sizes.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

Yousefi, Komeil, J. Afshari, Ahmad, & Hajiaghaei Keshteli, Mostafa. (2019). Solving the Fixed Charge Transportation Problem by New Heuristic Approach. JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), 12(1 (25)), 41-52. SID. https://sid.ir/paper/721415/en

Vancouver: Copy

Yousefi Komeil, J. Afshari Ahmad, Hajiaghaei Keshteli Mostafa. Solving the Fixed Charge Transportation Problem by New Heuristic Approach. JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING)[Internet]. 2019;12(1 (25)):41-52. Available from: https://sid.ir/paper/721415/en

IEEE: Copy

Komeil Yousefi, Ahmad J. Afshari, and Mostafa Hajiaghaei Keshteli, “Solving the Fixed Charge Transportation Problem by New Heuristic Approach,” JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), vol. 12, no. 1 (25), pp. 41–52, 2019, [Online]. Available: https://sid.ir/paper/721415/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops