OPTIMAL ROUTING IN AN AUTOMATED WAREHOUSE WITH 2-NESTED GTSP

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.

SEPEHRI M.M.; HOSSEINI MOTLAGH S.M.

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

Journal Paper

Paper Information

Journal: JOURNAL OF TRANSPORTATION RESEARCH Year:2008 | Volume:5 | Issue:2 Page(s): 127-138

Download Full-Text

Persian Verion

View:

1,936

Download:

Cites:

Information Journal Paper

Title

OPTIMAL ROUTING IN AN AUTOMATED WAREHOUSE WITH 2-NESTED GTSP

Author(s)

SEPEHRI M.M. | HOSSEINI MOTLAGH S.M. | Issue Writer Certificate

Keywords

OPTIMIZATIONQ3

ROUTINGQ2

2-NESTED GENERALIZED TRAVELING SALESMAN PROBLEMQ2

ANT COLONY OPTIMIZATIONQ3

AS/RSQ3

Abstract

In recent years storage systems have extremely developed. These developments are in both hardware perspective like as storage cells design and automated storage and retrieval machines and software perspective like as travel-time model and equipment usage strategy. Automated storage and retrieval systems development is one of these efforts in industrial modernization.In this paper the process of storage and retrieve material in automated storage and retrieval system has been modeled according to orders including some items into a new model that has been introduced in this paper. The term 2-NESTED GENERALIZED TRAVELING SALESMAN PROBLEM (2-nested GTSP) has been coined for the model. The authors showed that the problem of picking an order's items could be modeled with 2-nested GTSP easily. Then a mathematical model of the problem was developed and solved with LINGO. Since the problem is NP-Hard, it was solved with a metaheuristic algorithm ACSrank. The algorithm ACSrank is a new version of ACO that was developed and have ASrank and ACS features. The results of mathematical model and ACSrank algorithm are compared. Both of them have the same answer in 8 test problems. In problems 9, 10 and 11 we found less than 4 percent error. In the last test problem, after 263 hours, we stopped the solver.

Cites

References

No record.

Cite

APA: Copy

SEPEHRI, M.M., & HOSSEINI MOTLAGH, S.M.. (2008). OPTIMAL ROUTING IN AN AUTOMATED WAREHOUSE WITH 2-NESTED GTSP. JOURNAL OF TRANSPORTATION RESEARCH, 5(2), 127-138. SID. https://sid.ir/paper/83597/en

Vancouver: Copy

SEPEHRI M.M., HOSSEINI MOTLAGH S.M.. OPTIMAL ROUTING IN AN AUTOMATED WAREHOUSE WITH 2-NESTED GTSP. JOURNAL OF TRANSPORTATION RESEARCH[Internet]. 2008;5(2):127-138. Available from: https://sid.ir/paper/83597/en

IEEE: Copy

M.M. SEPEHRI, and S.M. HOSSEINI MOTLAGH, “OPTIMAL ROUTING IN AN AUTOMATED WAREHOUSE WITH 2-NESTED GTSP,” JOURNAL OF TRANSPORTATION RESEARCH, vol. 5, no. 2, pp. 127–138, 2008, [Online]. Available: https://sid.ir/paper/83597/en

Related Journal Papers