نتایج جستجو برای: vehicle routing and scheduling problem vrsp
تعداد نتایج: 16947081 فیلتر نتایج به سال:
The coming era of world has moved to an exceptional leading contest of innovations and inspiration. In this paper, an attempt has been made to find out a solution to ensure the safety of route to parents when their child is travelling to school and back to home. Recent years, spatial data and observed data, such as digital road map, traffic route, vehicle speed, recordings events and others are...
Modeling of a Vehicle Routing Problem with Actual Constraints and Re-scheduling for Dynamic Requests
Practical vehicle routing problems generally have both routing and scheduling aspects to consider. However, few heuristicmethods exist that address both these complicated aspects simultaneously. We present heuristics to determine an efficient circular traversal of a weighted graph that requires a subset of its edges to be traversed, each a specified (potentially different) number of times. Cons...
In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system ...
Over the two last decades, distribution companies have been aware of the importance of paying attention to the all aspects of a distribution system simultaneously to be successful in the global market. These aspects are the economic, the environmental, the social and the safety aspects. In the Vehicle Routing Problem (VRP) literature, the economic issue has often been used, while the environmen...
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...
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, ...
Multi-vehicle routing has become increasingly important with the rapid development in autonomous vehicle technology. Dial-a-ride problem, a variant of vehicle routing problem (VRP), deals with the allocation of customer requests to vehicles, scheduling the pick-up and drop-off times and the sequence of serving those requests by ensuring high customer satisfaction with minimized travel cost. In ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید