A TECHNIQUE FOR SOLVING DISTRIBUTOR’S PALLET LOADING PROBLEM (DPLP), USING DYNAMIC PROGRAMMING

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.

HATEFI M.A.

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

Journal Paper

Paper Information

Journal: AMIRKABIR Year:2013 | Volume:44 | Issue:2 Page(s): 121-129

Download Full-Text

View:

276

Download:

Cites:

Information Journal Paper

Title

A TECHNIQUE FOR SOLVING DISTRIBUTOR’S PALLET LOADING PROBLEM (DPLP), USING DYNAMIC PROGRAMMING

Author(s)

HATEFI M.A. | Issue Writer Certificate

Keywords

CUTTING & PACKING (C&P) PROBLEMS

DISTRIBUTOR’S PALLET LOADING PROBLEM (DPLP)

DYNAMIC PROGRAMMING

Abstract

The Distributor’s Pallet Loading Problem consists of packing a fixed rectangular space (so-called pallet) with a subset of smaller rectangular shapes (so-called pieces) of different dimensions, which have different utility values, in such a way as to maximize the sum of the utility values of the packed pieces. Moreover, as the further objective function; it requires to as possible pack identical pieces as side by side, by means of applicability of the packing patterns. The present paper introduces a technique to solve the problem, in the way that includes a new idea to apply the DYNAMIC PROGRAMMING and, as a matter of the second objective function. In each round of the proposed packing procedure loop, a part of pallet space is packed. The experimental results show that the proposed technique is better than the present methods in the state-of-the art, one the one hand, if solving time were better than packing value, on the other hand, as for packing identical pieces as side by side.

Cites

No record.

References

No record.

Cite

APA: Copy

HATEFI, M.A.. (2013). A TECHNIQUE FOR SOLVING DISTRIBUTOR’S PALLET LOADING PROBLEM (DPLP), USING DYNAMIC PROGRAMMING. AMIRKABIR, 44(2), 121-129. SID. https://sid.ir/paper/621839/en

Vancouver: Copy

HATEFI M.A.. A TECHNIQUE FOR SOLVING DISTRIBUTOR’S PALLET LOADING PROBLEM (DPLP), USING DYNAMIC PROGRAMMING. AMIRKABIR[Internet]. 2013;44(2):121-129. Available from: https://sid.ir/paper/621839/en

IEEE: Copy

M.A. HATEFI, “A TECHNIQUE FOR SOLVING DISTRIBUTOR’S PALLET LOADING PROBLEM (DPLP), USING DYNAMIC PROGRAMMING,” AMIRKABIR, vol. 44, no. 2, pp. 121–129, 2013, [Online]. Available: https://sid.ir/paper/621839/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops