Abstract
A two-stage continuous-discrete optimal partitioning-allocation problem is studied, and a method and an algorithm for its solving are proposed. This problem is a generalization of a classical transportation problem to the case when coordinates of the production points (collection, storage, processing) of homogeneous products are continuously allocated in the given domain and the production volumes at these points are unknown. These coordinates are found as a solution of the corresponding continuous optimal set-partitioning problem in a finite-dimensional Euclidean space with the placement (finding coordinates) of these subsets’ centers. Also, this problem generalizes discrete two-stage production-transportation problems to the case of continuously allocated consumers. The method and algorithm are illustrated by solving two model problems.
References
[1] Corley H.W., Roberts S.D., A partitioning problem with applications in regional design, Operations Research, 20(5), 1972, 1010-1019.10.1287/opre.20.5.1010Search in Google Scholar
[2] Corley H.W., Roberts S.D., Duality Relationships a Partitioning Problem, SIAM Journal of Applied Mathematics, 23(4), 1972, 490-494.10.1137/0123052Search in Google Scholar
[3] Beyko I.V., Kiseleva E.M., The condition for the optimality of the boundary of the separation of zones of territorial service, The Application of Mathematical Methods to the Solution of Production and Economic Problems, Dnepropetrovsk, DGU, 1973, 53–55 (in Russian)Search in Google Scholar
[4] Kiseleva E.M., A study of a class of optimal partitioning problems, PhD thesis, Dnepropetrovsk State University, Kiev, Ukraine, 1975 (in Russian)Search in Google Scholar
[5] Shor N.Z., Minimization methods for non-differentiable functions, Springer series, Computational mathematics, Berlin, Springer-Verlag, vol. 3, 1985.10.1007/978-3-642-82118-9Search in Google Scholar
[6] Shor N.Z., Nondifferentiable optimization and polynomial problems, Boston, Dordrecht; London, Kluwer Academic Publishers, 1998.10.1007/978-1-4757-6015-6Search in Google Scholar
[7] Stetsyuk P.I., Shor’s r-algorithms: Theory and practice. In: Butenko S., Pardalos P.M., Shylo V. (Eds), Optimization Methods and Applications: In Honor of the 80th Birthday of Ivan V. Sergienko, Springer, 2017, 495-520.Search in Google Scholar
[8] Optimization methods and software, Special Issue “Nonsmooth optimization and related topics, dedicated to the memory of professor Shor N.”, 23 (1), 2008, 3–4, DOI: 10.1080/10556780701652368.10.1080/10556780701652368Search in Google Scholar
[9] Kiseleva E.M., The emergence and formation of the theory of optimal set partitioning for sets of the ndimensional Euclidean space. Theory and application, Journal of Automation and Information Sciences, 50(9), 2018, 1-24, DOI: 10.1615/JAutomatInf-Scien.v50.i9.10.Search in Google Scholar
[10] Kiseleva E.M., Stepanchuk T.F., On the eflciency of a global non-differentiable optimization algorithm based on the method of optimal set partitioning, Journal of Global Optimization, 25, 2003, 209-235.10.1023/A:1021931422223Search in Google Scholar
[11] Kiseleva E.M., Koriashkina L.S., Theory of continuous optimal set partitioning problems as a universal mathematical formalism for constructing voronoi diagrams and their generalizations. II. Algorithms for constructing Voronoi diagrams based on the theory of optimal set partitioning, Cybernetics and Systems Analysis, 51(4), 2015, 489-499, DOI: 10.1007/s10559-015-9740-y.10.1007/s10559-015-9740-ySearch in Google Scholar
[12] Aurenhammer F., Klein R., Lee D.-T., Voronoi diagrams and delaunay triangulations, World Scientific Pub Co Inc, 2013.10.1142/8685Search in Google Scholar
[13] Kiseleva E.M., Lozovskaya L.I., Timoshenko E.V., Solution of continuous problems of optimal covering with spheres using optimal set-partition theory, Cybernetics and Systems Analysis, 45 (3), 2009, 421-437.10.1007/s10559-009-9113-5Search in Google Scholar
[14] Yakovlev S.V., The method of artificial dilation in problems of optimal packing of geometric objects, Cybernetics and Systems Analysis, 53 (5), 2017, 725-731.10.1007/s10559-017-9974-ySearch in Google Scholar
[15] Yakovlev S.V., Formalizing spatial configuration optimization problems with the use of a special function class, Cybernetics and Systems Analysis, 55(4), 2019, 581–589.10.1007/s10559-019-00167-ySearch in Google Scholar
[16] Murat A., Verter V., Laporte G., A continuous analysis framework for the solution of location–allocation problems with dense demand, Computers & Operations Research, 37(1), 2010, 123-136.10.1016/j.cor.2009.04.001Search in Google Scholar
[17] Gol’shtein E.G., Yudin D.B., Objectives of transport-type linear programming, Moscow, Nauka, 1969 (in Russian).Search in Google Scholar
[18] Kiseleva E.M., Prytomanova O.M., Us S.A., Solving a two-stage continuous-discrete optimal partitioning-distribution problem with a given position of the subsets centers, Cybernetics and Systems Analysis, 56(1), 2020, 3–15.10.1007/s10559-020-00215-ySearch in Google Scholar
[19] Stetsyuk P., Lyashko V., Mazyutynets G., Two-stage transportation problem and its AMPL-realization, NAUKMA Research Papers, Computer Science, 1, 2018, 14-20 (in Ukrainian).10.18523/2617-3808.2018.14-20Search in Google Scholar
[20] Drezner Z., Hamacher H.W., Facility location: application and theory, Berlin, Springer, 2001.10.1007/978-3-642-56082-8Search in Google Scholar
[21] Fengqi You, Grossmann I.E., Mixed-integer nonlinear programming models and algorithms for large-scale supply chain design with stochastic inventory management, Industrial and Engineering Chemistry Research, 47(2), 2008, 7802–7817.10.1021/ie800257xSearch in Google Scholar
[22] Gimadi E.Kh. Effective algorithms for solving the multi-stage placement problem on a chain, Discrete Analysis and Operations Research, 2 (4), 1995, 13–31 (in Russian)Search in Google Scholar
[23] Kochetov Yu., Bilevel facility location: discrete models and computational methods, Proceedings of XXXVII Symposium on Operations Research, Tara, Serbia, 2010, 12–16.Search in Google Scholar
© 2020 Elena Kiseleva et al., published by De Gruyter
This work is licensed under the Creative Commons Attribution 4.0 International License.
