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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
