A heuristic algorithm for the earliest arrival flow with multiple sources
type: Item
instance of: scholarly article
title: A heuristic algorithm for the earliest arrival flow with multiple sources
zbMATH Open document ID: 1292.65067
author: Hong Zheng
author: Yi-Chang Chiu
author: Pitu B. Mirchandani
published in: Journal of Mathematical Modelling and Algorithms in Operations Research
publication date: 2014-06-20T00:00:00Z
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6305884
zbMATH Keywords: network flows
zbMATH Keywords: dynamic flows
zbMATH Keywords: earliest arrival flows
zbMATH Keywords: flows over time
zbMATH Keywords: heuristics
zbMATH Keywords: heuristic algorithm
zbMATH Keywords: numerical example
MaRDI profile type: Publication
full work available at URL: s10852-013-9226-8
OpenAlex ID: W2026054600
cites work: Constructing Maximal Dynamic Flows from Static Flows
cites work: A survey of dynamic network flows
cites work: Auxiliary procedures for solving long transportation problems
cites work: An Introduction to Network Flows over Time
cites work: Efficient continuous-time dynamic network flow algorithms
cites work: Transient flows in networks
cites work: Continuous-Time Flows in Networks
cites work: Faster algorithms for the quickest transshipment problem
cites work: Quickest Flows Over Time
cites work: Note—Some Equivalent Objectives for Dynamic Network Flow Problems
cites work: Q2776597
cites work: Q4828930
cites work: A linear programming model for the single destination system optimum dynamic traffic assignment problem
cites work: An Algorithm for Universal Maximal Dynamic Flows in a Network
cites work: Maximal, Lexicographic, and Dynamic Network Flows
cites work: Q3128904
cites work: Optimal dynamic routing in communication networks with continuous traffic
cites work: Q4737515
cites work: Earliest Arrival Flows with Multiple Sources
cites work: The quickest transshipment problem
cites work: The quickest flow problem
cites work: A bad network problem for the simplex method and other minimum cost flow algorithms
cites work: Q3584086
DOI: 10.1007/S10852-013-9226-8
Recommended article: Earliest arrival flows in networks with multiple sinks
Recommended article: Earliest Arrival Flows with Multiple Sources
Recommended article: A heuristic solution procedure for multicommodity integer flows
Recommended article: Approximating Earliest Arrival Flows in Arbitrary Networks
Recommended article: A Heuristic Procedure For Path Location With Multisource Demand
Recommended article: The Multi Terminal q-FlowLoc Problem: A Heuristic
Recommended article: An Heuristic Method for Solving Time-Sensitive Routeing Problems
Recommended article: A heuristic algorithm for minimizing mean flow time with unit setups
Recommended article: Approximating earliest arrival flows with flow-dependent transit times
description: scientific article; zbMATH DE number 6305884