Keyword: networks: flow

Found 611 papers in total
Strict Nash networks and partner heterogeneity
Strict Nash networks and partner heterogeneity
2011,
This paper extends the two-way flow model of network formation initiated by Bala and...
Design and implementation of efficient transit networks: Procedure, case study and validity test
Design and implementation of efficient transit networks: Procedure, case study and validity test
2011,
This paper presents and tests a method to design high-performance transit networks....
A simulation optimization‐based decision support tool for mitigating traffic congestion
A simulation optimization‐based decision support tool for mitigating traffic congestion
2011,
Traffic congestion has grown considerably in the United States over the past 20 years....
Hybrid metaheuristics for the profitable arc tour problem
Hybrid metaheuristics for the profitable arc tour problem
2011,
The profitable arc tour problem is a variant in the vehicle routing problems. It is...
Large‐scale road network vulnerability analysis: a sensitivity analysis based approach
Large‐scale road network vulnerability analysis: a sensitivity analysis based approach
2011,
Traditionally, an assessment of transport network vulnerability is a computationally...
Minimizing fuel cost in gas transmission networks by dynamic programming and adaptive discretization
Minimizing fuel cost in gas transmission networks by dynamic programming and adaptive discretization
2011,
In this paper, the problem of computing optimal transportation plans for natural gas...
Optimal sub‐networks in traffic assignment problem and the Braess paradox
Optimal sub‐networks in traffic assignment problem and the Braess paradox
2011,
This paper is related to the Braess paradox. For a given transportation network, we...
Branch and Price for Service Network Design with Asset Management Constraints
Branch and Price for Service Network Design with Asset Management Constraints
2011,
We address the service network design problem with asset management considerations for...
Real Option Pricing of Network Design Investments
Real Option Pricing of Network Design Investments
2011,
A real option solution and method are used to quantify the value of flexibility for...
Optimal Allocation of Protective Resources in Shortest‐Path Networks
Optimal Allocation of Protective Resources in Shortest‐Path Networks
2011,
This article introduces a game‐theoretic approach for allocating protection...
Modeling Network Transition Constraints with Hypergraphs
Modeling Network Transition Constraints with Hypergraphs
2011,
Discrete time dynamic graphs are frequently used to model multicommodity flows or...
A Network Flow Algorithm for the Cell‐Based Single‐Destination System Optimal Dynamic Traffic Assignment Problem
A Network Flow Algorithm for the Cell‐Based Single‐Destination System Optimal Dynamic Traffic Assignment Problem
2011,
The cell‐transmission model‐based single‐destination system...
A basic mathematical model for evacuation problems in urban areas
A basic mathematical model for evacuation problems in urban areas
2011,
Real life situations like floods, hurricanes or chemical accidents may cause the...
A Tactical Planning Model for Railroad Transportation of Dangerous Goods
A Tactical Planning Model for Railroad Transportation of Dangerous Goods
2011,
Railroad transportation of hazardous materials did not receive as much attention as...
A New Resource‐Constrained Multicommodity Flow Model for Conflict‐Free Train Routing and Scheduling
A New Resource‐Constrained Multicommodity Flow Model for Conflict‐Free Train Routing and Scheduling
2011,
This paper addresses the problem of generating conflict‐free train schedules on...
Routing Trains Through Railway Junctions: A New Set‐Packing Approach
Routing Trains Through Railway Junctions: A New Set‐Packing Approach
2011,
The problem of routing trains through railway junctions is an integral part of railway...
Integrating Slot Exchange, Safety, Capacity, and Equity Mechanisms Within an Airspace Flow Program
Integrating Slot Exchange, Safety, Capacity, and Equity Mechanisms Within an Airspace Flow Program
2011,
In this paper, we study an airspace flow program in the context of...
A time‐indexed LP‐based approach for min‐sum job‐shop problems
A time‐indexed LP‐based approach for min‐sum job‐shop problems
2011,
In this paper we propose two time‐indexed IP formulations for job‐shop...
Finding the shortest paths by node combination
Finding the shortest paths by node combination
2011,
By repeatedly combining the source node’s nearest neighbor, we propose a node...
Public‐transport vehicle scheduling with multi vehicle type
Public‐transport vehicle scheduling with multi vehicle type
2011,
The public‐transport (transit) operation planning process commonly includes...
A network flow model for clustering segments and minimizing total maintenance and rehabilitation cost
A network flow model for clustering segments and minimizing total maintenance and rehabilitation cost
2011,
Because of shrinking budgets, transportation agencies are facing severe challenges in...
A concurrent solution for intra‐cell flow path layouts and I/O point locations of cells in a cellular manufacturing system
A concurrent solution for intra‐cell flow path layouts and I/O point locations of cells in a cellular manufacturing system
2011,
In this paper, we study the I/O (Input/Output) point location problem and the...
A Stronger Model of Dynamic Programming Algorithms
A Stronger Model of Dynamic Programming Algorithms
2011,
We define a formal model of dynamic programming algorithms which we call Prioritized...
Simulation and optimisation of intermodal barge transport networks
Simulation and optimisation of intermodal barge transport networks
2011,
This work deals with two key aspects in the competitiveness of intermodal transport...
Papers per page: