Sökning: "Capacitated Vehicle Routing Problem"
Hittade 4 uppsatser innehållade orden Capacitated Vehicle Routing Problem.
1. Randomized heuristic scheduling of electrical distribution network maintenance in spatially clustered balanced zones
Master-uppsats, KTH/GeoinformatikSammanfattning : Reliable electricity distribution systems are crucial; hence, the maintenance of such systems is highly important, and in Sweden strictly regulated. Poorly planned maintenance scheduling leads unnecessary driving which contributes to increased emissions and costs. LÄS MER
2. Modelling and Optimization of Simultaneous Froward- and Reverse Logistics as Capacitated Vehicle Routing Problem : An optimization simulation model problem
Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)Sammanfattning : Environmental issues are a vital concern in today’s world. The Swedish government and local businesses are developing a sustainable business and eco-friendly environment for city inhabitants. Last-mile pickup and delivery services are a key concern, which significantly impacts the environment and society. LÄS MER
3. 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
Uppsats för yrkesexamina på avancerad nivå, Högskolan i Halmstad/Akademin för informationsteknologiSammanfattning : 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. LÄS MER
4. Parameter Tuning Experiments of Population-based Algorithms
Kandidat-uppsats, Institutionen för informationsteknologi och medierSammanfattning : In this study, three different algorithms are implemented to solve thecapacitated vehicle routing problem with and without time windows:ant colony optimization, a genetic algorithm and a genetic algorithmwith self-organizing map. For the capacitated vehicle routing problemthe Augerat et al’s benchmark problems were used and for the capaci-tated vehicle routing problem with time windows the Solomon’sbenchmark problems. LÄS MER