MULTIOBJECTIVE GENETIC ALGORITHM FOR FUZZY TIME WINDOWS VEHICLE ROUTING PROBLEM

Publish Year: 1389
نوع سند: مقاله کنفرانسی
زبان: English
View: 1,187

This Paper With 5 Page And PDF Format Ready To Download

  • Certificate
  • من نویسنده این مقاله هستم

این Paper در بخشهای موضوعی زیر دسته بندی شده است:

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این Paper:

شناسه ملی سند علمی:

ICFUZZYS10_088

تاریخ نمایه سازی: 9 شهریور 1391

Abstract:

Vehicle routing problem (VRP) is a well-known combinatorial optimization problem, holds a central place in logistics management. In the business, transportation, time windows are not always strictly complied and the deviationof service time from specific time window determines the customer’s satisfaction level. The purpose of this paper is to pay about restriction on uploading/delivering time when time constraints are not certain. Therefore this study applies fuzzy membership functions to characterize the service level issues associated with time window violations in VRP with two goals so that minimize the travel cost and maximize the supplier’s service level. In facing to this multiobjective problem, we utilized a genetic algorithm to reduce the problem to a mono-criterion and single-objective optimization problem, which has less complexity in searching space and solving this flexible time windows problem

Keywords:

Vehicle Routing Problem (VRP) , Fuzzy Time Window , Multiobjective Genetic Algorithm