نتایج جستجو برای: network flow problem

تعداد نتایج: 1873348  

This paper proposed a parallel automated assembly line system to produce multiple products having multiple autonomous guided vehicles (AGVs). Several assembly lines are configured to produce multiple products in which the technologies of machines are shared among the assembly lines when required. The transportation between the stations in an assembly line (intra assembly line) and among station...

2016
Priyank Sinha P. Sinha R. R. K. Sharma

In this article, we devise two dual based methods for obtaining very good solution to a single stage un-capacitated minimum cost flow problem. These methods are an improvement to the methods already developed by Sharma and Saxena [1]. We further develop a method to extract a very good primal solution from a given dual solution. We later demonstrate the efficacies and the significance of these m...

Journal: :Networks 2010
Géraldine Heilporn Martine Labbé Patrice Marcotte Gilles Savard

Consider the problem that consists in maximizing the revenue generated by tolls set on a subset of arcs of a transportation network, and where origin-destination flows are assigned to shortest paths with respect to the sum of tolls and initial costs. In this work, we address the instance where toll arcs must be connected, as occurs on highways. Our main results are concerned with the theoretica...

2010
Milos Seda

Network flow problems are among the most important ones in graph theory. Since there are many well-known polynomial algorithms for solving the classical Maximum Flow Problem, we, instead of summarising them, focus on special formulations and their transformation into the basic one, and because other graph theory problems may be formulated with the help of network flow tools, we show how to form...

1998
Éva Tardos Kevin D. Wayne

We introduce a gain-scaling technique for the generalized maximum ow problem. Using this technique, we present three simple and intuitive polynomial-time combinatorial algorithms for the problem. Truemper's augmenting path algorithm is one of the simplest combinatorial algorithms for the problem, but runs in exponential-time. Our rst algorithm is a polynomial-time variant of Truemper's algorith...

Journal: :CoRR 2016
Samiksha Sarwari Shrisha Rao

We define a thermal network, which is a network where the flow functionality of a node depends upon its temperature. This model is inspired by several types of real-life networks, and generalizes some conventional network models wherein nodes have fixed capacities and the problem is to maximize the flow through the network. In a thermal network, the temperature of a node increases as traffic mo...

Journal: :Oper. Res. Lett. 2014
Young-Soo Myung Ilkyeong Moon

This paper considers a multi-port and multi-period container planning problem of shipping companies that use both standard and foldable containers. A company must decide which number of empty containers of each type to purchase and reposition at each port within a defined period to minimize the total purchasing, repositioning, and storage costs. Wedevelop amodel to optimally allocate both folda...

2011
Jörn Schönberger Herbert Kopfer Bernd-Ludwig Wenning Henning Rekersbrink

Network freight flow consolidation organizes the commodity flow with special attention to the minimization of the flow costs but the efficiency of transport resources is not addressed. In contrast, vehicle routing targets primarily the maximization of the efficiency of transport resources but the commodity-related preferences are treated as inferior requirements. This article is about the probl...

Journal: :Proceedings of Irkutsk State Technical University 2021

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید