Sökning: "Routing schedule"
Visar resultat 1 - 5 av 12 uppsatser innehållade orden Routing schedule.
1. Simulated annealing for Vehicular Ad-hoc Networks
Master-uppsats, Linnéuniversitetet/Institutionen för fysik och elektroteknik (IFE)Sammanfattning : 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. LÄS MER
2. An Optimization Model for Electric Vehicle Routing with Tractor Swapping
Master-uppsats, KTH/Matematik (Avd.)Sammanfattning : The purpose of this thesis is to investigate how tractor swapping can be implemented in Vehicle Routing Problems (VRP) with electric heavy goods vehicles, and to evaluate how a model that allows for tractor swapping performs, in terms of schedule cost, against a model that does not. Hence, this thesis introduces a new rich VRP variant which includes tractor swapping, as well as time windows, pickup and delivery, and electric vehicles. LÄS MER
3. A literature study on factors influencing the planning of green routes for heavy trucks
Kandidat-uppsats, KTH/GeoinformatikSammanfattning : The efficiency of the transport sector is under close examination due to multiple different reasons. Among them are the environmental aspects of emission reduction along with the need to maintain a tight time schedule. Heavy trucks have a significant negative impact on the environment and are sensitive to external factors. LÄS MER
4. WSN Routing Schedule Based on Energy-aware Adaptation
Master-uppsats, Mittuniversitetet/Institutionen för informationssystem och –teknologiSammanfattning : In view of the problem of uneven load distribution and energy consumption among nodes in a multi-hop wireless sensor network, this research constructs the routing schedule problem as a MOP (Multi-objective Optimization Problem), and proposed an energy-aware routing optimization scheme RDSEGA based on multi-objective optimization. In this scheme, in order to avoid the searching space explosion problem caused by the increase of nodes, KSP Yen's algorithm was applied to prune the searching space, and the candidate paths selected after pruning are recoded based on priority. LÄS MER
5. Winter Road Maintenance Planning-Decision Support Modelling
Master-uppsats, Luleå tekniska universitet/Institutionen för samhällsbyggnad och naturresurserSammanfattning : Winter in Northern Sweden comes with very harsh and unpredictable condition associated with large amounts of snowfall covering roadways thereby affecting transportation by roads. When the road conditions i.e. LÄS MER