A MULTI-OBJECTIVE SCATTER SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE VEHICLE ROUTING PROBLEM WITH LOADING COST AND WORKLOAD BALANCING

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.

EBRAHIMI M.; KHOSHALHAN F.; BORAJEE M.; TEHRANIAN O.

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

Journal Paper

Paper Information

Journal: Journal of Operational Research in its Applications Year:2014 | Volume:11 | Issue:3 (42) Page(s): 35-57

Download Full-Text

Persian Verion

View:

1,682

Download:

Cites:

Information Journal Paper

Title

A MULTI-OBJECTIVE SCATTER SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE VEHICLE ROUTING PROBLEM WITH LOADING COST AND WORKLOAD BALANCING

Author(s)

EBRAHIMI M. | KHOSHALHAN F. | BORAJEE M. | TEHRANIAN O. | Issue Writer Certificate

Keywords

VEHICLE ROUTING PROBLEMQ2

MULTI-OBJECTIVE SCATTER SEARCHQ2

LOADING COSTQ2

WORKLOAD IMBALANCEQ2

Abstract

The VEHICLE ROUTING PROBLEM (VRP) is an important scientific problem addressed in distribution management. In classical VRP, the vehicle load is often regarded as a constant during transportation; therefore, the LOADING COST associated with the amount of the load on the vehicle, are neglected in the objective function when optimizing a vehicle routine. However, in real-world, the vehicle load varies from one customer to another in a vehicle route. Thus, the vehicle route without considering the effect of LOADING COST may lead to sub-optimal routes. In this paper, we investigate VRP with loading, which considers the costs associated with the amount of the load on the vehicle when determining the vehicle routes. This paper presents a new Pareto-based multi-objective approach that uses a MULTI-OBJECTIVE SCATTER SEARCH strategy for solving a multi-objective formulation of the VRP that aims to minimize the total distance of the vehicles used to service the customers, while also minimizing the imbalance of workloads (distances travelled/goods delivered by the vehicles). This new approach is evaluated in comparison with two well-known multi- objective algorithms, MOPSO and MODE. The results obtained when solving a subset of benchmark problems show the good performance of this approach. The results demonstrate that the suggested method is highly competitive.

Cites

No record.

References

NEW HEURISTIC ALGORITHM FOR VEHICLE ROUTING PROBLEM

Cite

APA: Copy

EBRAHIMI, M., KHOSHALHAN, F., BORAJEE, M., & TEHRANIAN, O.. (2014). A MULTI-OBJECTIVE SCATTER SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE VEHICLE ROUTING PROBLEM WITH LOADING COST AND WORKLOAD BALANCING. JOURNAL OF OPERATIONAL RESEARCH AND ITS APPLICATIONS (JOURNAL OF APPLIED MATHEMATICS), 11(3 (42)), 35-57. SID. https://sid.ir/paper/164532/en

Vancouver: Copy

EBRAHIMI M., KHOSHALHAN F., BORAJEE M., TEHRANIAN O.. A MULTI-OBJECTIVE SCATTER SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE VEHICLE ROUTING PROBLEM WITH LOADING COST AND WORKLOAD BALANCING. JOURNAL OF OPERATIONAL RESEARCH AND ITS APPLICATIONS (JOURNAL OF APPLIED MATHEMATICS)[Internet]. 2014;11(3 (42)):35-57. Available from: https://sid.ir/paper/164532/en

IEEE: Copy

M. EBRAHIMI, F. KHOSHALHAN, M. BORAJEE, and O. TEHRANIAN, “A MULTI-OBJECTIVE SCATTER SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE VEHICLE ROUTING PROBLEM WITH LOADING COST AND WORKLOAD BALANCING,” JOURNAL OF OPERATIONAL RESEARCH AND ITS APPLICATIONS (JOURNAL OF APPLIED MATHEMATICS), vol. 11, no. 3 (42), pp. 35–57, 2014, [Online]. Available: https://sid.ir/paper/164532/en

Related Journal Papers