NON-DOMINATED SORTING GENETIC ALGORITHM FOR BI-OBJECTIVE TRANSPORTATION LOCATION ROUTING PROBLEM UNDER DEMAND UNCERTAINTY

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.

HONARVAR M.; KHALILI M.

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

Journal Paper

Paper Information

Journal: JOURNAL OF INDUSTRIAL ENGINEERING RESEARCH IN PRODUCTION SYSTEMS (IERPS) Year:2017 | Volume:4 | Issue:8 Page(s): 147-163

Download Full-Text

Persian Verion

View:

1,852

Download:

Cites:

Information Journal Paper

Title

NON-DOMINATED SORTING GENETIC ALGORITHM FOR BI-OBJECTIVE TRANSPORTATION LOCATION ROUTING PROBLEM UNDER DEMAND UNCERTAINTY

Author(s)

HONARVAR M. | KHALILI M. | Issue Writer Certificate

Keywords

MULTI-PRODUCT TRANSPORTATIONQ1

LOCATION ROUTING PROBLEMQ1

TWO-STAGE STOCHASTICQ1

PROGRAMMINGQ1

NON-DOMINATED SORTING GENETICQ1

ALGORITHMQ1

EPSILON-CONSTRAINT METHODQ1

Abstract

Effective management of distribution of manufactured goods plays an important role in the success and increasing of competition' levels in manufacturing organization. LOCATION ROUTING PROBLEM is a problem in which location of distribution center and vehicle routing are considered simultaneously. In this paper, a TWO-STAGE STOCHASTIC PROGRAMMING model and a meta-heuristic approach are presented for the Transportation LOCATION ROUTING PROBLEM. Customers can order different products.Capacitated central centers transport different products to open intermediary Distribution Centers (IDCs) and then these products are distributed from IDCs between the customers. A bi-objective optimization model is developed. Two objectives, minimization of the overall costs and maximization of the total served demand, are addressed. Due to the high complexity of the problem, we use the NON-DOMINATED SORTING GENETIC ALGORITHM to solve the problem. The initial parameters of this ALGORITHM is set with Taguchi method. Computational results show the effectiveness of the proposed solution method to solve problems in different dimensions.

Cites

No record.

References

No record.

Cite

APA: Copy

HONARVAR, M., & KHALILI, M.. (2017). NON-DOMINATED SORTING GENETIC ALGORITHM FOR BI-OBJECTIVE TRANSPORTATION LOCATION ROUTING PROBLEM UNDER DEMAND UNCERTAINTY. JOURNAL OF INDUSTRIAL ENGINEERING RESEARCH IN PRODUCTION SYSTEMS (IERPS), 4(8 ), 147-163. SID. https://sid.ir/paper/241314/en

Vancouver: Copy

HONARVAR M., KHALILI M.. NON-DOMINATED SORTING GENETIC ALGORITHM FOR BI-OBJECTIVE TRANSPORTATION LOCATION ROUTING PROBLEM UNDER DEMAND UNCERTAINTY. JOURNAL OF INDUSTRIAL ENGINEERING RESEARCH IN PRODUCTION SYSTEMS (IERPS)[Internet]. 2017;4(8 ):147-163. Available from: https://sid.ir/paper/241314/en

IEEE: Copy

M. HONARVAR, and M. KHALILI, “NON-DOMINATED SORTING GENETIC ALGORITHM FOR BI-OBJECTIVE TRANSPORTATION LOCATION ROUTING PROBLEM UNDER DEMAND UNCERTAINTY,” JOURNAL OF INDUSTRIAL ENGINEERING RESEARCH IN PRODUCTION SYSTEMS (IERPS), vol. 4, no. 8 , pp. 147–163, 2017, [Online]. Available: https://sid.ir/paper/241314/en

Related Journal Papers