Abstract
Under study is the problem of optimal location of interconnected objects on a line with forbidden gaps. The task is to minimize the total cost of links between objects and between objects and zones. The properties of the problem are found that allowed us to reduce the initial continuous problem to a discrete problem. Some algorithm for obtaining an approximate solution is developed, and the results of a computational experiment are given.
This is a preview of subscription content, log in via an institution to check access.
References
E. N. Goncharov and Yu. A. Kochetov, “Probabilistic Search with Exclusions for Discrete Unconstrained Optimization,” Diskret. Anal. Issled. Oper. Ser. 2, 9 (2), 13–30 (2002).
M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979; Mir, Moscow, 1982).
A. I. Erzin and J. D. Cho, “Concurrent Placement and Routing in the Design of Integrated Circuits,” Avtomat. i Telemekh. No. 12, 177–190 (2003) [Automat. Remote Control 64 (12), 1988–1999 2003].
G. G. Zabudskii and I. V. Amzin, “Algorithms of Compact Location for Technology Equipment on Parallel Lines,” Sibirsk. Zh. Industr. Mat. 16 (3), 86–94 (2013).
G. G. Zabudskii and N. S. Veremchuk, “Algorithms for Approximate Solving the Weber Problem on a Line with Forbidden Gaps,” in Proceedings of the XV All-Russian Conference “Mathematical Programming and Applications,” Ekaterinburg, Russia,March 2–6, 2015 (Inst. Mat. iMekh., Ural. Otdel. Ross. Akad. Nauk, Ekaterinburg, 2015), p.133.
E. A. Mukhacheva, “A Review and Prospects of Development of Combinatorial Methods for Solution of Cutting and Packing Problems,” in Proceedings of the Russian Conference “Discrete Optimization and Operation Research,” Novosibirsk, Russia, June 24–28, 2002 (Inst. Mat., Novosibirsk, 2002), pp. 80–87.
A. V. Panyukov, “The Problem of Locating Rectangular Plants with Minimum Cost of a Connecting Network,” Diskret. Anal. Issled. Oper. Ser. 2, 8 (1), 70–87 (2001).
A. S. Rudnev, “Probabilistic Tabu Search Algorithm for the Packing Circles and Rectangles into the Strip,” Diskret. Anal. Issled. Oper. 16 (4), 61–86 (2009).
Yu. G. Stoyan and S. V. Yakovlev, Mathematical Models and Optimization Methods in Geometric Design (Naukova Dumka, Kiev, 1986) [in Russian].
V. A. Trubin, “Effective Algorithmfor theWeber Problem with a RectangularMetric,” Kibernet. No. 6, 67–70 (1978) [Cybernetics 14 (6), 874–878 1978].
L. Cheng and M. D. F. Wong, “Floorplan Design for Multi-Million Gate FPGAs,” in Proceedings of the 2004 IEEE/ACM International Conference on Computer-Aided Design, San Jose, CA, USA, November 7–11, 2004 (IEEE Comput. Soc.,Washington, DC, USA, 2004), pp. 292–299.
J. Cong, A. Jagannathan, G. Reinman, and M. Romesis, “Microarchitecture Evaluation with Physical Planning,” in Proceedings of the 40th Annual on Design Automation Conference, Anaheim, USA, June 2–6, 2003 (ACM, New York, 2003), pp. 32–35.
A. B. Kahng, “Classical Floorplanning Harmful?,” in Proceedings of the 2000 International Symposium Phys. Des., SanDiego, USA, April 9–12, 2000 (ACM, New York, 2000), pp. 207–213.
D. M. Simmons, “One-Dimensional Space Allocation: AnOrdering Algorithm,” Oper. Res. 17 (5), 812–826 (1969).
G. Suresh and S. Sahu, “Multiobjective Facility Layout Using Simulated Annealing,” Int. J. Prod. Econom. 32 (2), 239–254 (1993).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © G.G. Zabudskii, N.S. Veremchuk, 2016, published in Diskretnyi Analiz i Issledovanie Operatsii, 2016, Vol. 23, No. 1, pp. 82–94.
Rights and permissions
About this article
Cite this article
Zabudskii, G.G., Veremchuk, N.S. An algorithm for finding an approximate solution to the Weber problem on a line with forbidden gaps. J. Appl. Ind. Math. 10, 136–144 (2016). https://doi.org/10.1134/S1990478916010154
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1990478916010154