OPEN SELECTIVE VEHICLE ROUTING PROBLEM WITH PRICING, SOLVED BY IMPROVED IMPERIALIST COMPETITIVE ALGORITHM

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.

HOSSEINZADEH ABOLFAZL; ALINAGHIAN MEHDI; SABBAGH MOHAMMAD SAIID

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

Journal Paper

Paper Information

Journal: PRODUCTION AND OPERATIONS MANAGEMENT Year:2018 | Volume:8 | Issue:2 (15) Page(s): 29-45

Download Full-Text

Persian Verion

View:

1,184

Download:

Cites:

Information Journal Paper

Title

OPEN SELECTIVE VEHICLE ROUTING PROBLEM WITH PRICING, SOLVED BY IMPROVED IMPERIALIST COMPETITIVE ALGORITHM

Author(s)

HOSSEINZADEH ABOLFAZL | ALINAGHIAN MEHDI | SABBAGH MOHAMMAD SAIID | Issue Writer Certificate

Keywords

PRICINGQ1

OPEN VEHICLE ROUTING PROBLEMQ2

SIMULATED ANNEALING ALGORITHM. IMPROVED IMPERIALIST COMPETITIVE ALGORITHMQ1

SELECTIVE VEHICLE ROUTING PROBLEMQ1

Abstract

In this paper, modeling and solving an open SELECTIVE VEHICLE ROUTING PROBLEM with PRICING are introduced. We will discuss optimal PRICING when using a homogeneous fleet of vehicles. Furthermore, in some real world applications, companies prefer to distribute their products using rented vehicles so returning to the depot is not required. Therefore we face an open routing problem. Despite the applicability of such problem, we did not find any published research that examines it. also an Improved Imperialist Competitive Algorithm (IICA) is proposed to solve proposed model. For validating this method, some small scale problems are solved and results are compared to the results of an exact method and Simulated Annealing (SA) algorithm. The comparison of results shows that the proposed method is suitable for solving the model. For investigating its efficiency in dealing with real world problems, some large scale problems are solved and the results are compared to the results of Simulated Annealing (SA) algorithm. Results show that IICA is more efficient than SA.

Cites

No record.

References

No record.

Cite

APA: Copy

HOSSEINZADEH, ABOLFAZL, ALINAGHIAN, MEHDI, & SABBAGH, MOHAMMAD SAIID. (2018). OPEN SELECTIVE VEHICLE ROUTING PROBLEM WITH PRICING, SOLVED BY IMPROVED IMPERIALIST COMPETITIVE ALGORITHM. PRODUCTION AND OPERATIONS MANAGEMENT, 8(2 (15) ), 29-45. SID. https://sid.ir/paper/217481/en

Vancouver: Copy

HOSSEINZADEH ABOLFAZL, ALINAGHIAN MEHDI, SABBAGH MOHAMMAD SAIID. OPEN SELECTIVE VEHICLE ROUTING PROBLEM WITH PRICING, SOLVED BY IMPROVED IMPERIALIST COMPETITIVE ALGORITHM. PRODUCTION AND OPERATIONS MANAGEMENT[Internet]. 2018;8(2 (15) ):29-45. Available from: https://sid.ir/paper/217481/en

IEEE: Copy

ABOLFAZL HOSSEINZADEH, MEHDI ALINAGHIAN, and MOHAMMAD SAIID SABBAGH, “OPEN SELECTIVE VEHICLE ROUTING PROBLEM WITH PRICING, SOLVED BY IMPROVED IMPERIALIST COMPETITIVE ALGORITHM,” PRODUCTION AND OPERATIONS MANAGEMENT, vol. 8, no. 2 (15) , pp. 29–45, 2018, [Online]. Available: https://sid.ir/paper/217481/en

Related Journal Papers