Solving the CVRP with Reduction to Knapsack Problem and Greedy Clustering Heuristic Method

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.

Farahbakhsh Amin; BEHNAMIAN JAVAD

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

Journal Paper

Paper Information

Journal: Industrial Management Perspective Year:2020 | Volume:9 | Issue:3 (36) Page(s): 89-106

Download Full-Text

Persian Verion

View:

859

Download:

Cites:

Information Journal Paper

Title

Solving the CVRP with Reduction to Knapsack Problem and Greedy Clustering Heuristic Method

Author(s)

Farahbakhsh Amin | BEHNAMIAN JAVAD | Issue Writer Certificate

Keywords

ReductionQ1

CVRPQ1

Greedy Heuristic AlgorithmQ1

Knapsack ProblemQ1

Clustering MethodQ1

Abstract

The vehicle routing problem is one of the most well-known optimization problems, which aims to design an optimum set of routes with the lowest cost for servicing the customers in a way that is consistent with the existing constraints. The wide practical application and scope of this problem has attracted much attention from researchers. But in return, the severity of solving has created difficulties and increased the need for heuristic and meta-heuristic solutions. This research represents a greedy heuristic method based on first categorizing then routing methods, to solve the capacitated vehicle routing problem (CVRP) using the capabilities of problem Reduction to the Knapsack Problem. The advantages of this method include the consideration of effective criteria such as distance between customers, distance between customers to depot and demand of points in decision making, decent speed and quality of solution and the ability to utilize the benefits of Reduction. Standard samples from CVRPLIB were used to evaluate the results and comparing them.

Cites

No record.

References

No record.

Cite

APA: Copy

Farahbakhsh, Amin, & BEHNAMIAN, JAVAD. (2020). Solving the CVRP with Reduction to Knapsack Problem and Greedy Clustering Heuristic Method. JOURNAL OF INDUSTRIAL MANAGEMENT PERSPECTIVE (JIMP), 9(3 (36) ), 89-106. SID. https://sid.ir/paper/384767/en

Vancouver: Copy

Farahbakhsh Amin, BEHNAMIAN JAVAD. Solving the CVRP with Reduction to Knapsack Problem and Greedy Clustering Heuristic Method. JOURNAL OF INDUSTRIAL MANAGEMENT PERSPECTIVE (JIMP)[Internet]. 2020;9(3 (36) ):89-106. Available from: https://sid.ir/paper/384767/en

IEEE: Copy

Amin Farahbakhsh, and JAVAD BEHNAMIAN, “Solving the CVRP with Reduction to Knapsack Problem and Greedy Clustering Heuristic Method,” JOURNAL OF INDUSTRIAL MANAGEMENT PERSPECTIVE (JIMP), vol. 9, no. 3 (36) , pp. 89–106, 2020, [Online]. Available: https://sid.ir/paper/384767/en

Related Journal Papers