Solving a Vehicle Routing Problem under Uncertainty by a Differential Evolution 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.

SALAMAT BAKHSH ALIREZA; TAVAKKOLI MOGHADDAM REZA; Pahlevani Ali

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: INNOVATION MANAGEMENT AND OPERATIONAL STRATEGIES Year:2021 | Volume:1 | Issue:4 Page(s): 310-319

Download Full-Text

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

Persian Verion

View:

509

Download:

Cites:

Information Journal Paper

Title

Solving a Vehicle Routing Problem under Uncertainty by a Differential Evolution Algorithm

Author(s)

SALAMAT BAKHSH ALIREZA | TAVAKKOLI MOGHADDAM REZA | Pahlevani Ali | Issue Writer Certificate

Keywords

vehicle routing problem

Differential evolution algorithm

Uncertainty

Abstract

Purpose: In the real world, because of decreasing the related cost, the vehicles should return to the depot after serving the last customer’ s location. This paper investigates the problem of the increasing service time by using the stochastic time for each tour such that the total traveling time of the vehicles is limited to a specific limit based on a defined probability. Methodology: It is proven that classic models in vehicle routing problems (VRPs) belong to the class of NP-hard ones; thus, due to its complexity using exact methods in large-scale problems, a meta-heuristic based differential evolution (DE) algorithm. Findings: The obtained results indicate the efficiency of the proposed DE algorithm. Originality/Value: The total travel time is limited to a definite probability percent, and also other constraints (e. g., capacity and time distribution restrictions) are considered while the total cost of the transportation is minimized.

Cites

No record.

References

No record.

Cite

APA: Copy

SALAMAT BAKHSH, ALIREZA, TAVAKKOLI MOGHADDAM, REZA, & Pahlevani, Ali. (2021). Solving a Vehicle Routing Problem under Uncertainty by a Differential Evolution Algorithm. INNOVATION MANAGEMENT AND OPERATIONAL STRATEGIES, 1(4 ), 310-319. SID. https://sid.ir/paper/409264/en

Vancouver: Copy

SALAMAT BAKHSH ALIREZA, TAVAKKOLI MOGHADDAM REZA, Pahlevani Ali. Solving a Vehicle Routing Problem under Uncertainty by a Differential Evolution Algorithm. INNOVATION MANAGEMENT AND OPERATIONAL STRATEGIES[Internet]. 2021;1(4 ):310-319. Available from: https://sid.ir/paper/409264/en

IEEE: Copy

ALIREZA SALAMAT BAKHSH, REZA TAVAKKOLI MOGHADDAM, and Ali Pahlevani, “Solving a Vehicle Routing Problem under Uncertainty by a Differential Evolution Algorithm,” INNOVATION MANAGEMENT AND OPERATIONAL STRATEGIES, vol. 1, no. 4 , pp. 310–319, 2021, [Online]. Available: https://sid.ir/paper/409264/en

Related Journal Papers