Distributed disaggregate simplicial decomposition a. The model used here is exactly the one developed in the book she85. There are two main characteristics of the methods in this. Decomposition theory studies decompositions, or partitions, of manifolds into simple pieces, usually celllike sets.
Simplicial decomposition with disaggregated representation for the traffic assignment problem. In this paper we consider the practical implementation of the disaggregated simplicial decomposition dsd algorithm for the traffic assignment problem. The new algorithm, which is referred to as disaggregate simplicial. Simplicial decomposition with disaggregated representation for the traffic. Distributed disaggregate simplicial decomposition a parallel. Disaggregate simplicial decomposition method for solving the traffic assignment. The main goal of the book is to help students interested in geometric topology to bridge the gap between entrylevel graduate courses and research at the frontier as well as to. When applied to the traffic assignment problem, shortest route subproblems are solved in order to generate extreme points of the polyhedron of feasible flows, and, alternately, master problems are solved over the convex hull of the generated extreme points. Namely, we define an invariant decomposition with indices arranged on a simplicial complex, and which is explicitly invariant under a group.
Wolfe and ordinary sd methods must be modified with an extra bookkeeping in order. Since its inception in 1929, the subject has become an important tool in geometric topology. Niclas andreasson, anton evgrafov, michael patriksson et al. Simplicial decomposition with disaggregated representation for the. Part of the lecture notes in economics and mathematical systems book series lne. Investigating pathbased solution algorithms to the stochastic user. An augmented lagrangean dual algorithm for link capacity side. The algorithm is based on the concepts of simplicial decomposition. It is a column generation method that at each step has to solve a huge number of quadratic knapsack problems qkp. A unifying polyhedral approximation framework for convex.
431 254 841 675 1010 1006 1105 557 952 917 1214 376 423 497 89 843 462 1589 1052 1378 987 1180 588 511 1458 62 622 1277 1419 1415 469 1211 321 1382 537 1658 740 1052 562 569 152 1098 603 1382 67 252 674