Vehicle routing optimization with multiple fuzzy time windows based on improved wolf pack algorithm

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Improved Hybrid Cuckoo Search Algorithm for Vehicle Routing Problem with Time Windows

Transportation in economic systems such as services, production and distribution enjoys a special and important position and provides a significant portion of the country's gross domestic product. Improvements in transportation system mean improvements in the traveling routes and the elimination of unnecessary distances in any system. The Vehicle Routing Problem (VRP) is one of the practical co...

متن کامل

Location-Routing Problem with Fuzzy Time Windows and Traffic Time

The location-routing problem is a relatively new branch of logistics system. Its objective is to determine a suitable location for constructing distribution warehouses and proper transportation routing from warehouse to the customer. In this study, the location-routing problem is investigated with considering fuzzy servicing time window for each customer. Another important issue in this regard ...

متن کامل

Competitive Vehicle Routing Problem with Time Windows and Stochastic Demands

The competitive vehicle routing problem is one of the important issues in transportation area. In this paper a new method for competitive VRP with time windows and stochastic demand is introduced. In the presented method a three time bounds are given and the probability of arrival time between each time bound is assumed to be uniform. The demands of each customer are different in each time wind...

متن کامل

Multi-objective Optimization of Vehicle Routing Problem with Time Windows

Products distribution is a process on which products are moved from sources to customers. According to Toth and Vigo [1], transportation costs typically represent 10-20% of the final price of goods on the market. Over the past 20 years, Vehicle Routing Problem (VRP) was especially solved through the use of meta-heuristics, see Jozefowiez et al. [2], Vidal et al. [3]. Eksioglu et al. [4] made a ...

متن کامل

Improved Simulated Annealing for Optimization of Vehicle Routing Problem with Time Windows (vrptw)

The Vehicle Routing Problem with Time Windows (VRPTW) is a combinatorial optimization problem that exists in various distribution systems. The problem deals with allocation of vehicles to service several customers, each customer has different available time, and the vehicles must visit the customers in their available time.This paper addresses the VRPTW by using an improved simulated annealing ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Production Engineering & Management

سال: 2017

ISSN: 1854-6250,1855-6531

DOI: 10.14743/apem2017.4.267