Addressing a fixed charge transportation problem with multi-route and different capacities by novel hybrid meta-heuristics

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.

FAKHRZAD MOHAMMAD BAGHER; Goodarzian Fariba; Golmohammadi A.M.

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

Journal Paper

Paper Information

Journal: JOURNAL OF INDUSTRIAL AND SYSTEMS ENGINEERING Year:2019 | Volume:12 | Issue:1 Page(s): 167-184

Download Full-Text

View:

219

Download:

100

Cites:

Information Journal Paper

Title

Addressing a fixed charge transportation problem with multi-route and different capacities by novel hybrid meta-heuristics

Author(s)

FAKHRZAD MOHAMMAD BAGHER | Goodarzian Fariba | Golmohammadi A.M. | Issue Writer Certificate

Keywords

Fixed-charge transportation problem

SA algorithm

GA algorithm

SFS algorithm

RDA algorithm

Taguchi method

Abstract

In most real world application and problems, a homogeneous product is carried from an origin to a destination by using different transportation modes (e. g., road, air, rail and water). This paper investigates a fixed charge transportation problem (FCTP), in which there are different routes with different capacities between suppliers and customers. To solve such a NP-hard problem, four meta-heuristic algorithms include Red Deer Algorithm (RDA), Stochastic Fractal Search (SFS), Genetic Algorithm (GA), and Simulated Annealing (SA) and two new hybrid meta-heuristics include hybrid RDA & GA (HRDGA) algorithm and Hybrid SFS & SA (HSFSA) algorithm are utilized. Regarding the literature, this is the first attempt to employ such optimizers to solve a FCTP. To tune up their parameters of algorithms, various problem sizes are generated at random and then a robust calibration is applied by using the Taguchi method. The final output shows that Simulated Annealing (SA) algorithm is the better than other algorithms for small-scale, medium-scale, and large-scale problems. As such, based on the Gap value of algorithms, the results of LINGO software shows that it reveals better outputs in comparison with meta-heuristic algorithms in small-scale and simulated annealing algorithm is better than other algorithms in large-scale and medium-scale problems. Finally, a set of computational results and conclusions are presented and analyzed.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

FAKHRZAD, MOHAMMAD BAGHER, Goodarzian, Fariba, & Golmohammadi, A.M.. (2019). Addressing a fixed charge transportation problem with multi-route and different capacities by novel hybrid meta-heuristics. JOURNAL OF INDUSTRIAL AND SYSTEMS ENGINEERING (JISE), 12(1), 167-184. SID. https://sid.ir/paper/307159/en

Vancouver: Copy

FAKHRZAD MOHAMMAD BAGHER, Goodarzian Fariba, Golmohammadi A.M.. Addressing a fixed charge transportation problem with multi-route and different capacities by novel hybrid meta-heuristics. JOURNAL OF INDUSTRIAL AND SYSTEMS ENGINEERING (JISE)[Internet]. 2019;12(1):167-184. Available from: https://sid.ir/paper/307159/en

IEEE: Copy

MOHAMMAD BAGHER FAKHRZAD, Fariba Goodarzian, and A.M. Golmohammadi, “Addressing a fixed charge transportation problem with multi-route and different capacities by novel hybrid meta-heuristics,” JOURNAL OF INDUSTRIAL AND SYSTEMS ENGINEERING (JISE), vol. 12, no. 1, pp. 167–184, 2019, [Online]. Available: https://sid.ir/paper/307159/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops