CAPACITATED VEHICLE ROUTING PROBLEM WITH VEHICLES HIRE OR PURCHASE DECISION: MODELING AND SOLUTION APPROACHES

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.

HAJISHAFEE Z.; MIRMOHAMMADI S.H.; HEJAZI S.R.

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

Journal Paper

Paper Information

Journal: International Journal of Optimization in Civil Engineering Year:2015 | Volume:5 | Issue:1 Page(s): 1-20

Download Full-Text

View:

290

Download:

245

Cites:

Information Journal Paper

Title

CAPACITATED VEHICLE ROUTING PROBLEM WITH VEHICLES HIRE OR PURCHASE DECISION: MODELING AND SOLUTION APPROACHES

Author(s)

HAJISHAFEE Z. | MIRMOHAMMADI S.H. | HEJAZI S.R. | Issue Writer Certificate

Keywords

CAPACITATED VEHICLE ROUTING PROBLEM

HIRE

PURCHASE

PARALLEL SIMULATED ANNEALING

ELECTROMAGNETISM-LIKE ALGORITHM

SHUFFLED FROG LEAPING

Abstract

The overall cost of companies dealing with the distribution tasks is considerably affected by the way that distributing vehicles are procured. In this paper, a more practical version of CAPACITATED VEHICLE ROUTING PROBLEM (CVRP) in which the decision of PURCHASE or HIRE of vehicles is simultaneously considered is investigated. In CVRP model capacitated vehicles start from a single depot simultaneously and deliver the demanded items of several costumers with known demands where each costumer must be met once. Since the optimal vehicle procurement cost is a function of total distance it traverses during the planning horizon, the model is modified in a way that the decision of purchasing or hiring of each vehicle is made simultaneously. The problem is formulated as a mixed integer programming (MIP) model in which the sum of net present value (NPV) of procurement and traveling costs is minimized. To solve the problem, a hybrid electromagnetism and PARALLEL SIMULATED ANNEALING (PSA-EM) algorithm and a SHUFFLED FROG LEAPING Algorithm (SFLA) are presented. Finally, the presented methods are compared experimentally. Although in some cases the SFLA algorithm yields better solutions, experimental results show the competitiveness of PSA-EM algorithm from the computational time and performance points of view.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

HAJISHAFEE, Z., MIRMOHAMMADI, S.H., & HEJAZI, S.R.. (2015). CAPACITATED VEHICLE ROUTING PROBLEM WITH VEHICLES HIRE OR PURCHASE DECISION: MODELING AND SOLUTION APPROACHES. INTERNATIONAL JOURNAL OF OPTIMIZATION IN CIVIL ENGINEERING, 5(1), 1-20. SID. https://sid.ir/paper/329403/en

Vancouver: Copy

HAJISHAFEE Z., MIRMOHAMMADI S.H., HEJAZI S.R.. CAPACITATED VEHICLE ROUTING PROBLEM WITH VEHICLES HIRE OR PURCHASE DECISION: MODELING AND SOLUTION APPROACHES. INTERNATIONAL JOURNAL OF OPTIMIZATION IN CIVIL ENGINEERING[Internet]. 2015;5(1):1-20. Available from: https://sid.ir/paper/329403/en

IEEE: Copy

Z. HAJISHAFEE, S.H. MIRMOHAMMADI, and S.R. HEJAZI, “CAPACITATED VEHICLE ROUTING PROBLEM WITH VEHICLES HIRE OR PURCHASE DECISION: MODELING AND SOLUTION APPROACHES,” INTERNATIONAL JOURNAL OF OPTIMIZATION IN CIVIL ENGINEERING, vol. 5, no. 1, pp. 1–20, 2015, [Online]. Available: https://sid.ir/paper/329403/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops