Providing a method for selecting the constrained shortest path problem using logical cuts

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.

MORADI SAJAD; Karamali Gholamreza

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

Journal Paper

Paper Information

Journal: DECISIONS AND OPERATIONS RESEARCH Year:2019 | Volume:4 | Issue:3 Page(s): 209-220

Download Full-Text

Persian Verion

View:

363

Download:

Cites:

Information Journal Paper

Title

Providing a method for selecting the constrained shortest path problem using logical cuts

Author(s)

MORADI SAJAD | Karamali Gholamreza | Issue Writer Certificate

Keywords

Network

Constrained routing

Relaxed model

Solution algorithm

Abstract

Shortest path problem is one of the practical issues in optimization, and there are many efficient algorithms in this area. In this issue, a Network of some nodes and arcs is considered in which, each arc has a specific parameter such as distance or cost. The main objective is to find the shortest or least costly route between two distinct points. By considering an additional parameter and adding a new limitation, as a capacity constraint, the problem will be closer to the real world condition. This extended issue is known as the constrained shortest path problem and has a higher complexity order and practical algorithms are needed to solve it. In this study, an effective algorithm is presented that obtains the optimal solution within a short time. In this method, a repetitive pattern is used so that, in each iteration, the Relaxed model, after adding a logical cut, is solved. The results of the implementation of the proposed algorithm on different Networks show its efficiency.

Cites

No record.

References

No record.

Cite

APA: Copy

MORADI, SAJAD, & Karamali, Gholamreza. (2019). Providing a method for selecting the constrained shortest path problem using logical cuts. DECISIONS AND OPERATIONS RESEARCH, 4(3 ), 209-220. SID. https://sid.ir/paper/268887/en

Vancouver: Copy

MORADI SAJAD, Karamali Gholamreza. Providing a method for selecting the constrained shortest path problem using logical cuts. DECISIONS AND OPERATIONS RESEARCH[Internet]. 2019;4(3 ):209-220. Available from: https://sid.ir/paper/268887/en

IEEE: Copy

SAJAD MORADI, and Gholamreza Karamali, “Providing a method for selecting the constrained shortest path problem using logical cuts,” DECISIONS AND OPERATIONS RESEARCH, vol. 4, no. 3 , pp. 209–220, 2019, [Online]. Available: https://sid.ir/paper/268887/en

Related Journal Papers