A Two-Criterion Lexicographic Algorithm for Finding All Shortest Paths in Networks

Vasyanin, V. A.

doi:10.1007/s10559-014-9666-9

Cited by 3 publications

(2 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Assume that we know the reference matrix of the routes of transportation of flows of transport units C c ij n n * * || || =´‚ obtained in constructing the shortest paths in the network G using the step criterion (minimum of transit nodes along the flow route, minimum route length) [4]. Elements of matrix C * are defined as follows:…”

Section: Problem Solution Algorithmsmentioning

confidence: 99%

See 1 more Smart Citation

Optimization Algorithms for Packing of Small-Lot Correspondence in Communication Networks

2016

Self Cite

View full text Add to dashboard Cite

The paper discusses algorithms to solve packing optimization problem, which arises in sorting and packing of small-lot cargo in containers in mainline transportation networks or in merging messages into virtual containers in backbone data transmission networks. A problem statement is proposed and its specific properties and approaches to the solution are discussed. The convergence and time complexity of the number of heuristic algorithms are analyzed and numerical experiments are used to investigate their comparative efficiency. It is shown experimentally that solutions results obtained by different optimization strategies based on networks that have up to 500 nodes differ by no more than 2.65%.

show abstract

Section: Problem Solution Algorithmsmentioning

confidence: 99%

“…Use the algorithm [4] for the given lengths of arcs of network G to construct for all correspondence the shortest paths by step criterion (minimum number of transit nodes in the path, minimum path length) and obtain matrices C * and D.…”

Section: Algorithm Optpac1mentioning

confidence: 99%