The Lagrangian Relaxation Method for the Shortest Path Problem Considering Transportation Plans and Budgetary Constraint

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.

SAFARI S.; ZAFERANIEH M.; ABARESHI M.; Rahimi e.l.

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

Journal Paper

Paper Information

Journal: Journal of Operational Research in its Applications Year:2019 | Volume:16 | Issue:2 (61) Page(s): 39-57

Download Full-Text

Persian Verion

View:

944

Download:

Cites:

Information Journal Paper

Title

The Lagrangian Relaxation Method for the Shortest Path Problem Considering Transportation Plans and Budgetary Constraint

Author(s)

SAFARI S. | ZAFERANIEH M. | ABARESHI M. | Rahimi e.l. | Issue Writer Certificate

Keywords

Transportation NetworkQ1

Constrained Shortest Path ProblemQ1

Lagrangian Dual MethodQ1

Sub-gradient MethodQ1

Abstract

In this paper, a Constrained Shortest Path Problem (CSP) in a network is investigated, in which some special plans for each link with corresponding pre-determined costs as well as reduction values in the link travel time are considered. The purpose is to find a path and selecting the best plans on its links, to improve the travel time as most as possible, while the costs of conducting plans do not exceed the available budget. Using the Lagrangian relaxation approach, some constraints of the problem are relaxed and the Lagrangian dual problem is decomposed into two smaller sub-problems. Then, by applying the sub-gradient algorithm, a near optimal solution is determined for the original problem. Finally, by considering the proposed model on a small-sized network and on Khorasan state network, solutions for different origin-destination pairs with different parameters are determined.

Cites

No record.

References

No record.

Cite

APA: Copy

SAFARI, S., ZAFERANIEH, M., ABARESHI, M., & Rahimi, e.l.. (2019). The Lagrangian Relaxation Method for the Shortest Path Problem Considering Transportation Plans and Budgetary Constraint. JOURNAL OF OPERATIONAL RESEARCH AND ITS APPLICATIONS (JOURNAL OF APPLIED MATHEMATICS), 16(2 (61) ), 39-57. SID. https://sid.ir/paper/164611/en

Vancouver: Copy

SAFARI S., ZAFERANIEH M., ABARESHI M., Rahimi e.l.. The Lagrangian Relaxation Method for the Shortest Path Problem Considering Transportation Plans and Budgetary Constraint. JOURNAL OF OPERATIONAL RESEARCH AND ITS APPLICATIONS (JOURNAL OF APPLIED MATHEMATICS)[Internet]. 2019;16(2 (61) ):39-57. Available from: https://sid.ir/paper/164611/en

IEEE: Copy

S. SAFARI, M. ZAFERANIEH, M. ABARESHI, and e.l. Rahimi, “The Lagrangian Relaxation Method for the Shortest Path Problem Considering Transportation Plans and Budgetary Constraint,” JOURNAL OF OPERATIONAL RESEARCH AND ITS APPLICATIONS (JOURNAL OF APPLIED MATHEMATICS), vol. 16, no. 2 (61) , pp. 39–57, 2019, [Online]. Available: https://sid.ir/paper/164611/en

Related Journal Papers