نتایج جستجو برای: vehicle routing and scheduling problem vrsp
تعداد نتایج: 16947081 فیلتر نتایج به سال:
this paper discusses the multi-depot vehicle routing problem of heterogeneous fleet of vehicles with time windows for perishable commodities. the objective of the problem is to minimize the total time required for servicing all customers that is equivalent to the total cost. commodities are delivered to the customers with defined time windows by a fleet of heterogeneous vehicles, which have lim...
For this paper, we explored the implementation of the cuckoo search algorithm applied to the capacitated vehicle routing problem. The cuckoo search algorithm was implemented with Lévy flights with the 2-opt and double-bridge operations, and with 500 iterations for each run. The algorithm was tested on the problem instances from the Augerat benchmark dataset. The algorithm did not perform well o...
Vehicle Routing Problem (VRP) is a hot issue in the field of logistics. Furthermore, the Vehicle Routing Problem with Time-Windows (VRPTW) is an additional constraint of the customer access time windows based on the VRP. It becomes a noticeable problem with the development of logistics distribution and the just-intime distribution demand from customers, which increases a visiting window to trad...
The purpose of this article is to review the literature on the topic of deterministic vehicle routing problem (VRP) and to give a review on the exact and approximate solution techniques. More specifically the approximate (meta-heuristic) solution techniques are classified into: tabu search, simulated annealing, genetic algorithm, evolutionary algorithm, hybrid algorithm, and Ant Colony Opti...
Abstract Ad hoc Wireless Networks, are networks formed by a collection of nodes through radio. In wireless networking environment, formidable challenges are presented. One important challenge is connection maintenance mechanism for power consumption. In this paper, a multi-objective optimal design is considered for ad-hoc networks which address the electrical power of nodes effects on cross-l...
The capacitated vehicle routing problem (CVRP) is an interesting combinatorial optimization task, which occurs frequently in real-world applications [28]. The problem deals with scheduling a fleet of vehicles to distribute goods between depots and customers. A set of routes for vehicles should be determined, which are in some sense optimal, e.g. the shortest or the cheapest. Certain constraints...
With their paper ”Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints” [Discrete Optimization 3, 2006, pp. 255–273] Righini and Salani introduced bounded bidirectional dynamic programming (DP) as an acceleration technique for solving variants of the shortest path problem with resource constraints (SPPRC). SPPRCs must be s...
background & aim: nowadays, home health care services play significant roles in modern societies. such services allow the elderly and needy people to pass their treatment process at their own houses in a friendly environment. in this paper, weekly routing and scheduling problem of home health care personnel was investigated. methods & materials: insufficient number of expert personnel or overla...
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 ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید