?
Heuristic for Maximizing Grouping Efficiency in the Cell Formation Problem
P. 11–26.
In our paper, we consider the Cell Formation Problem in Group Technology with grouping efficiency as an objective function. We present a heuristic approach for obtaining high-quality solutions of the CFP. The suggested heuristic applies an improvement procedure to obtain solutions with high grouping efficiency. This procedure is repeated many times for randomly generated cell configurations. Our computational experiments are performed for popular benchmark instances taken from the literature with sizes from 10×20 to 50×150. Better solutions unknown before are found for 23 instances of the 24 considered. The preliminary results for this paper are available in Bychkov et al. (Models, algorithms, and technologies for network analysis, Springer, NY, vol. 59, pp. 43–69, 2013, [7]).
In book
Vol. 197. , Springer, 2017.
Martinez-Saito M., Algorithms 2025 Vol. 18 No. 12 Article 741
Detecting trajectories of hierarchical structures in a dynamical system of multiple interacting particles is an open problem that is typically addressed by imposing strong constraints on the structures to be found. Here, we describe BUNCH, a dynamical filtering algorithm that can efficiently and on-the-fly fit dynamical trajectories of multiple particles to a tree structure of ...
Added: December 1, 2025
Sulimov P., Kertesz-Farkas A., Journal of Proteome Research 2020 No. 19(4) P. 1481–1490
Peptide-spectrum-match (PSM) scores used in database searching are calibrated to spectrum- or spectrum-peptide-specific null distributions. Some calibration methods rely on specific assumptions and use analytical models (e.g., binomial distributions), whereas other methods utilize exact empirical null distributions. The former may be inaccurate because of unjustified assumptions, while the latter are accurate, albeit computationally exhaustive. Here, ...
Added: June 29, 2020
Irina Utkina, Mikhail Batsyn, Ekaterina Batsyna, , in: Discrete Optimization and Operations Research/9th International Conference, DOOR 2016, Vladivostok, Russia, September 19-23, 2016, Proceedings.: Springer, 2016. P. 244–255.
We consider a fractional 0-1 programming problem arising in manufacturing. The problem consists in clustering of machines together with parts processed on these machines into manufacturing cells so that intra-cell processing of parts is maximized and inter-cell movement is minimized. This problem is called Cell Formation Problem (CFP) and it is an NP-hard optimization problem ...
Added: October 3, 2018
Toporkov V., Yemelyanov D., Anna Toporkova, , in: PROCEEDINGS 46th International Conference on Parallel Processing Workshops ICPPW 2017.: Piscataway: IEEE Computer Society, 2017. P. 271–280.
In this work, a job-flow scheduling approach for Grid virtual organizations (VOs) is proposed and studied. Users’ and resource providers’ preferences, VOs internal policies, resources geographical distribution along with local private utilization impose specific requirements for efficient scheduling according to different, usually contradictive, criteria. With increasing resources utilization level the available resources set and corresponding ...
Added: January 30, 2018
Toporkov V., Yemelyanov D., Anna Toporkova, , in: Supercomputing. RuSCDays 2017. Communications in Computer and Information Science. Revised Selected Papers.Vol. 793.: Springer, 2017. P. 482–493.
In this work, a job-flow scheduling approach for grid virtual organizations (VOs) is proposed and studied. Users’ and resource providers’ preferences, VOs internal policies, resources geographical distribution along with local private utilization impose specific requirements for efficient scheduling according to different, usually contradictive, criteria. With increasing level of resources utilization, the set of available resources ...
Added: January 30, 2018
Toporkov V., Yemelyanov D., Anna Toporkova et al., , in: Parallel Computing Technologies. 14th International Conference, PaCT 2017, Nizhny Novgorod, Russia, September 4-8, 2017, ProceedingsVol. 10421: Lecture Notes in Computer Science .: Cham, Switzerland: Springer, 2017. P. 372–383.
In this work, a job-flow scheduling approach for Grid virtual organizations (VOs) is proposed and studied. Users’ and resource providers’ preferences, VOs internal policies, resources geographical distribution along with local private utilization impose specific requirements for efficient scheduling according to different, usually contradictive, criteria. With increasing resources utilization level the available resources set and corresponding ...
Added: January 26, 2018
Baibikova T., В кн.: Актуальные проблемы развития речи и межкультурной коммуникации. Сборник материалов IX Кирилло-Мефодиевских чтений в Международном гуманитарно-лингвистическом институте 17 мая 2016 года.: М.: МФЮА, 2016. С. 109–113.
В статье рассматриваются концепты «когнитология» и «эвристика», которые являются неотъемлемой частью когнитивно-эвристической модели перевода. Обосновывается применимость данных понятий к такой отрасли человеческих знаний, как перевод и переводоведение. ...
Added: March 9, 2017
Toporkov V., Anna Toporkova, Tselishchev A. et al., , in: Intelligent Distributed Computing IX. Proceedings of the 9th International Symposium on Intelligent Distributed Computing – IDC'2015, Guimarães, Portugal, October 2015Vol. 616: Studies in Computational Intelligence.: Dordrecht, L., Cham, Heidelberg, NY: Springer, 2016. P. 189–198.
In this paper, we propose a meta-data based approach for a deliberate job flow distribution in computing environments, such as utility Grids. Under condi- tions of a heterogeneous job flow composition and a variety of resource domains, we examine how different job and resource characteristics affect the efficiency of the scheduling process. Based on the ...
Added: July 13, 2016
Komosko L. F., Batsyn M. V., Информационные технологии 2015 № 7 С. 488–494
Graph coloring problem is one of the classical combinatorial optimization problems. This problem consists in finding the minimal number of colors in which it is possible to color vertices of a graph so that any two adjacent vertices are colored in different colors. The graph coloring problem has a wide variety of applications including timetabling ...
Added: July 13, 2015
Larisa Komosko, Mikhail Batsyn, Pablo San Segundo . et al., Journal of Combinatorial Optimization 2016 No. 4 P. 1665–1677
In this paper a fast greedy sequential heuristic for the vertex colouring problem is presented. The suggested algorithm builds the same colouring of the graph as the well-known greedy sequential heuristic in which on every step the current vertex is coloured in the minimum possible colour. Our main contributions include introduction of a special matrix ...
Added: July 13, 2015
Mirkin B., Optimization Letters 2014
A review of the book in two perspectives: engineering design and data analysis. ...
Added: March 11, 2015
Pei J., Pardalos P. M., Liu X. et al., European Journal of Operational Research 2015 Vol. 224 No. 1 P. 13–25
This paper investigates the coordinated scheduling problem of production and transportation in a two-stage supply chain, where the actual job processing time is a linear function of its starting time. During the production stage the jobs are first processed in serial batches on a bounded serial batching machine at the manufacturer's site. Then, the batches ...
Added: December 4, 2014
Бацын М.В., Пономаренко А.А., В кн.: Труды 38-й конференции "Информационные технологии и системы - 2014".: Н. Новгород: ИППИ РАН, 2014. С. 440–449.
В работе предложена итеративная жадная эвристика для задачи маршрутизации тягачей с прицепами, возникающей в реальной практике доставки товаров в магазины. Рассматриваемая задача включает такие особенности, как: ограничения каждого магазина на автомобили, которые могут осуществлять доставку; автомобили разного формата и грузоподъемности; наличие прицепа у каждого автомобиля; возможность разбиения доставки для одного магазина на два и более ...
Added: September 18, 2014
Ilya Bychkov, Mikhail Batsyn, Pavel Sukhov, , in: Models, Algorithms, and Technologies for Network AnalysisVol. 59.: NY: Springer, 2013. Ch. 4 P. 43–69.
In this chapter, we introduce a new heuristic for Cell Formation Problem in its most general formulation with grouping efficiency as an objective function. Suggested approach applies an improvement procedure to obtain solutions with high grouping efficiency. This procedure is repeated until efficiency can be increased for randomly generated configurations of cells. We consider our ...
Added: November 19, 2013
Mikhail Batsyn, Ilya Bychkov, Boris Goldengorin et al., , in: Models, Algorithms, and Technologies for Network AnalysisIssue 32.: NY: Springer, 2013. Ch. 2 P. 11–50.
In this paper we introduce a new pattern-based approach within the Linear Assignment Model with the purpose to design heuristics for a combinatorial optimization problem (COP). We assume that the COP has an additive (separable) objective function and the structure of a feasible (optimal) solution to the COP is predefined by a collection of cells ...
Added: November 19, 2013
Goldengorin B. I., Krushinsky D., Slomp J., Operations Research 2012 Vol. 60 No. 5 P. 1526–5463
Lately, the problem of cell formation (CF) has gained a lot of attention in the industrial engineering literature. Since it was formulated (more than 50 years ago), the problem has incorporated additional industrial factors and constraints while its solution methods have been constantly improving in terms of the solution quality and CPU times. However, despite ...
Added: November 13, 2012
Krushinsky D., Goldengorin B. I., Computational Management Science 2012 Vol. 9 No. 2 P. 323–338
Despite the long history of the cell formation problem (CF) and availability of dozens of approaches, very few of them explicitly optimize the objective of cell formation. These scarce approaches usually lead to intractable formulations that can be solved only heuristically for practical instances. In contrast, we show that CF can be explicitly modelled via ...
Added: August 13, 2012