VEHICLE ROUTING IN A MULTI-PRODUCT SUPPLY CHAIN USING POPULATED SIMULATED ANNEALING 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.

BEHESHTINIA MOHAMMAD ALI; BOROMAND ALI; Taheri Mohammadreza; BABAEI HESAM

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

Journal Paper

Paper Information

Journal: PRODUCTION AND OPERATIONS MANAGEMENT Year:2018 | Volume:9 | Issue:1 (16) Page(s): 1-27

Download Full-Text

Persian Verion

View:

818

Download:

474

Cites:

Information Journal Paper

Title

VEHICLE ROUTING IN A MULTI-PRODUCT SUPPLY CHAIN USING POPULATED SIMULATED ANNEALING ALGORITHM

Author(s)

BEHESHTINIA MOHAMMAD ALI | BOROMAND ALI | Taheri Mohammadreza | BABAEI HESAM | Issue Writer Certificate

Keywords

ROUTINGQ1

GENETIC ALGORITHMQ2

SIMULATED ANNEALINGQ1

SCHEDULINGQ1

Abstract

This paper aims to examine the SCHEDULING of vehicles in a multi-product supply chain regarding to the mutual relationship between the transportation and the manufacturing units. The integration level in the supply chain consists of a manufacturer and its first tier suppliers, which are linked by a transportation fleet. The problem is determining orders allocation to the suppliers, orders production sequence at the suppliers, orders allocation to the vehicles, and orders transportation priority, in order to minimize the sum of orders delivery time. This issue has not been discussed in the literature, so far. At first, the mathematical model of the problem is presented, then the NP-Hardness of the problem is demonstrated. For solving the problem, a new combination of GENETIC ALGORITHM and SIMULATED ANNEALING algorithm, named as Populated SIMULATED ANNEALING algorithm (PSA) is proposed. For verifying the PSA, its results are compared to results of SIMULATED ANNEALING algorithm (SA) and developed version of DGA algorithm, proposed for the nearest problem in the literature to our problem. Furthermore, relaxing some hypothesis, the results of PSA are compared to DGA results. All of the comparisons show that PSA is more efficient than the other algorithms. Finally, comparison of PSA with exact solution for small size problems demonstrates its proper efficiency.

Cites

No record.

References

No record.

Cite

APA: Copy

BEHESHTINIA, MOHAMMAD ALI, BOROMAND, ALI, Taheri, Mohammadreza, & BABAEI, HESAM. (2018). VEHICLE ROUTING IN A MULTI-PRODUCT SUPPLY CHAIN USING POPULATED SIMULATED ANNEALING ALGORITHM. PRODUCTION AND OPERATIONS MANAGEMENT, 9(1 (16) ), 1-27. SID. https://sid.ir/paper/217522/en

Vancouver: Copy

BEHESHTINIA MOHAMMAD ALI, BOROMAND ALI, Taheri Mohammadreza, BABAEI HESAM. VEHICLE ROUTING IN A MULTI-PRODUCT SUPPLY CHAIN USING POPULATED SIMULATED ANNEALING ALGORITHM. PRODUCTION AND OPERATIONS MANAGEMENT[Internet]. 2018;9(1 (16) ):1-27. Available from: https://sid.ir/paper/217522/en

IEEE: Copy

MOHAMMAD ALI BEHESHTINIA, ALI BOROMAND, Mohammadreza Taheri, and HESAM BABAEI, “VEHICLE ROUTING IN A MULTI-PRODUCT SUPPLY CHAIN USING POPULATED SIMULATED ANNEALING ALGORITHM,” PRODUCTION AND OPERATIONS MANAGEMENT, vol. 9, no. 1 (16) , pp. 1–27, 2018, [Online]. Available: https://sid.ir/paper/217522/en

Related Journal Papers