Solving a Two-stage Continuous-discrete Problem of Optimal Partitioning-Allocation with Subsets Centers Placement
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.
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
Solving a Two-stage Continuous-discrete Problem of Optimal Partitioning-Allocation with Subsets Centers Placement ; volume:10 ; number:1 ; year:2020 ; pages:124-136 ; extent:13
Open computer science ; 10, Heft 1 (2020), 124-136 (gesamt 13)
- Urheber
-
Kiseleva, Elena
Prytomanova, Olha
Hart, Liudmyla
- DOI
-
10.1515/comp-2020-0142
- URN
-
urn:nbn:de:101:1-2410301449187.724173002625
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
- 15.08.2025, 05:24 UTC
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Kiseleva, Elena
- Prytomanova, Olha
- Hart, Liudmyla
Ähnliche Objekte (12)
Agent coordination mechanisms for solving a partitioning task
Solving two-stage stochastic network design problems to optimality
Disturbed diffusive processes for solving partitioning problems on graphs
Disturbed diffusive processes for solving partitioning problems on graphs
Solving Two-stage Quadratic Multiobjective Problems via Optimality and Relaxations
Flow-based partitioning and fast global placement in chip design
A particle swarm optimizer for solving the set partitioning problem in the presence of partitioning constraints
Hybrid genetic algorithms for solving constrained packing and placement problems
Synthesis of dataflow graphs for reconfigurable systems using temporal partitioning and temporal placement
Synthesis of dataflow graphs for reconfigurable systems using temporal partitioning and temporal placement
Solving two-stage stochastic route-planning problem in milliseconds via end-to-end deep learning
A GRASP algorithm with Tabu Search improvement for solving the maximum intersection of k-subsets problem
Agent coordination mechanisms for solving a partitioning task
Solving two-stage stochastic network design problems to optimality
Disturbed diffusive processes for solving partitioning problems on graphs
Disturbed diffusive processes for solving partitioning problems on graphs
Solving Two-stage Quadratic Multiobjective Problems via Optimality and Relaxations
Flow-based partitioning and fast global placement in chip design
A particle swarm optimizer for solving the set partitioning problem in the presence of partitioning constraints
Hybrid genetic algorithms for solving constrained packing and placement problems
Synthesis of dataflow graphs for reconfigurable systems using temporal partitioning and temporal placement
Synthesis of dataflow graphs for reconfigurable systems using temporal partitioning and temporal placement
Solving two-stage stochastic route-planning problem in milliseconds via end-to-end deep learning
A GRASP algorithm with Tabu Search improvement for solving the maximum intersection of k-subsets problem
Agent coordination mechanisms for solving a partitioning task
Solving two-stage stochastic network design problems to optimality
Disturbed diffusive processes for solving partitioning problems on graphs
Disturbed diffusive processes for solving partitioning problems on graphs
Solving Two-stage Quadratic Multiobjective Problems via Optimality and Relaxations
Flow-based partitioning and fast global placement in chip design
A particle swarm optimizer for solving the set partitioning problem in the presence of partitioning constraints
Hybrid genetic algorithms for solving constrained packing and placement problems
Synthesis of dataflow graphs for reconfigurable systems using temporal partitioning and temporal placement
Synthesis of dataflow graphs for reconfigurable systems using temporal partitioning and temporal placement
Solving two-stage stochastic route-planning problem in milliseconds via end-to-end deep learning