Essays about: "multi-commodity"
Showing result 1 - 5 of 7 essays containing the word multi-commodity.
-
1. Optimal Multi-Commodity Network Flow of Electric Vehicles with Charge Constraints
University essay from KTH/Skolan för teknikvetenskap (SCI)Abstract : The focus of this thesis is to find, visualize and analyze the optimal flow of autonomous electric vehicles with charge constraints in urban traffic with respect to energy consumption. The traffic has been formulated as a static multi-commodity network flow problem, for which two different models have been implemented to handle the charge constraints. READ MORE
-
2. Linear Programming Algorithms for Multi-commodity Flow Problems
University essay from KTH/FysikAbstract : A multi-commodity flow problem consists of moving several commodities from their respective sources to their sinks through a network where each edge has different costs and capacity constraints. This paper explores different linear programming algorithms and their performance regarding finding an optimal solution for multi-commodity flow problems. READ MORE
-
3. Optimal Multi-Commodity Network Flow of Autonomous Vehicles in Urban Traffic
University essay from KTH/Skolan för teknikvetenskap (SCI)Abstract : The focus of this thesis was to find, visualize and analyze the optimal flow of autonomous vehicles in urban traffic with respect to fuel consumption using linear optimization. Two different formulations based on multi-commodity network flow were implemented which resulted in a static and a dynamic model of the traffic. READ MORE
-
4. Routing on Resource Allocation in Free Space Optical Network.
University essay from Linköpings universitet/Kommunikations- och transportsystem; Linköpings universitet/Tekniska högskolanAbstract : Free space optical Networks (FSO) provide benefits such as high speed, cost efficiency and licence-free high bandwidth. However, these networks are susceptible to different atmospheric conditions. READ MORE
-
5. Approximating multi-commodity max-flow in practice
University essay from KTH/Skolan för datavetenskap och kommunikation (CSC)Abstract : Garg and Könemann developed a framework for computing multi-commodity maximum flow in a graph, later called a multiplicative weight update framework. Madry used this framework and exchanged Dijkstra’s algorithm to a dynamic graph algorithm for approximating the shortest paths through the graph. READ MORE