Lagrangian relaxation approach for multi-commodity distribution problem with fixed cost

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.

Mahmoodirad ali; Ansory Savary Hamed

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: DECISIONS AND OPERATIONS RESEARCH Year:2018 | Volume:3 | Issue:2 Page(s): 128-137

Download Full-Text

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

Persian Verion

View:

671

Download:

Cites:

Information Journal Paper

Title

Lagrangian relaxation approach for multi-commodity distribution problem with fixed cost

Author(s)

Mahmoodirad ali | Ansory Savary Hamed | Issue Writer Certificate

Keywords

multi-commodity planning problem

NP-hard problems

Lagrangean relaxation

Fixed-cost

Abstract

In this paper, a multi-commodity planning problem with Fixed-cost that is a special type of fixed charge transportation problem is developed. The proposed model determines the amount of products in the existing routes with the aim of minimizing the total cost to satisfy the demand of each customer. As the problem is NP-hard, a moderate sized instance of this problem becomes intractable for general-purpose solvers. In order to overcome this difficulty, a Lagrangian relaxation approach is proposed. The computational experiments show that the Lagrangian relaxation algorithm is able to solve large sized problems with optimality gap compared to general-purpose solvers.

Cites

No record.

References

No record.

Cite

APA: Copy

Mahmoodirad, ali, & Ansory Savary, Hamed. (2018). Lagrangian relaxation approach for multi-commodity distribution problem with fixed cost. DECISIONS AND OPERATIONS RESEARCH, 3(2 ), 128-137. SID. https://sid.ir/paper/268862/en

Vancouver: Copy

Mahmoodirad ali, Ansory Savary Hamed. Lagrangian relaxation approach for multi-commodity distribution problem with fixed cost. DECISIONS AND OPERATIONS RESEARCH[Internet]. 2018;3(2 ):128-137. Available from: https://sid.ir/paper/268862/en

IEEE: Copy

ali Mahmoodirad, and Hamed Ansory Savary, “Lagrangian relaxation approach for multi-commodity distribution problem with fixed cost,” DECISIONS AND OPERATIONS RESEARCH, vol. 3, no. 2 , pp. 128–137, 2018, [Online]. Available: https://sid.ir/paper/268862/en

Related Journal Papers