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

Message:
Article Type:
Research/Original Article (بدون رتبه معتبر)
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.

Language:
Persian
Published:
Journal of Innovation Management and Operational Strategies, Volume:1 Issue: 4, 2021
Pages:
310 to 319
https://www.magiran.com/p2256302  
سامانه نویسندگان
  • Corresponding Author (2)
    Reza Tavakkoli Moghaddam
    Professor School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran
    Tavakkoli Moghaddam، Reza
اطلاعات نویسنده(گان) توسط ایشان ثبت و تکمیل شده‌است. برای مشاهده مشخصات و فهرست همه مطالب، صفحه رزومه را ببینید.
مقالات دیگری از این نویسنده (گان)