Sökning: "Multi-commodity Flow Problem"

Hittade 4 uppsatser innehållade orden Multi-commodity Flow Problem.

  1. 1. Optimal Multi-Commodity Network Flow of Electric Vehicles with Charge Constraints

    Kandidat-uppsats, KTH/Skolan för teknikvetenskap (SCI)

    Författare :Carl Kristian Gomér Torp; Simon Melander; [2023]
    Nyckelord :autonomous electric vehicles; multi-commodity network flow; optimal routing; traffic planning; charge constraints; linear optimization; mathematical modeling; graph theory;

    Sammanfattning : 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. LÄS MER

  3. 2. Linear Programming Algorithms for Multi-commodity Flow Problems

    Kandidat-uppsats, KTH/Fysik

    Författare :Isaac Rosenberg Enquist; Phillip Sjögren; [2022]
    Nyckelord :Multi-commodity Flow Problem; Linear Programming; Linear Optimization; Simplex; Interior-point Method; Graph Theory; Optimization Theory; Transportation Problems;

    Sammanfattning : 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. LÄS MER

  4. 3. Optimering av varutransport med Mixed integer Linear Programming : En effektivisering av körsträckor när två tidigare separata transporter med olika produker kombineras.

    Kandidat-uppsats, Mittuniversitetet/Institutionen för informationssystem och –teknologi

    Författare :Felix Nordling; Simon Sandberg; [2022]
    Nyckelord :Mixed integer linear programming; multi-commodity network flow; transport logistics; goods transport; closed-loop logistic network; multi-period problem; traveling salesperson problem; Mixad heltalslinjärprogrammering; multivaru nätverksflöde; transportlogistik; varutransport; slutna logistiknätverk; flerperiodsproblem; handelsresandeproblemet;

    Sammanfattning : The purpose of this paper is to increase the routing efficiency of two previously separate commodity transports. By combining them in a common, multi-commodity network flow (MCNF). A Mixed Integer Linear Programming (MILP) model is used to minimize the mileage that is needed to fulfill demand in the different destinations of the transport network. LÄS MER

  5. 4. Routing on Resource Allocation in Free Space Optical Network.

    Master-uppsats, Linköpings universitet/Kommunikations- och transportsystem; Linköpings universitet/Tekniska högskolan

    Författare :Md Arifur Rahman; [2016]
    Nyckelord :;

    Sammanfattning : 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. LÄS MER