نتایج جستجو برای: routing problem time window bi
تعداد نتایج: 2657033 فیلتر نتایج به سال:
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 ...
During the last decade, the stringent pressures from environmental and social requirements have spurred an interest in designing a reverse logistics (RL) network. The success of a logistics system may depend on the decisions of the facilities locations and vehicle routings. The location-routing problem (LRP) simultaneously locates the facilities and designs the travel routes for vehicles among ...
this paper considers the multi-depot vehicle routing problem with time window in which each vehicle starts from a depot and there is no need to return to its primary depot after serving customers. the mathematical model which is developed by new approach aims to minimizing the transportation cost including the travelled distance, the latest and the earliest arrival time penalties. furthermore, ...
In practice, there are several applications in which logistics service providers determine the time windows at customers, for example, parcel delivery, retail, and repair services. These companies face uncertain travel times that have to be taken into account when determining routes prior departure. The objective of proposed robust vehicle routing problem with window assignments (RVRP-TWA) is s...
16 A Bi-Objective Vehicle Routing Problem with Time Window by Considering Customer Satisfaction; Masoud Rabbani, School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran Mahyar Taheri, School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran Mohammad Ravanbakhsh, School of Industrial Engineering, College of Engineering, Uni...
Vehicle Routing Problem with Time Windows (VRPTW) is an NP-Complete Optimization Problem. Even finding an optimal solution for small size problems is too hard and time-consuming. The objective of VRPTW is to use a fleet of vehicles with specific capacity to serve a number of customers with dissimilar demands and time window constraints at minimum cost, without violating the capacity and time wi...
One of the most important problems for distribution companies is to find the best locations for depots and to find proper routes for transportation vehicles and to optimize supply network. This study intends to develop a model for the problem of location-routing in post offices. So, a new Bi-Objective Location-Routing Problem for Locating Town Post Office and Routing Parcels is defined. This pr...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید