Service Networks Topological Design

Boris S. Verkhovsky
DOI: 10.4236/ijcns.2011.311115                

Abstract

Topological design of service networks is studied in the paper. Quantitative model and algorithm minimizing cost of processing and delivery is described. Algorithm solving combinatorial problem of optimal design based on binary partitioning, a parametric search and dynamic programming optimization of a binary tree is described and demonstrated in numeric example.

Keywords

Delivery/Processing Cost, Binary Partitioning, Dynamic Programming, First Responders, Average Complexity, Service Provider, Water Desalination

Conflicts of Interest

The authors declare no conflicts of interest.

References

[1]	M. Fiddler and V. Sander, “A Parameter Based Admission Control for Differentiated Services Networks,” Computer Networks, Vol. 44, No. 4, March 2004, pp. 463-479.
[2]	A. Chaves and L. Lorena, “Clustering Search Algorithm for the Capacitated Centered Clustering Problem,” Computers and Operations Research, Vol. 37, No. 3, March 2010, pp. 552-558.
[3]	G. Diehr, “Evaluation of a Branch-and-Bound Algorithm for Clustering,” SIAM Journal on Scientific and Statistical Computing, Vol. 6, No. 2, April 1985, pp. 268-284.
[4]	J. Heath, M. Fu and W. Jank, “New Global Optimization Algorithms for Model-Based Clustering,” Computational Statistics and Data Analysis, Vol. 53, No. 12, October 2009, pp. 3999-4017.
[5]	A. Kusiak, A. Vannelli and K. R. Kumar, “Clustering Analysis: Models and Algorithms,” Control and Cybernetics, Vol. 15, No. 2, 1986, pp. 139-154.
[6]	B. Verkhovsky, “Satellite Communication Networks: Configuration Design of Terrestrial Subnetworks”, Journal of Telecommunications Management {to appear}, 2010.
[7]	M. Gen and R. Cheng, “Evolutionary Network Design: Hybrid Genetic Algorithms Approach,” International Journal of Computational Intelligence and Applications, Vol.3, No. 4, December 2003, pp. 357- 380.
[8]	H. L. Chen and R. Tim, “Network Design with Weighted Players,” Theory of Computing Systems, Vol. 45, No. 2, June 2009, pp. 302-324.
[9]	D. S. Johnson, J. K. Lenstra and A. H. G. Rinooy Kan, “The Complexity of the Network Design Problem,” Networks, Vol. 8, No. 4, 1978, pp. 279-285.
[10]	P. McGregor and D. Shen, (1977) “Network Design: An Algorithm for the Access Facility Location Problem,” IEEE Transactions on Communications, Vol. COM-25, No. 1, January 1977, pp. 61-73.
[11]	J. Smith, F. Cruz and T. V. Woensel, “Topological Network Design of General, Finite, Multi-Server Queuing Networks,” European Journal of Operational Research, Vol. 201, No. 2, March 2010, pp. 427-441.
[12]	B. Verkhovsky, “Constrained Shortest Path Algorithm for Network Design,” International Journal of General Systems, Vol. 23, No. 2, 1996, pp. 183-195.
[13]	M. Bischoff and K. D?chert, “Allocation Search Methods for a Generalized Class of Location–Allocation Problems,” European Journal of Operational Research, Vol. 192, No. 3, February 2009, pp. 793-807.
[14]	R. Bellman, “An Application of Dynamic Programming to Location-Allocation Problems,” SIAM Review, Vol. 7, No. 1, January 1965, pp. 126-128.
[15]	J. Zhou and B. Liu, “Modeling Capacitated Location–Allocation Problem with Fuzzy Demands,” Computers and Industrial Engineering, Vol. 53, No. 3, October 2007, pp. 454-468.
[16]	B. Veroy (Verkhovsky), “An Optimal Algorithm for Search of Extreme of a Bimodal Function,” Journal of Complexity, Vol. 2, 1986, pp. 323-332.
[17]	B. Veroy, “Optimal Search Algorithms for Extrema of a Discrete Periodic Bimodal Function," Journal of Complexity, Vol. 5, No. 2, June 1989, pp. 238-250.
[18]	B. Veroy, “Average Complexity of a Divide-and- Conquer Algorithms,” Information Processing Letters, Vol. 29, No. 6, December 1988, pp. 319-326.