Essays about: "simulated annealing algorithm for VRP"
Found 3 essays containing the words simulated annealing algorithm for VRP.
-
1. Simulated annealing for Vehicular Ad-hoc Networks
University essay from Linnéuniversitetet/Institutionen för fysik och elektroteknik (IFE)Abstract : In this thesis, we tackle a significant optimization challenge within Vehicular Ad Hoc Networks (VANETs) by employing a simulated annealing approach. We focus on developing an efficient Vehicle Routing Problem (VRP) algorithm to sift through numerous potential solutions and identify the best one. READ MORE
-
2. Capacitated Multi Depot Green Vehicle Routing for Transporting End-of-Life electrical waste : A practical study on environmental and social sustainability within the field of CMDGVRP with heterogeneous fleets
University essay from Högskolan i Halmstad/Akademin för informationsteknologiAbstract : A comprehensive study is presented of the Capacitated Multi DepotGreen Vehicle Routing Problem (CMDGVRP) applied to a heterogeneous fleet of electronic waste collecting vehicles with two objectives: to reduce the total fuel consumption of the vehicles (environmental sustainability) and to limit the continuous drive-time of the drivers (social sustainability). Research has been limited from this aspect, and in this study, the focus is on the practical application of pickup and delivery of electronic waste. READ MORE
-
3. Solving the Vehicle Routing Problem with Genetic ALgorithm and Simulated Annealing
University essay from DatateknikAbstract : This Thesis Work will concentrate on a very interesting problem, the Vehicle Routing Problem (VRP). In this problem, customers or cities have to be visited and packages have to be transported to each of them, starting from a basis point on the map. READ MORE