SCHEDULING IN CONTAINER TERMINALS USING NETWORK SIMPLEX 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.

RASHIDI HASSAN

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:2008 | Volume:1 | Issue:PRE. NO. 1 Page(s): 9-16

Download Full-Text

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

Persian Verion

View:

637

Download:

133

Cites:

Information Journal Paper

Title

SCHEDULING IN CONTAINER TERMINALS USING NETWORK SIMPLEX ALGORITHM

Author(s)

RASHIDI HASSAN | Issue Writer Certificate

Keywords

SCHEDULINGQ4

CONTAINER TERMINALSQ4

MINIMUM COST FLOW PROBLEMQ4

NETWORK SIMPLEX ALGORITHMQ4

OPTIMIZATION METHODSQ4

Abstract

In static SCHEDULING problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. In this paper, the Static SCHEDULING problem of Automated Guided Vehicles in container terminal is solved by the NETWORK SIMPLEX ALGORITHM (NSA). The algorithm is based on graph model and their performances are at least 100 times faster than traditional simplex algorithm for Linear Programs. Many random data are generated and fed to the model for 50 vehicles. The results show that NSA is fast and efficient. It is found that, in practice, NSA takes polynomial time to solve problems in this application.

Cites

AN EFFICIENT EXTENSION OF NETWORK SIMPLEX ALGORITHM

References

No record.

Cite

APA: Copy

RASHIDI, HASSAN. (2008). SCHEDULING IN CONTAINER TERMINALS USING NETWORK SIMPLEX ALGORITHM. JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), 1(PRE. NO. 1), 9-16. SID. https://sid.ir/paper/205917/en

Vancouver: Copy

RASHIDI HASSAN. SCHEDULING IN CONTAINER TERMINALS USING NETWORK SIMPLEX ALGORITHM. JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING)[Internet]. 2008;1(PRE. NO. 1):9-16. Available from: https://sid.ir/paper/205917/en

IEEE: Copy

HASSAN RASHIDI, “SCHEDULING IN CONTAINER TERMINALS USING NETWORK SIMPLEX ALGORITHM,” JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), vol. 1, no. PRE. NO. 1, pp. 9–16, 2008, [Online]. Available: https://sid.ir/paper/205917/en

Related Journal Papers