On the Algorithm of Cargoes Transportation Scheduling in the Transport Network

On the Algorithm of Cargoes Transportation Scheduling in the Transport Network

The problem of cargoes transportation scheduling in the transport network represented by an undirected multigraph is considered. Transportations between vertices are provided at predefined time intervals. The iterative algorithm to search for a solution approximate to the optimal one by criterion va...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Avtomatika i telemehanika 2023-12 (9), p.135-152
1. Verfasser: Ignatov, A. N.
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 152
container_issue 9
container_start_page 135
container_title Avtomatika i telemehanika
container_volume
creator Ignatov, A. N.
description The problem of cargoes transportation scheduling in the transport network represented by an undirected multigraph is considered. Transportations between vertices are provided at predefined time intervals. The iterative algorithm to search for a solution approximate to the optimal one by criterion value is proposed in the problem under consideration. The algorithm is constructed on the base of solutions of mixed integer linear programming problems. The applicability of the algorithm is tested by the example with more than 90 million binary variables
doi_str_mv 10.31857/S0005231023090088
format Article
fullrecord <record><control><sourceid>crossref</sourceid><recordid>TN_cdi_crossref_primary_10_31857_S0005231023090088</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>10_31857_S0005231023090088</sourcerecordid><originalsourceid>FETCH-LOGICAL-c878-4fc2313f427a58d89fe471c4d09aad21addf85cb286c736f54cc3bf9fb2050c63</originalsourceid><addsrcrecordid>eNplUEtLxDAYDKJgWfcPeMofqH55NelxKb5g2T1s7yXNo612myWpiP9e64oXT8MwD4ZB6JbAHSNKyPsDAAjKCFAGJYBSFyijnLC8lFJeomyR80W_RuuUXmHhBS0LmaHdfsJz7_Bm7EIc5v6Ig8eVjl1wCddRT-kU4qznIUz4YHpn38dh6vBwTv0Z8M7NHyG-3aArr8fk1r-4QvXjQ10959v900u12eZGSZVzb77XMM-p1EJZVXrHJTHcQqm1pURb65UwLVWFkazwghvDWl_6loIAU7AVoudaE0NK0fnmFIejjp8Ngebnk-bfJ-wLmhFUpQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>On the Algorithm of Cargoes Transportation Scheduling in the Transport Network</title><source>Math-Net.Ru (free access)</source><source>DOAJ Directory of Open Access Journals</source><creator>Ignatov, A. N.</creator><creatorcontrib>Ignatov, A. N.</creatorcontrib><description>The problem of cargoes transportation scheduling in the transport network represented by an undirected multigraph is considered. Transportations between vertices are provided at predefined time intervals. The iterative algorithm to search for a solution approximate to the optimal one by criterion value is proposed in the problem under consideration. The algorithm is constructed on the base of solutions of mixed integer linear programming problems. The applicability of the algorithm is tested by the example with more than 90 million binary variables</description><identifier>ISSN: 0005-2310</identifier><identifier>EISSN: 2413-9777</identifier><identifier>DOI: 10.31857/S0005231023090088</identifier><language>eng</language><ispartof>Avtomatika i telemehanika, 2023-12 (9), p.135-152</ispartof><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c878-4fc2313f427a58d89fe471c4d09aad21addf85cb286c736f54cc3bf9fb2050c63</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,777,781,861,27905,27906</link.rule.ids></links><search><creatorcontrib>Ignatov, A. N.</creatorcontrib><title>On the Algorithm of Cargoes Transportation Scheduling in the Transport Network</title><title>Avtomatika i telemehanika</title><description>The problem of cargoes transportation scheduling in the transport network represented by an undirected multigraph is considered. Transportations between vertices are provided at predefined time intervals. The iterative algorithm to search for a solution approximate to the optimal one by criterion value is proposed in the problem under consideration. The algorithm is constructed on the base of solutions of mixed integer linear programming problems. The applicability of the algorithm is tested by the example with more than 90 million binary variables</description><issn>0005-2310</issn><issn>2413-9777</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><recordid>eNplUEtLxDAYDKJgWfcPeMofqH55NelxKb5g2T1s7yXNo612myWpiP9e64oXT8MwD4ZB6JbAHSNKyPsDAAjKCFAGJYBSFyijnLC8lFJeomyR80W_RuuUXmHhBS0LmaHdfsJz7_Bm7EIc5v6Ig8eVjl1wCddRT-kU4qznIUz4YHpn38dh6vBwTv0Z8M7NHyG-3aArr8fk1r-4QvXjQ10959v900u12eZGSZVzb77XMM-p1EJZVXrHJTHcQqm1pURb65UwLVWFkazwghvDWl_6loIAU7AVoudaE0NK0fnmFIejjp8Ngebnk-bfJ-wLmhFUpQ</recordid><startdate>20231215</startdate><enddate>20231215</enddate><creator>Ignatov, A. N.</creator><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>20231215</creationdate><title>On the Algorithm of Cargoes Transportation Scheduling in the Transport Network</title><author>Ignatov, A. N.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c878-4fc2313f427a58d89fe471c4d09aad21addf85cb286c736f54cc3bf9fb2050c63</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Ignatov, A. N.</creatorcontrib><collection>CrossRef</collection><jtitle>Avtomatika i telemehanika</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Ignatov, A. N.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On the Algorithm of Cargoes Transportation Scheduling in the Transport Network</atitle><jtitle>Avtomatika i telemehanika</jtitle><date>2023-12-15</date><risdate>2023</risdate><issue>9</issue><spage>135</spage><epage>152</epage><pages>135-152</pages><issn>0005-2310</issn><eissn>2413-9777</eissn><abstract>The problem of cargoes transportation scheduling in the transport network represented by an undirected multigraph is considered. Transportations between vertices are provided at predefined time intervals. The iterative algorithm to search for a solution approximate to the optimal one by criterion value is proposed in the problem under consideration. The algorithm is constructed on the base of solutions of mixed integer linear programming problems. The applicability of the algorithm is tested by the example with more than 90 million binary variables</abstract><doi>10.31857/S0005231023090088</doi><tpages>18</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0005-2310
ispartof Avtomatika i telemehanika, 2023-12 (9), p.135-152
issn 0005-2310
2413-9777
language eng
recordid cdi_crossref_primary_10_31857_S0005231023090088
source Math-Net.Ru (free access); DOAJ Directory of Open Access Journals
title On the Algorithm of Cargoes Transportation Scheduling in the Transport Network
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-19T17%3A23%3A34IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=On%20the%20Algorithm%20of%20Cargoes%20Transportation%20Scheduling%20in%20the%20Transport%20Network&rft.jtitle=Avtomatika%20i%20telemehanika&rft.au=Ignatov,%20A.%20N.&rft.date=2023-12-15&rft.issue=9&rft.spage=135&rft.epage=152&rft.pages=135-152&rft.issn=0005-2310&rft.eissn=2413-9777&rft_id=info:doi/10.31857/S0005231023090088&rft_dat=%3Ccrossref%3E10_31857_S0005231023090088%3C/crossref%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true