Optimal location and grouping of forces against spontaneous dynamic processes with Pseudo-Boolean optimization algorithms

We propose an algorithm based on the varying probabilities method and agent model for solving problems of optimal location of the agents (forces) counteracting the spread of natural spontaneous dynamic processes, calculation of optimal localization trajectories and grouping (clustering) of such agen...

Full description

Saved in:
Bibliographic Details
Published in:IOP conference series. Materials Science and Engineering 2019-05, Vol.537 (6), p.62038
Main Authors: Yarovoy, S V, Dorrer, G A, Shaporova, Z E, Kazakovtsev, L A
Format: Article
Language:English
Subjects:
Algorithms
Boolean algebra
Clustering
Trajectory optimization
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites cdi_FETCH-LOGICAL-c354t-4428553b991279ea3878d45eb5bcb4f66baf3509359d88ee676cc0922617269d3
container_end_page
container_issue 6
container_start_page 62038
container_title IOP conference series. Materials Science and Engineering
container_volume 537
creator Yarovoy, S V
Dorrer, G A
Shaporova, Z E
Kazakovtsev, L A
description We propose an algorithm based on the varying probabilities method and agent model for solving problems of optimal location of the agents (forces) counteracting the spread of natural spontaneous dynamic processes, calculation of optimal localization trajectories and grouping (clustering) of such agents by localizable processes.
doi_str_mv 10.1088/1757-899X/537/6/062038
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2561081313</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2561081313</sourcerecordid><originalsourceid>FETCH-LOGICAL-c354t-4428553b991279ea3878d45eb5bcb4f66baf3509359d88ee676cc0922617269d3</originalsourceid><addsrcrecordid>eNqFkF1LwzAUhosoOKd_QQLeeFObNM3XpY75AZMJKngX0jadHV1SkxaZv96UjokgeHUOnOe85_BE0TmCVwhyniBGWMyFeEsIZglNIE0h5gfRZD843PccHUcn3q8hpCzL4CTaLtuu3qgGNLZQXW0NUKYEK2f7tjYrYCtQWVdoD9RK1cZ3wLfWdMpo23tQbo3a1AVonQ2ID9Rn3b2DJ6_70sY31jZaGWCHC_XXLr1ZWRegjT-NjirVeH22q9Po9Xb-MruPF8u7h9n1Ii4wybo4y1JOCM6FQCkTWmHOeJkRnZO8yLOK0lxVmECBiSg515oyWhRQpClFLKWixNPoYswNX3702ndybXtnwkmZEhoMIoxwoOhIFc5673QlWxe8uK1EUA6a5WBQDjZl0CypHDWHxctxsbbtT_Lj8_wXJtuyCmj6B_pP_jeZ248K</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2561081313</pqid></control><display><type>article</type><title>Optimal location and grouping of forces against spontaneous dynamic processes with Pseudo-Boolean optimization algorithms</title><source>Publicly Available Content Database</source><source>Full-Text Journals in Chemistry (Open access)</source><creator>Yarovoy, S V ; Dorrer, G A ; Shaporova, Z E ; Kazakovtsev, L A</creator><creatorcontrib>Yarovoy, S V ; Dorrer, G A ; Shaporova, Z E ; Kazakovtsev, L A</creatorcontrib><description>We propose an algorithm based on the varying probabilities method and agent model for solving problems of optimal location of the agents (forces) counteracting the spread of natural spontaneous dynamic processes, calculation of optimal localization trajectories and grouping (clustering) of such agents by localizable processes.</description><identifier>ISSN: 1757-8981</identifier><identifier>EISSN: 1757-899X</identifier><identifier>DOI: 10.1088/1757-899X/537/6/062038</identifier><language>eng</language><publisher>Bristol: IOP Publishing</publisher><subject>Algorithms ; Boolean algebra ; Clustering ; Trajectory optimization</subject><ispartof>IOP conference series. Materials Science and Engineering, 2019-05, Vol.537 (6), p.62038</ispartof><rights>Published under licence by IOP Publishing Ltd</rights><rights>2019. This work is published under http://creativecommons.org/licenses/by/3.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c354t-4428553b991279ea3878d45eb5bcb4f66baf3509359d88ee676cc0922617269d3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.proquest.com/docview/2561081313?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>314,780,784,25753,27924,27925,37012,44590</link.rule.ids></links><search><creatorcontrib>Yarovoy, S V</creatorcontrib><creatorcontrib>Dorrer, G A</creatorcontrib><creatorcontrib>Shaporova, Z E</creatorcontrib><creatorcontrib>Kazakovtsev, L A</creatorcontrib><title>Optimal location and grouping of forces against spontaneous dynamic processes with Pseudo-Boolean optimization algorithms</title><title>IOP conference series. Materials Science and Engineering</title><addtitle>IOP Conf. Ser.: Mater. Sci. Eng</addtitle><description>We propose an algorithm based on the varying probabilities method and agent model for solving problems of optimal location of the agents (forces) counteracting the spread of natural spontaneous dynamic processes, calculation of optimal localization trajectories and grouping (clustering) of such agents by localizable processes.</description><subject>Algorithms</subject><subject>Boolean algebra</subject><subject>Clustering</subject><subject>Trajectory optimization</subject><issn>1757-8981</issn><issn>1757-899X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><recordid>eNqFkF1LwzAUhosoOKd_QQLeeFObNM3XpY75AZMJKngX0jadHV1SkxaZv96UjokgeHUOnOe85_BE0TmCVwhyniBGWMyFeEsIZglNIE0h5gfRZD843PccHUcn3q8hpCzL4CTaLtuu3qgGNLZQXW0NUKYEK2f7tjYrYCtQWVdoD9RK1cZ3wLfWdMpo23tQbo3a1AVonQ2ID9Rn3b2DJ6_70sY31jZaGWCHC_XXLr1ZWRegjT-NjirVeH22q9Po9Xb-MruPF8u7h9n1Ii4wybo4y1JOCM6FQCkTWmHOeJkRnZO8yLOK0lxVmECBiSg515oyWhRQpClFLKWixNPoYswNX3702ndybXtnwkmZEhoMIoxwoOhIFc5673QlWxe8uK1EUA6a5WBQDjZl0CypHDWHxctxsbbtT_Lj8_wXJtuyCmj6B_pP_jeZ248K</recordid><startdate>20190501</startdate><enddate>20190501</enddate><creator>Yarovoy, S V</creator><creator>Dorrer, G A</creator><creator>Shaporova, Z E</creator><creator>Kazakovtsev, L A</creator><general>IOP Publishing</general><scope>O3W</scope><scope>TSCCA</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>D1I</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>KB.</scope><scope>L6V</scope><scope>M7S</scope><scope>PDBOC</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20190501</creationdate><title>Optimal location and grouping of forces against spontaneous dynamic processes with Pseudo-Boolean optimization algorithms</title><author>Yarovoy, S V ; Dorrer, G A ; Shaporova, Z E ; Kazakovtsev, L A</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c354t-4428553b991279ea3878d45eb5bcb4f66baf3509359d88ee676cc0922617269d3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Algorithms</topic><topic>Boolean algebra</topic><topic>Clustering</topic><topic>Trajectory optimization</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Yarovoy, S V</creatorcontrib><creatorcontrib>Dorrer, G A</creatorcontrib><creatorcontrib>Shaporova, Z E</creatorcontrib><creatorcontrib>Kazakovtsev, L A</creatorcontrib><collection>IOP_英国物理学会OA刊</collection><collection>IOPscience (Open Access)</collection><collection>CrossRef</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>ProQuest Central Essentials</collection><collection>AUTh Library subscriptions: ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Materials Science Collection</collection><collection>ProQuest Central</collection><collection>SciTech Premium Collection</collection><collection>https://resources.nclive.org/materials</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Materials Science Collection</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><jtitle>IOP conference series. Materials Science and Engineering</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Yarovoy, S V</au><au>Dorrer, G A</au><au>Shaporova, Z E</au><au>Kazakovtsev, L A</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Optimal location and grouping of forces against spontaneous dynamic processes with Pseudo-Boolean optimization algorithms</atitle><jtitle>IOP conference series. Materials Science and Engineering</jtitle><addtitle>IOP Conf. Ser.: Mater. Sci. Eng</addtitle><date>2019-05-01</date><risdate>2019</risdate><volume>537</volume><issue>6</issue><spage>62038</spage><pages>62038-</pages><issn>1757-8981</issn><eissn>1757-899X</eissn><abstract>We propose an algorithm based on the varying probabilities method and agent model for solving problems of optimal location of the agents (forces) counteracting the spread of natural spontaneous dynamic processes, calculation of optimal localization trajectories and grouping (clustering) of such agents by localizable processes.</abstract><cop>Bristol</cop><pub>IOP Publishing</pub><doi>10.1088/1757-899X/537/6/062038</doi><tpages>6</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 1757-8981
ispartof IOP conference series. Materials Science and Engineering, 2019-05, Vol.537 (6), p.62038
issn 1757-8981
1757-899X
language eng
recordid cdi_proquest_journals_2561081313
source Publicly Available Content Database; Full-Text Journals in Chemistry (Open access)
subjects Algorithms
Boolean algebra
Clustering
Trajectory optimization
title Optimal location and grouping of forces against spontaneous dynamic processes with Pseudo-Boolean optimization algorithms
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-06T00%3A05%3A33IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Optimal%20location%20and%20grouping%20of%20forces%20against%20spontaneous%20dynamic%20processes%20with%20Pseudo-Boolean%20optimization%20algorithms&rft.jtitle=IOP%20conference%20series.%20Materials%20Science%20and%20Engineering&rft.au=Yarovoy,%20S%20V&rft.date=2019-05-01&rft.volume=537&rft.issue=6&rft.spage=62038&rft.pages=62038-&rft.issn=1757-8981&rft.eissn=1757-899X&rft_id=info:doi/10.1088/1757-899X/537/6/062038&rft_dat=%3Cproquest_cross%3E2561081313%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c354t-4428553b991279ea3878d45eb5bcb4f66baf3509359d88ee676cc0922617269d3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2561081313&rft_id=info:pmid/&rfr_iscdi=true