AN EFFICIENT EXTENSION OF 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; EDWARD P.K. TSANG

مرکز اطلاعات علمی 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:2009 | Volume:2 | Issue:PRE. NO. 2 Page(s): 1-9

Download Full-Text

View:

354

Download:

131

Cites:

Information Journal Paper

Title

AN EFFICIENT EXTENSION OF NETWORK SIMPLEX ALGORITHM

Author(s)

RASHIDI HASSAN | EDWARD P.K. TSANG | Issue Writer Certificate

Keywords

SCHEDULING

CONTAINER TERMINALS

MINIMUM COST FLOW PROBLEM

NETWORK SIMPLEX ALGORITHM

OPTIMIZATION METHODS

Abstract

In this paper, an efficient extension of NETWORK SIMPLEX ALGORITHM is presented. 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 NETWORK SIMPLEX ALGORITHM (NSA) and NSA+, which extended the standard NSA. The algorithms are 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. We compared results of NSA and NSA+ for the static automated vehicle SCHEDULING problem. The results show that NSA+ is significantly more efficient than NSA. It is found that, in practice, NSA and NSA+ take polynomial time to solve problems in this application.

Cites

No record.

References

Cite

APA: Copy

RASHIDI, HASSAN, & EDWARD P.K., TSANG. (2009). AN EFFICIENT EXTENSION OF NETWORK SIMPLEX ALGORITHM. JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), 2(PRE. NO. 2), 1-9. SID. https://sid.ir/paper/573946/en

Vancouver: Copy

RASHIDI HASSAN, EDWARD P.K. TSANG. AN EFFICIENT EXTENSION OF NETWORK SIMPLEX ALGORITHM. JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING)[Internet]. 2009;2(PRE. NO. 2):1-9. Available from: https://sid.ir/paper/573946/en

IEEE: Copy

HASSAN RASHIDI, and TSANG EDWARD P.K., “AN EFFICIENT EXTENSION OF NETWORK SIMPLEX ALGORITHM,” JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), vol. 2, no. PRE. NO. 2, pp. 1–9, 2009, [Online]. Available: https://sid.ir/paper/573946/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops