Speed-up of Self-Organizing Networks for Routing Problems in a Polygonal Domain Article Swipe
Miroslav Kulich
,
Roman Sushkov
,
Libor Přeučil
·
YOU?
·
· 2017
· Open Access
·
· DOI: https://doi.org/10.48550/arxiv.1707.09809
YOU?
·
· 2017
· Open Access
·
· DOI: https://doi.org/10.48550/arxiv.1707.09809
Routing problems are optimization problems that consider a set of goals in a graph to be visited by a vehicle (or a fleet of them) in an optimal way, while numerous constraints have to be satisfied. We present a solution based on multidimensional scaling which significantly reduces computational time of a self-organizing neural network solving a typical routing problem -- the Travelling Salesman Problem (TSP) in a polygonal domain, i.e. in a space where obstacles are represented by polygons. The preliminary results show feasibility of the proposed approach and although the results are presented only for TSP, the method is general so it can be used also for other variants of routing problems.
Related Topics
Concepts
Travelling salesman problem
Routing (electronic design automation)
Computer science
Vehicle routing problem
Mathematical optimization
Domain (mathematical analysis)
2-opt
Set (abstract data type)
Space (punctuation)
Mathematics
Algorithm
Computer network
Programming language
Operating system
Mathematical analysis
Metadata
- Type
- preprint
- Language
- en
- Landing Page
- http://arxiv.org/abs/1707.09809
- https://arxiv.org/pdf/1707.09809
- OA Status
- green
- Cited By
- 1
- References
- 4
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W2739638682
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W2739638682Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.48550/arxiv.1707.09809Digital Object Identifier
- Title
-
Speed-up of Self-Organizing Networks for Routing Problems in a Polygonal DomainWork title
- Type
-
preprintOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2017Year of publication
- Publication date
-
2017-07-31Full publication date if available
- Authors
-
Miroslav Kulich, Roman Sushkov, Libor PřeučilList of authors in order
- Landing page
-
https://arxiv.org/abs/1707.09809Publisher landing page
- PDF URL
-
https://arxiv.org/pdf/1707.09809Direct link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
greenOpen access status per OpenAlex
- OA URL
-
https://arxiv.org/pdf/1707.09809Direct OA link when available
- Concepts
-
Travelling salesman problem, Routing (electronic design automation), Computer science, Vehicle routing problem, Mathematical optimization, Domain (mathematical analysis), 2-opt, Set (abstract data type), Space (punctuation), Mathematics, Algorithm, Computer network, Programming language, Operating system, Mathematical analysisTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
1Total citation count in OpenAlex
- Citations by year (recent)
-
2017: 1Per-year citation counts (last 5 years)
- References (count)
-
4Number of works referenced by this work
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W2739638682 |
|---|---|
| doi | https://doi.org/10.48550/arxiv.1707.09809 |
| ids.doi | https://doi.org/10.48550/arxiv.1707.09809 |
| ids.mag | 2739638682 |
| ids.openalex | https://openalex.org/W2739638682 |
| fwci | |
| type | preprint |
| title | Speed-up of Self-Organizing Networks for Routing Problems in a Polygonal Domain |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | |
| biblio.first_page | |
| topics[0].id | https://openalex.org/T10567 |
| topics[0].field.id | https://openalex.org/fields/22 |
| topics[0].field.display_name | Engineering |
| topics[0].score | 0.9968000054359436 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/2209 |
| topics[0].subfield.display_name | Industrial and Manufacturing Engineering |
| topics[0].display_name | Vehicle Routing Optimization Methods |
| topics[1].id | https://openalex.org/T10586 |
| topics[1].field.id | https://openalex.org/fields/17 |
| topics[1].field.display_name | Computer Science |
| topics[1].score | 0.9941999912261963 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/1707 |
| topics[1].subfield.display_name | Computer Vision and Pattern Recognition |
| topics[1].display_name | Robotic Path Planning Algorithms |
| topics[2].id | https://openalex.org/T10100 |
| topics[2].field.id | https://openalex.org/fields/17 |
| topics[2].field.display_name | Computer Science |
| topics[2].score | 0.9937999844551086 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/1702 |
| topics[2].subfield.display_name | Artificial Intelligence |
| topics[2].display_name | Metaheuristic Optimization Algorithms Research |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C175859090 |
| concepts[0].level | 2 |
| concepts[0].score | 0.7829878926277161 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q322212 |
| concepts[0].display_name | Travelling salesman problem |
| concepts[1].id | https://openalex.org/C74172769 |
| concepts[1].level | 2 |
| concepts[1].score | 0.6417142152786255 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q1446839 |
| concepts[1].display_name | Routing (electronic design automation) |
| concepts[2].id | https://openalex.org/C41008148 |
| concepts[2].level | 0 |
| concepts[2].score | 0.6115532517433167 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[2].display_name | Computer science |
| concepts[3].id | https://openalex.org/C123784306 |
| concepts[3].level | 3 |
| concepts[3].score | 0.5893762111663818 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q944041 |
| concepts[3].display_name | Vehicle routing problem |
| concepts[4].id | https://openalex.org/C126255220 |
| concepts[4].level | 1 |
| concepts[4].score | 0.548680305480957 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q141495 |
| concepts[4].display_name | Mathematical optimization |
| concepts[5].id | https://openalex.org/C36503486 |
| concepts[5].level | 2 |
| concepts[5].score | 0.5381063222885132 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q11235244 |
| concepts[5].display_name | Domain (mathematical analysis) |
| concepts[6].id | https://openalex.org/C106472803 |
| concepts[6].level | 3 |
| concepts[6].score | 0.43640294671058655 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q291440 |
| concepts[6].display_name | 2-opt |
| concepts[7].id | https://openalex.org/C177264268 |
| concepts[7].level | 2 |
| concepts[7].score | 0.4360084533691406 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q1514741 |
| concepts[7].display_name | Set (abstract data type) |
| concepts[8].id | https://openalex.org/C2778572836 |
| concepts[8].level | 2 |
| concepts[8].score | 0.4358536899089813 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q380933 |
| concepts[8].display_name | Space (punctuation) |
| concepts[9].id | https://openalex.org/C33923547 |
| concepts[9].level | 0 |
| concepts[9].score | 0.26459676027297974 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[9].display_name | Mathematics |
| concepts[10].id | https://openalex.org/C11413529 |
| concepts[10].level | 1 |
| concepts[10].score | 0.20909959077835083 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q8366 |
| concepts[10].display_name | Algorithm |
| concepts[11].id | https://openalex.org/C31258907 |
| concepts[11].level | 1 |
| concepts[11].score | 0.08200806379318237 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q1301371 |
| concepts[11].display_name | Computer network |
| concepts[12].id | https://openalex.org/C199360897 |
| concepts[12].level | 1 |
| concepts[12].score | 0.0 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q9143 |
| concepts[12].display_name | Programming language |
| concepts[13].id | https://openalex.org/C111919701 |
| concepts[13].level | 1 |
| concepts[13].score | 0.0 |
| concepts[13].wikidata | https://www.wikidata.org/wiki/Q9135 |
| concepts[13].display_name | Operating system |
| concepts[14].id | https://openalex.org/C134306372 |
| concepts[14].level | 1 |
| concepts[14].score | 0.0 |
| concepts[14].wikidata | https://www.wikidata.org/wiki/Q7754 |
| concepts[14].display_name | Mathematical analysis |
| keywords[0].id | https://openalex.org/keywords/travelling-salesman-problem |
| keywords[0].score | 0.7829878926277161 |
| keywords[0].display_name | Travelling salesman problem |
| keywords[1].id | https://openalex.org/keywords/routing |
| keywords[1].score | 0.6417142152786255 |
| keywords[1].display_name | Routing (electronic design automation) |
| keywords[2].id | https://openalex.org/keywords/computer-science |
| keywords[2].score | 0.6115532517433167 |
| keywords[2].display_name | Computer science |
| keywords[3].id | https://openalex.org/keywords/vehicle-routing-problem |
| keywords[3].score | 0.5893762111663818 |
| keywords[3].display_name | Vehicle routing problem |
| keywords[4].id | https://openalex.org/keywords/mathematical-optimization |
| keywords[4].score | 0.548680305480957 |
| keywords[4].display_name | Mathematical optimization |
| keywords[5].id | https://openalex.org/keywords/domain |
| keywords[5].score | 0.5381063222885132 |
| keywords[5].display_name | Domain (mathematical analysis) |
| keywords[6].id | https://openalex.org/keywords/2-opt |
| keywords[6].score | 0.43640294671058655 |
| keywords[6].display_name | 2-opt |
| keywords[7].id | https://openalex.org/keywords/set |
| keywords[7].score | 0.4360084533691406 |
| keywords[7].display_name | Set (abstract data type) |
| keywords[8].id | https://openalex.org/keywords/space |
| keywords[8].score | 0.4358536899089813 |
| keywords[8].display_name | Space (punctuation) |
| keywords[9].id | https://openalex.org/keywords/mathematics |
| keywords[9].score | 0.26459676027297974 |
| keywords[9].display_name | Mathematics |
| keywords[10].id | https://openalex.org/keywords/algorithm |
| keywords[10].score | 0.20909959077835083 |
| keywords[10].display_name | Algorithm |
| keywords[11].id | https://openalex.org/keywords/computer-network |
| keywords[11].score | 0.08200806379318237 |
| keywords[11].display_name | Computer network |
| language | en |
| locations[0].id | pmh:oai:arXiv.org:1707.09809 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S4306400194 |
| locations[0].source.issn | |
| locations[0].source.type | repository |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | |
| locations[0].source.is_core | False |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | arXiv (Cornell University) |
| locations[0].source.host_organization | https://openalex.org/I205783295 |
| locations[0].source.host_organization_name | Cornell University |
| locations[0].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[0].license | |
| locations[0].pdf_url | https://arxiv.org/pdf/1707.09809 |
| locations[0].version | submittedVersion |
| locations[0].raw_type | text |
| locations[0].license_id | |
| locations[0].is_accepted | False |
| locations[0].is_published | False |
| locations[0].raw_source_name | |
| locations[0].landing_page_url | http://arxiv.org/abs/1707.09809 |
| locations[1].id | doi:10.48550/arxiv.1707.09809 |
| locations[1].is_oa | True |
| locations[1].source.id | https://openalex.org/S4306400194 |
| locations[1].source.issn | |
| locations[1].source.type | repository |
| locations[1].source.is_oa | True |
| locations[1].source.issn_l | |
| locations[1].source.is_core | False |
| locations[1].source.is_in_doaj | False |
| locations[1].source.display_name | arXiv (Cornell University) |
| locations[1].source.host_organization | https://openalex.org/I205783295 |
| locations[1].source.host_organization_name | Cornell University |
| locations[1].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[1].license | |
| locations[1].pdf_url | |
| locations[1].version | |
| locations[1].raw_type | article |
| locations[1].license_id | |
| locations[1].is_accepted | False |
| locations[1].is_published | |
| locations[1].raw_source_name | |
| locations[1].landing_page_url | https://doi.org/10.48550/arxiv.1707.09809 |
| indexed_in | arxiv, datacite |
| authorships[0].author.id | https://openalex.org/A5084228715 |
| authorships[0].author.orcid | https://orcid.org/0000-0002-0997-5889 |
| authorships[0].author.display_name | Miroslav Kulich |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Miroslav Kulich |
| authorships[0].is_corresponding | False |
| authorships[1].author.id | https://openalex.org/A5003696395 |
| authorships[1].author.orcid | |
| authorships[1].author.display_name | Roman Sushkov |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Roman Sushkov |
| authorships[1].is_corresponding | False |
| authorships[2].author.id | https://openalex.org/A5004686576 |
| authorships[2].author.orcid | https://orcid.org/0000-0002-4286-3870 |
| authorships[2].author.display_name | Libor Přeučil |
| authorships[2].author_position | last |
| authorships[2].raw_author_name | Libor Preucil |
| authorships[2].is_corresponding | False |
| has_content.pdf | False |
| has_content.grobid_xml | False |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://arxiv.org/pdf/1707.09809 |
| open_access.oa_status | green |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Speed-up of Self-Organizing Networks for Routing Problems in a Polygonal Domain |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-06T06:51:31.235846 |
| primary_topic.id | https://openalex.org/T10567 |
| primary_topic.field.id | https://openalex.org/fields/22 |
| primary_topic.field.display_name | Engineering |
| primary_topic.score | 0.9968000054359436 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/2209 |
| primary_topic.subfield.display_name | Industrial and Manufacturing Engineering |
| primary_topic.display_name | Vehicle Routing Optimization Methods |
| related_works | https://openalex.org/W4389782626, https://openalex.org/W2359992618, https://openalex.org/W4376138746, https://openalex.org/W2171568915, https://openalex.org/W2361554335, https://openalex.org/W1595757466, https://openalex.org/W2362402143, https://openalex.org/W2073288620, https://openalex.org/W2356976268, https://openalex.org/W2334181621 |
| cited_by_count | 1 |
| counts_by_year[0].year | 2017 |
| counts_by_year[0].cited_by_count | 1 |
| locations_count | 2 |
| best_oa_location.id | pmh:oai:arXiv.org:1707.09809 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4306400194 |
| best_oa_location.source.issn | |
| best_oa_location.source.type | repository |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | |
| best_oa_location.source.is_core | False |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | arXiv (Cornell University) |
| best_oa_location.source.host_organization | https://openalex.org/I205783295 |
| best_oa_location.source.host_organization_name | Cornell University |
| best_oa_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| best_oa_location.license | |
| best_oa_location.pdf_url | https://arxiv.org/pdf/1707.09809 |
| best_oa_location.version | submittedVersion |
| best_oa_location.raw_type | text |
| best_oa_location.license_id | |
| best_oa_location.is_accepted | False |
| best_oa_location.is_published | False |
| best_oa_location.raw_source_name | |
| best_oa_location.landing_page_url | http://arxiv.org/abs/1707.09809 |
| primary_location.id | pmh:oai:arXiv.org:1707.09809 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S4306400194 |
| primary_location.source.issn | |
| primary_location.source.type | repository |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | |
| primary_location.source.is_core | False |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | arXiv (Cornell University) |
| primary_location.source.host_organization | https://openalex.org/I205783295 |
| primary_location.source.host_organization_name | Cornell University |
| primary_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| primary_location.license | |
| primary_location.pdf_url | https://arxiv.org/pdf/1707.09809 |
| primary_location.version | submittedVersion |
| primary_location.raw_type | text |
| primary_location.license_id | |
| primary_location.is_accepted | False |
| primary_location.is_published | False |
| primary_location.raw_source_name | |
| primary_location.landing_page_url | http://arxiv.org/abs/1707.09809 |
| publication_date | 2017-07-31 |
| publication_year | 2017 |
| referenced_works | https://openalex.org/W3099839986, https://openalex.org/W2082647601, https://openalex.org/W2143814744, https://openalex.org/W2046837279 |
| referenced_works_count | 4 |
| abstract_inverted_index.a | 7, 12, 18, 21, 38, 50, 55, 66, 71 |
| abstract_inverted_index.-- | 59 |
| abstract_inverted_index.We | 36 |
| abstract_inverted_index.an | 26 |
| abstract_inverted_index.be | 15, 34, 104 |
| abstract_inverted_index.by | 17, 77 |
| abstract_inverted_index.in | 11, 25, 65, 70 |
| abstract_inverted_index.is | 99 |
| abstract_inverted_index.it | 102 |
| abstract_inverted_index.of | 9, 23, 49, 84, 110 |
| abstract_inverted_index.on | 41 |
| abstract_inverted_index.so | 101 |
| abstract_inverted_index.to | 14, 33 |
| abstract_inverted_index.(or | 20 |
| abstract_inverted_index.The | 79 |
| abstract_inverted_index.and | 88 |
| abstract_inverted_index.are | 2, 75, 92 |
| abstract_inverted_index.can | 103 |
| abstract_inverted_index.for | 95, 107 |
| abstract_inverted_index.set | 8 |
| abstract_inverted_index.the | 60, 85, 90, 97 |
| abstract_inverted_index.TSP, | 96 |
| abstract_inverted_index.also | 106 |
| abstract_inverted_index.have | 32 |
| abstract_inverted_index.i.e. | 69 |
| abstract_inverted_index.only | 94 |
| abstract_inverted_index.show | 82 |
| abstract_inverted_index.that | 5 |
| abstract_inverted_index.time | 48 |
| abstract_inverted_index.used | 105 |
| abstract_inverted_index.way, | 28 |
| abstract_inverted_index.(TSP) | 64 |
| abstract_inverted_index.based | 40 |
| abstract_inverted_index.fleet | 22 |
| abstract_inverted_index.goals | 10 |
| abstract_inverted_index.graph | 13 |
| abstract_inverted_index.other | 108 |
| abstract_inverted_index.space | 72 |
| abstract_inverted_index.them) | 24 |
| abstract_inverted_index.where | 73 |
| abstract_inverted_index.which | 44 |
| abstract_inverted_index.while | 29 |
| abstract_inverted_index.method | 98 |
| abstract_inverted_index.neural | 52 |
| abstract_inverted_index.Problem | 63 |
| abstract_inverted_index.Routing | 0 |
| abstract_inverted_index.domain, | 68 |
| abstract_inverted_index.general | 100 |
| abstract_inverted_index.network | 53 |
| abstract_inverted_index.optimal | 27 |
| abstract_inverted_index.present | 37 |
| abstract_inverted_index.problem | 58 |
| abstract_inverted_index.reduces | 46 |
| abstract_inverted_index.results | 81, 91 |
| abstract_inverted_index.routing | 57, 111 |
| abstract_inverted_index.scaling | 43 |
| abstract_inverted_index.solving | 54 |
| abstract_inverted_index.typical | 56 |
| abstract_inverted_index.vehicle | 19 |
| abstract_inverted_index.visited | 16 |
| abstract_inverted_index.Salesman | 62 |
| abstract_inverted_index.although | 89 |
| abstract_inverted_index.approach | 87 |
| abstract_inverted_index.consider | 6 |
| abstract_inverted_index.numerous | 30 |
| abstract_inverted_index.problems | 1, 4 |
| abstract_inverted_index.proposed | 86 |
| abstract_inverted_index.solution | 39 |
| abstract_inverted_index.variants | 109 |
| abstract_inverted_index.obstacles | 74 |
| abstract_inverted_index.polygonal | 67 |
| abstract_inverted_index.polygons. | 78 |
| abstract_inverted_index.presented | 93 |
| abstract_inverted_index.problems. | 112 |
| abstract_inverted_index.Travelling | 61 |
| abstract_inverted_index.satisfied. | 35 |
| abstract_inverted_index.constraints | 31 |
| abstract_inverted_index.feasibility | 83 |
| abstract_inverted_index.preliminary | 80 |
| abstract_inverted_index.represented | 76 |
| abstract_inverted_index.optimization | 3 |
| abstract_inverted_index.computational | 47 |
| abstract_inverted_index.significantly | 45 |
| abstract_inverted_index.self-organizing | 51 |
| abstract_inverted_index.multidimensional | 42 |
| cited_by_percentile_year | |
| countries_distinct_count | 0 |
| institutions_distinct_count | 3 |
| citation_normalized_percentile |