Name
Abstract | ||
|---|---|---|
The paper discusses a stochastic approach, called Simulated Allocation (SA), to the capacitated and uncapacitated multicommodity
integral flow allocation problems. Since such problems are in general NP‐complete, effective heuristic approaches are of interest,
and SA is one of them. The idea of SA has its origin in discrete event simulation of alternative call routing in telecommunication
networks. We describe an implementation of SA and illustrate its effectiveness by means of numerical examples including multiple
knapsack problem and network design. Numerical experiments indicate that SA is capable of bypassing local minima of the problem
objective function, and allows for achieving reasonable solutions in a reasonable time. |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1023/A:1019151707785 | Telecommunications Systems |
Keywords | Field | DocType |
Capacity Unit,Discrete Event Simulation,Telecommunication Network,Accessible Path,Allocation Effort | Heuristic,Mathematical optimization,Telecommunications network,Network planning and design,Computer science,Flow (psychology),Algorithm,Maxima and minima,Knapsack problem,Call routing,Discrete event simulation | Journal |
Volume | Issue | ISSN |
7 | 1-3 | 1572-9451 |
Citations | PageRank | References |
5 | 0.73 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michal Pióro | 1 | 293 | 50.26 |
| Piotr Gajowniczek | 2 | 11 | 3.24 |