COOPERATIVE VEHICLE ROUTING PROBLEM: AN OPPORTUNITY FOR COST SAVING

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.

ZIBAEI SEDIGHE; HAFEZALKOTOB ASHKAN; GHASHAMI SEYED SAJAD

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

Journal Paper

Paper Information

Journal: JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL Year:2016 | Volume:12 | Issue:3 Page(s): 0-0

Download Full-Text

View:

328

Download:

158

Cites:

Information Journal Paper

Title

COOPERATIVE VEHICLE ROUTING PROBLEM: AN OPPORTUNITY FOR COST SAVING

Author(s)

ZIBAEI SEDIGHE | HAFEZALKOTOB ASHKAN | GHASHAMI SEYED SAJAD | Issue Writer Certificate

Keywords

MULTI DEPOT VEHICLE ROUTING PROBLEM

COOPERATION

COALITION

COOPERATIVE GAME THEORY

COST SAVING ALLOCATION

Abstract

In this paper, a novel methodology is proposed to solve a cooperative multi-depot vehicle routing problem. We establish a mathematical model for multi-owner VRP in which each owner (i.e. player) manages single or multiple depots. The basic idea consists of offering an option that owners cooperatively manage the VRP to save their costs. We present COOPERATIVE GAME THEORY techniques for COST SAVING ALLOCATIONs which are obtained from various COALITIONs of owners. The methodology is illustrated with a numerical example in which different COALITIONs of the players are evaluated along with the results of COOPERATION and COST SAVING ALLOCATION methods.

Cites

No record.

References

No record.

Cite

APA: Copy

ZIBAEI, SEDIGHE, HAFEZALKOTOB, ASHKAN, & GHASHAMI, SEYED SAJAD. (2016). COOPERATIVE VEHICLE ROUTING PROBLEM: AN OPPORTUNITY FOR COST SAVING. JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL, 12(3), 0-0. SID. https://sid.ir/paper/310060/en

Vancouver: Copy

ZIBAEI SEDIGHE, HAFEZALKOTOB ASHKAN, GHASHAMI SEYED SAJAD. COOPERATIVE VEHICLE ROUTING PROBLEM: AN OPPORTUNITY FOR COST SAVING. JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL[Internet]. 2016;12(3):0-0. Available from: https://sid.ir/paper/310060/en

IEEE: Copy

SEDIGHE ZIBAEI, ASHKAN HAFEZALKOTOB, and SEYED SAJAD GHASHAMI, “COOPERATIVE VEHICLE ROUTING PROBLEM: AN OPPORTUNITY FOR COST SAVING,” JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL, vol. 12, no. 3, pp. 0–0, 2016, [Online]. Available: https://sid.ir/paper/310060/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops