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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J.E. Beasley, Distributing test problems by Electronic mail, Journal of Operational Research Society 41(11) 1990.
W. Feller, An Introduction to Probability Theory and its Applications, Vol. I (Wiley, New York, 1968).
M.R. Garey and D.S. Johnson, Computers and Intractability - A Guide to the Theory of NPCompleteness (Freeman, San Francisco, CA, 1979).
S. Khuri, T. Bäck and J. Heitkätter, The zero/one multiple knapsack problem and genetic algorithms, in: Proceedings of ACM Symposium of Applied Computation ('94) (ACM Press, 1993).
M. Pióro and P. Gajowniczek, Stochastic allocation of virtual paths to ATM links, in: Performance Modelling and Evaluation of ATM Networks, ed. D. Kouvatsos (Chapman & Hall, London, 1995).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Pióro, M., Gajowniczek, P. Solving multicommodity integral flow problems by simulated allocation. Telecommunication Systems 7, 17–28 (1997). https://doi.org/10.1023/A:1019151707785
Issue Date:
DOI: https://doi.org/10.1023/A:1019151707785