A SET-COVERING FORMULATION FOR A DRAYAGE PROBLEM WITH SINGLEAND DOUBLE CONTAINER LOADS

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.

GHEZELSOFLU A.; DI FRANCESCO M.; FRANGIONI A.; ZUDDAS P.

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

Journal Paper

Paper Information

Journal: JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL Year:2018 | Volume:14 | Issue:4 Page(s): 665-676

Download Full-Text

View:

176

Download:

116

Cites:

Information Journal Paper

Title

A SET-COVERING FORMULATION FOR A DRAYAGE PROBLEM WITH SINGLEAND DOUBLE CONTAINER LOADS

Author(s)

GHEZELSOFLU A. | DI FRANCESCO M. | FRANGIONI A. | ZUDDAS P. | Issue Writer Certificate

Keywords

DRAYAGE

VEHICLE ROUTING PROBLEM

STREET-TURNS

SET COVERING

Abstract

This paper addresses a DRAYAGE problem, which is motivated by the case study of a real carrier. Its trucks carry one or twocontainers from a port to importers and from exporters to the port. Since up to four customers can be served in each route, we propose a set-covering formulation for this problem where all possible routes are enumerated. This model can beefficiently solved to optimality by a commercial solver, significantly outperforming a previously proposed node-arcformulation. Moreover, the model can be effectively used to evaluate a new distribution policy, which results in anenlarged set of feasible routes and can increase savings w. r. t. the policy currently employed by the carrier.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

GHEZELSOFLU, A., DI FRANCESCO, M., FRANGIONI, A., & ZUDDAS, P.. (2018). A SET-COVERING FORMULATION FOR A DRAYAGE PROBLEM WITH SINGLEAND DOUBLE CONTAINER LOADS. JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL, 14(4), 665-676. SID. https://sid.ir/paper/310166/en

Vancouver: Copy

GHEZELSOFLU A., DI FRANCESCO M., FRANGIONI A., ZUDDAS P.. A SET-COVERING FORMULATION FOR A DRAYAGE PROBLEM WITH SINGLEAND DOUBLE CONTAINER LOADS. JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL[Internet]. 2018;14(4):665-676. Available from: https://sid.ir/paper/310166/en

IEEE: Copy

A. GHEZELSOFLU, M. DI FRANCESCO, A. FRANGIONI, and P. ZUDDAS, “A SET-COVERING FORMULATION FOR A DRAYAGE PROBLEM WITH SINGLEAND DOUBLE CONTAINER LOADS,” JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL, vol. 14, no. 4, pp. 665–676, 2018, [Online]. Available: https://sid.ir/paper/310166/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops