Solving a Vehicle Routing Problem under Uncertainty by a Differential Evolution Algorithm
Purpose: In the real world, the vehicles should return to the depot after serving the last customer's location because of decreased related costs. This paper investigates the problem of increasing service time by using the stochastic time for each tour such that the total travelling time of the...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | fas |
| Published: |
Ayandegan Institute of Higher Education, Tonekabon,
2021-02-01
|
| Series: | مدیریت نوآوری و راهبردهای عملیاتی |
| Subjects: | |
| Online Access: | http://www.journal-imos.ir/article_126059_ea52316baf70647122d09663ada5787e.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832577852554346496 |
|---|---|
| author | Alireza Salamatbakhsh Reza Tavakkoli-Moghaddam Ali Pahlevani |
| author_facet | Alireza Salamatbakhsh Reza Tavakkoli-Moghaddam Ali Pahlevani |
| author_sort | Alireza Salamatbakhsh |
| collection | DOAJ |
| description | Purpose: In the real world, the vehicles should return to the depot after serving the last customer's location because of decreased related costs. This paper investigates the problem of increasing service time by using the stochastic time for each tour such that the total travelling 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 is proposed. Findings: The obtained results indicate the efficiency of the proposed DE algorithm. Originality/Value: The total travel time is limited to a definite probability per cent, and other constraints (e.g., capacity and time distribution restrictions) are considered. In contrast, the total cost of the transportation is minimized. |
| format | Article |
| id | doaj-art-fa03da3ae0424f57943fe3204720ee70 |
| institution | Kabale University |
| issn | 2783-1345 2717-4581 |
| language | fas |
| publishDate | 2021-02-01 |
| publisher | Ayandegan Institute of Higher Education, Tonekabon, |
| record_format | Article |
| series | مدیریت نوآوری و راهبردهای عملیاتی |
| spelling | doaj-art-fa03da3ae0424f57943fe3204720ee702025-01-30T14:59:20ZfasAyandegan Institute of Higher Education, Tonekabon,مدیریت نوآوری و راهبردهای عملیاتی2783-13452717-45812021-02-011431031910.22105/imos.2021.272652.1034126059Solving a Vehicle Routing Problem under Uncertainty by a Differential Evolution AlgorithmAlireza Salamatbakhsh0Reza Tavakkoli-Moghaddam1Ali Pahlevani2Department of Industrial Engineering, Ayandegan Institute of Higher Education, Tonekabon, IranDepartment of Industrial Engineering, College of Engineering, University of Tehran, Tehran, IranDepartment of Industrial Engineering, Iran University of Science and Technology, Tehran, IranPurpose: In the real world, the vehicles should return to the depot after serving the last customer's location because of decreased related costs. This paper investigates the problem of increasing service time by using the stochastic time for each tour such that the total travelling 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 is proposed. Findings: The obtained results indicate the efficiency of the proposed DE algorithm. Originality/Value: The total travel time is limited to a definite probability per cent, and other constraints (e.g., capacity and time distribution restrictions) are considered. In contrast, the total cost of the transportation is minimized.http://www.journal-imos.ir/article_126059_ea52316baf70647122d09663ada5787e.pdfvehicle routing problemdifferential evolution algorithmuncertainty |
| spellingShingle | Alireza Salamatbakhsh Reza Tavakkoli-Moghaddam Ali Pahlevani Solving a Vehicle Routing Problem under Uncertainty by a Differential Evolution Algorithm مدیریت نوآوری و راهبردهای عملیاتی vehicle routing problem differential evolution algorithm uncertainty |
| title | Solving a Vehicle Routing Problem under Uncertainty by a Differential Evolution Algorithm |
| title_full | Solving a Vehicle Routing Problem under Uncertainty by a Differential Evolution Algorithm |
| title_fullStr | Solving a Vehicle Routing Problem under Uncertainty by a Differential Evolution Algorithm |
| title_full_unstemmed | Solving a Vehicle Routing Problem under Uncertainty by a Differential Evolution Algorithm |
| title_short | Solving a Vehicle Routing Problem under Uncertainty by a Differential Evolution Algorithm |
| title_sort | solving a vehicle routing problem under uncertainty by a differential evolution algorithm |
| topic | vehicle routing problem differential evolution algorithm uncertainty |
| url | http://www.journal-imos.ir/article_126059_ea52316baf70647122d09663ada5787e.pdf |
| work_keys_str_mv | AT alirezasalamatbakhsh solvingavehicleroutingproblemunderuncertaintybyadifferentialevolutionalgorithm AT rezatavakkolimoghaddam solvingavehicleroutingproblemunderuncertaintybyadifferentialevolutionalgorithm AT alipahlevani solvingavehicleroutingproblemunderuncertaintybyadifferentialevolutionalgorithm |