Internet Archive Scholar
Filters
























117 Hits in 3.3 sec

On the generation of Metric TSP instances with a large integrality gap by branch-and-cut [article]

Eleonora Vercesi and Stefano Gualandi and Monaldo Mastrolilli and Luca Maria Gambardella
<span title="2022-05-20">2022</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (429.5 kB)
https://web.archive.org/web/20210908072150/https://arxiv.org/pdf/2109.02454v1.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit <a rel="external noopener" href="https://arxiv.org/pdf/2109.02454v1.pdf">the original URL</a>. The file type is <code>application/pdf</code>.

Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:

<span title="2021-09-06">2021</span> <span class="release-stage" >pre-print</span> <span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2109.02454v1">arXiv:2109.02454v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ujnyvgtg5bcxjdcrbbegva2rju">fatcat:ujnyvgtg5bcxjdcrbbegva2rju</a> </span>
This paper introduces a computational method for generating metric Travelling Salesman Problem (TSP) instances having a large integrality gap.  ...  state-of-the-art TSP solver.  ...  Cook for the precious insights on the usage of Concorde.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2109.02454v2">arXiv:2109.02454v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/cpqmkcoinjelpjmlkhthlebreu">fatcat:cpqmkcoinjelpjmlkhthlebreu</a> </span>
<span class="ui label basic orange small" title="Open Access">Open Access</span> <span class="ui label basic blue small">Multiple Versions</span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210908072150/https://arxiv.org/pdf/2109.02454v1.pdf" title="fulltext PDF download [not primary version]" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <span style="color: #f43e3e;">&#10033;</span> <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/93/d5/93d5d795b3551f80fa8be352658d0b7932cd974c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2109.02454v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>
Citation

Eleonora Vercesi and Stefano Gualandi and Monaldo Mastrolilli and Luca Maria Gambardella. "On the generation of Metric TSP instances with a large integrality gap by branch-and-cut." arXiv (2022)

GPS: A new TSP formulation for its generalizations type QUBO [article]

Saúl González-Bermejo, Guillermo Alonso-Linaje, Parfait Atchade-Adelomou
<span title="2022-01-18">2022</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (1.0 MB)
https://web.archive.org/web/20220127192336/https://arxiv.org/pdf/2110.12158v3.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit <a rel="external noopener" href="https://arxiv.org/pdf/2110.12158v3.pdf">the original URL</a>. The file type is <code>application/pdf</code>.

Other Versions

<span title="2021-10-23">2021</span> <span class="release-stage" >pre-print</span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2110.12158v1">arXiv:2110.12158v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/k5qgegihhjhuhn5dqiarofqnee">fatcat:k5qgegihhjhuhn5dqiarofqnee</a> </span>
<span title="2022-01-11">2022</span> <span class="release-stage" >pre-print</span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2110.12158v2">arXiv:2110.12158v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xubjipysdvd7zdwhfiz2y63wfi">fatcat:xubjipysdvd7zdwhfiz2y63wfi</a> </span>
We propose a new Quadratic Unconstrained Binary Optimization (QUBO) formulation of the Travelling Salesman Problem (TSP), with which we overcame the best formulation of the Vehicle Routing Problem (VRP  ...  Finally, we tested whether the correctness of the formulation by entering it into a QUBO problem solver.  ...  Reinelt, Tsplib—a traveling salesman problem library, proaches for the capacitated vehicle routing problem, ORSA journal on computing 3, 376 (1991).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2110.12158v3">arXiv:2110.12158v3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/eh6th2ogx5g47elbv3ozu6r4gu">fatcat:eh6th2ogx5g47elbv3ozu6r4gu</a> </span>
<span class="ui label basic orange small" title="Open Access">Open Access</span> <span class="ui label basic blue small">Multiple Versions</span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220127192336/https://arxiv.org/pdf/2110.12158v3.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/6f/1c/6f1c4b4004575c682afe8e5dfbb2dd92f179b0bc.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2110.12158v3" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>
Citation

Saúl González-Bermejo, Guillermo Alonso-Linaje, Parfait Atchade-Adelomou. "GPS: A new TSP formulation for its generalizations type QUBO." arXiv (2022)

Generating subtour elimination constraints for the TSP from pure integer solutions [article]

Ulrich Pferschy, Rostislav Stanek
<span title="2016-01-19">2016</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (543.1 kB)
https://web.archive.org/web/20200913011239/https://arxiv.org/pdf/1511.03533v2.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit <a rel="external noopener" href="https://arxiv.org/pdf/1511.03533v2.pdf">the original URL</a>. The file type is <code>application/pdf</code>.

Other Versions

<span title="2015-11-11">2015</span> <span class="release-stage" >pre-print</span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1511.03533v1">arXiv:1511.03533v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/37pwjekwhncwbesbbzhg5vd2m4">fatcat:37pwjekwhncwbesbbzhg5vd2m4</a> </span>
The traveling salesman problem (TSP) is one of the most prominent combinatorial optimization problems.  ...  The method of choice for solving the TSP to optimality is a branch and cut approach.  ...  We would like to thank the developers of the SCIP MIP-solver from the Konrad-Zuse-Zentrum für Informationstechnik Berlin, especially Mr Gerald Gamrath, for their valuable support.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1511.03533v2">arXiv:1511.03533v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hlok35oj5zgnrpuzsby4i5fje4">fatcat:hlok35oj5zgnrpuzsby4i5fje4</a> </span>
<span class="ui label basic blue small">Multiple Versions</span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200913011239/https://arxiv.org/pdf/1511.03533v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/e7/0c/e70c188d19e1d50a26b955edd51334f18878c20d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1511.03533v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>
Citation

Ulrich Pferschy, Rostislav Stanek. "Generating subtour elimination constraints for the TSP from pure integer solutions." arXiv (2016)

Generating subtour elimination constraints for the TSP from pure integer solutions

Ulrich Pferschy, Rostislav Staněk
<span title="2016-02-17">2016</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/l6qkvqjrjrghdo3heeheip25dy" style="color: black;">Central European Journal of Operations Research</a> </i> &nbsp;

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (1.3 MB)
https://web.archive.org/web/20170922060929/https://link.springer.com/content/pdf/10.1007%2Fs10100-016-0437-8.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit <a rel="external noopener" href="https://link.springer.com/content/pdf/10.1007%2Fs10100-016-0437-8.pdf">the original URL</a>. The file type is <code>application/pdf</code>.

The traveling salesman problem (TSP) is one of the most prominent combinatorial optimization problems.  ...  The method of choice for solving the TSP to optimality is a branch and cut approach.  ...  We would like to thank the developers of the SCIP MIP-solver from the Konrad-Zuse-Zentrum für Informationstechnik Berlin, especially Mr. Gerald Gamrath, for their valuable support.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10100-016-0437-8">doi:10.1007/s10100-016-0437-8</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/28690424">pmid:28690424</a> <a target="_blank" rel="external noopener" href="https://pubmed.ncbi.nlm.nih.gov/PMC5480099/">pmcid:PMC5480099</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jnczluvsrrakzief7z633dfjsu">fatcat:jnczluvsrrakzief7z633dfjsu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170922060929/https://link.springer.com/content/pdf/10.1007%2Fs10100-016-0437-8.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/56/e0/56e03cd740cb245f1db357870ba4fd34722e1ff3.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10100-016-0437-8"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5480099" title="pubmed link"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> pubmed.gov </button> </a>
Citation

Ulrich Pferschy, Rostislav Staněk. "Generating subtour elimination constraints for the TSP from pure integer solutions." Central European Journal of Operations Research 25.1 (2016) 231-260

On Randomness and Structure in Euclidean TSP Instances: a Study with Heuristic Methods

Gloria Cerasela Crisan, Elena Nechita, Dana Simian
<span title="">2021</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/q7qi7j4ckfac7ehf3mjbso4hne" style="color: black;">IEEE Access</a> </i> &nbsp;

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (4.1 MB)
https://web.archive.org/web/20210429104049/https://ieeexplore.ieee.org/ielx7/6287639/9312710/09312045.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit <a rel="external noopener" href="https://ieeexplore.ieee.org/ielx7/6287639/9312710/09312045.pdf">the original URL</a>. The file type is <code>application/pdf</code>.

Prediction of the quality of the result provided by a specific solving method is an important factor when choosing how to solve a given problem.  ...  INDEX TERMS Ant colony optimization, traveling salesman problem, Euclidean norm, Lin-Kernighan method.  ...  THE TRAVELING SALESMAN PROBLEM (TSP) Dantzig gives in [22] one of the simplest Traveling Salesman Problem (TSP) specifications: ''In what order should VOLUME 9, 2021 a traveling salesman visit n cities  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/access.2020.3048774">doi:10.1109/access.2020.3048774</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/bs6cb5djsfgxnke7bwyb3urmta">fatcat:bs6cb5djsfgxnke7bwyb3urmta</a> </span>
<span class="ui label basic orange small" title="Directory of Open Access Journals">DOAJ</span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210429104049/https://ieeexplore.ieee.org/ielx7/6287639/9312710/09312045.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d3/3f/d33fc4cf3d140ce1443df2a0b0e0b76bae88b387.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/access.2020.3048774"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> ieee.com </button> </a>
Citation

Gloria Cerasela Crisan, Elena Nechita, Dana Simian. "On Randomness and Structure in Euclidean TSP Instances: a Study with Heuristic Methods." IEEE Access (2021) 1-1

A Benders Decomposition Approach for the Symmetric TSP with Generalized Latency Arising in the Design of Semiflexible Transit Systems

Fausto Errico, Teodor Gabriel Crainic, Federico Malucelli, Maddalena Nonato
<span title="">2017</span> <i title="Institute for Operations Research and the Management Sciences (INFORMS)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/tl73bfx6jngkfcsigtc5zxofea" style="color: black;">Transportation Science</a> </i> &nbsp;

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (343.2 kB)
https://web.archive.org/web/20190224214832/http://pdfs.semanticscholar.org/5e27/7275ffeab2277266cc1ffbc31335efd47144.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit <a rel="external noopener" href="http://pdfs.semanticscholar.org/5e27/7275ffeab2277266cc1ffbc31335efd47144.pdf">the original URL</a>. The file type is <code>application/pdf</code>.

W e present the symmetric traveling salesman problem with generalized latency (TSP-GL) a new problem arising in the planning of the important class of semiflexible transit systems.  ...  The TSP-GL can be seen as a very challenging variant of the symmetric traveling salesman problem (S-TSP), where the objective function combines the usual cost of the circuit with a routing component accounting  ...  Fonds de recherche du Québec for the CIRRELT infrastructure grants.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1287/trsc.2015.0636">doi:10.1287/trsc.2015.0636</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ivrsj74qjrf6dmzeq6nd5tzzm4">fatcat:ivrsj74qjrf6dmzeq6nd5tzzm4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190224214832/http://pdfs.semanticscholar.org/5e27/7275ffeab2277266cc1ffbc31335efd47144.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/5e/27/5e277275ffeab2277266cc1ffbc31335efd47144.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1287/trsc.2015.0636"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>
Citation

Fausto Errico, Teodor Gabriel Crainic, Federico Malucelli, Maddalena Nonato. "A Benders Decomposition Approach for the Symmetric TSP with Generalized Latency Arising in the Design of Semiflexible Transit Systems." Transportation Science 51.2 (2017) 706-722

GPS: A New TSP Formulation for Its Generalizations Type QUBO

Saul Gonzalez-Bermejo, Guillermo Alonso-Linaje, Parfait Atchade-Adelomou
<span title="2022-01-28">2022</span> <i title="MDPI AG"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ye33srllvnanjouxn4tmrfgjsq" style="color: black;">Mathematics</a> </i> &nbsp;

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (928.4 kB)
https://web.archive.org/web/20220501110337/https://mdpi-res.com/d_attachment/mathematics/mathematics-10-00416/article_deploy/mathematics-10-00416-v2.pdf?version=1643533440

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit <a rel="external noopener" href="https://mdpi-res.com/d_attachment/mathematics/mathematics-10-00416/article_deploy/mathematics-10-00416-v2.pdf?version=1643533440">the original URL</a>. The file type is <code>application/pdf</code>.

We propose a new Quadratic Unconstrained Binary Optimization (QUBO) formulation of the Travelling Salesman Problem (TSP), with which we overcame the best formulation of the Vehicle Routing Problem (VRP  ...  Finally, we will test whether the correctness of the formulation by entering it into a QUBO problem solver.  ...  We have also seen that the results of the D-Wave simulator solver are consistent with the expected solution.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/math10030416">doi:10.3390/math10030416</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/tv7wi7uzvvcf3cpaplnypduh5i">fatcat:tv7wi7uzvvcf3cpaplnypduh5i</a> </span>
<span class="ui label basic orange small" title="Directory of Open Access Journals">DOAJ</span> <span class="ui label basic orange small" title="Szcezepanski OA Journal List">Szczepanski</span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220501110337/https://mdpi-res.com/d_attachment/mathematics/mathematics-10-00416/article_deploy/mathematics-10-00416-v2.pdf?version=1643533440" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/05/0c/050cdc9aabbb5123bbe3009123545246464272e3.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/math10030416"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> mdpi.com </button> </a>
Citation

Saul Gonzalez-Bermejo, Guillermo Alonso-Linaje, Parfait Atchade-Adelomou. "GPS: A New TSP Formulation for Its Generalizations Type QUBO." Mathematics 10.3 (2022) 416

A Swarm Optimization Solver Based on Ferroelectric Spiking Neural Networks

Yan Fang, Zheng Wang, Jorge Gomez, Suman Datta, Asif I. Khan, Arijit Raychowdhury
<span title="2019-08-13">2019</span> <i title="Frontiers Media SA"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/wrk3kouosrhcxiprcbguskdipu" style="color: black;">Frontiers in Neuroscience</a> </i> &nbsp;

Preserved Fulltext

Web Archive Capture HTML
https://web.archive.org/web/20201201050658/https://www.frontiersin.org/articles/10.3389/fnins.2019.00855/full

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit <a rel="external noopener" href="https://www.frontiersin.org/articles/10.3389/fnins.2019.00855/full">the original URL</a>. The file type is <code>text/html</code>.

, namely, the traveling salesman problem with near-optimal solutions.  ...  We show that the designed neuromorphic system can serve as an optimization solver with high-performance and high energy-efficiency.  ...  GM SI-SNN for Traveling Salesman Problem TSP is an NP-hard combinatorial optimization problem.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3389/fnins.2019.00855">doi:10.3389/fnins.2019.00855</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/31456659">pmid:31456659</a> <a target="_blank" rel="external noopener" href="https://pubmed.ncbi.nlm.nih.gov/PMC6700359/">pmcid:PMC6700359</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/uxt7mczfvbdmtcqrv2dagm7dqi">fatcat:uxt7mczfvbdmtcqrv2dagm7dqi</a> </span>
<span class="ui label basic orange small" title="Directory of Open Access Journals">DOAJ</span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201201050658/https://www.frontiersin.org/articles/10.3389/fnins.2019.00855/full" title="fulltext access" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [HTML] </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3389/fnins.2019.00855"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> frontiersin.org </button> </a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6700359" title="pubmed link"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> pubmed.gov </button> </a>
Citation

Yan Fang, Zheng Wang, Jorge Gomez, Suman Datta, Asif I. Khan, Arijit Raychowdhury. "A Swarm Optimization Solver Based on Ferroelectric Spiking Neural Networks." Frontiers in Neuroscience (2019) 855

A Hybrid Solver for Large Neighborhood Search: Mixing Gecode and EasyLocal + + [chapter]

Raffaele Cipriano, Luca Di Gaspero, Agostino Dovier
<span title="">2009</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (737.7 kB)
https://web.archive.org/web/20150328210222/http://users.dimi.uniud.it/~agostino.dovier/PAPERS/HM09.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit <a rel="external noopener" href="http://users.dimi.uniud.it/~agostino.dovier/PAPERS/HM09.pdf">the original URL</a>. The file type is <code>application/pdf</code>.

GELATO will be integrated into a more general tool to solve Constraint Satisfaction/Optimization Problems. Moreover, it can be seen as a new library for approximate and efficient searching in Gecode.  ...  We tested some hybrid algorithms on different instances of the Asymmetric Traveling Salesman Problem: even if only naive LS strategies have been used, our metaheuristics improve the standard CP search,  ...  A simple experiment We tested GELATO on instances of growing sizes of the Asymmetric Travel Salesman Problem, taken from the TSPLib [14] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-04918-7_11">doi:10.1007/978-3-642-04918-7_11</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vqjsxttibzehvhllvdfshjoxjy">fatcat:vqjsxttibzehvhllvdfshjoxjy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20150328210222/http://users.dimi.uniud.it/~agostino.dovier/PAPERS/HM09.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/eb/60/eb606afa3e85a7e45c78f50c60807e4cf4dc081d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-04918-7_11"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>
Citation

Raffaele Cipriano, Luca Di Gaspero, Agostino Dovier. "A Hybrid Solver for Large Neighborhood Search: Mixing Gecode and EasyLocal + +." Lecture Notes in Computer Science (2009) 141-155

Improved filtering for weighted circuit constraints

Pascal Benchimol, Willem-Jan van Hoeve, Jean-Charles Régin, Louis-Martin Rousseau, Michel Rueher
<span title="2012-03-25">2012</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ldxybeeoybgrrpc5b5v6mqdwty" style="color: black;">Constraints</a> </i> &nbsp;

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (527.2 kB)
https://web.archive.org/web/20160513151536/http://users.polytech.unice.fr/~rueher/Publis/tsp2012.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit <a rel="external noopener" href="http://users.polytech.unice.fr/~rueher/Publis/tsp2012.pdf">the original URL</a>. The file type is <code>application/pdf</code>.

Moreover, for medium-size problem instances, our method is competitive with the state-of-the-art special-purpose TSP solver Concorde.  ...  Experimental results on Traveling Salesman Problem instances demonstrate that our filtering algorithms can dramatically reduce the problem size.  ...  The most notable example is the special-purpose TSP solver Concorde, that can solve pure symmetric Traveling Salesman Problems on 10,000 s or more of nodes in a reasonable time [2] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10601-012-9119-x">doi:10.1007/s10601-012-9119-x</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ilk64vackvfv7govnuw73dzxau">fatcat:ilk64vackvfv7govnuw73dzxau</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20160513151536/http://users.polytech.unice.fr/~rueher/Publis/tsp2012.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/9a/c7/9ac73bea528f9c6fd8eaa4c305c3441cc1ef5f02.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10601-012-9119-x"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>
Citation

Pascal Benchimol, Willem-Jan van Hoeve, Jean-Charles Régin, Louis-Martin Rousseau, Michel Rueher. "Improved filtering for weighted circuit constraints." Constraints (2012) 205-233

A comparative analysis of the travelling salesman problem: Exact and machine learning techniques

Jeremiah Ishaya, Department of Mathematical Science, African Institute for Mathematical Sciences, Mbour, Senegal, Abdullahi Ibrahim, Nassirou Lo, Department of Mathematical Science, Baze University Abuja, Nigeria, Department of Mathematical Science, African Institute for Mathematical Sciences, Mbour, Senegal
<span title="2019-11-03">2019</span> <i title="Ptolemy Scientific Research Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/tqlhrmub5nhqlpe7i6npvnym7q" style="color: black;">Open Journal of Discrete Applied Mathematics</a> </i> &nbsp;

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (664.0 kB)
https://web.archive.org/web/20220120124738/https://pisrt.org/psrpress/j/odam/2019/3/4/a-comparative-analysis-of-the-travelling-salesman-problem-exact-and-machine-learning-techniques.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit <a rel="external noopener" href="https://pisrt.org/psrpress/j/odam/2019/3/4/a-comparative-analysis-of-the-travelling-salesman-problem-exact-and-machine-learning-techniques.pdf">the original URL</a>. The file type is <code>application/pdf</code>.

We solved a routing problem with focus on Travelling Salesman Problem using two algorithms. The task of choosing the algorithm that gives optimal result is difficult to accomplish in practice.  ...  The improved machine learning with 2-opt give near-optimal results on 2D Euclidean with upto 200 nodes.  ...  Acknowledgments: We appreciate African Institute for Mathematical Science, Senegal for full funding in order to carry out this research at AIMS.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.30538/psrp-odam2019.0020">doi:10.30538/psrp-odam2019.0020</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7cpznvgsvnbs5dbfhqrjqctrhq">fatcat:7cpznvgsvnbs5dbfhqrjqctrhq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220120124738/https://pisrt.org/psrpress/j/odam/2019/3/4/a-comparative-analysis-of-the-travelling-salesman-problem-exact-and-machine-learning-techniques.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/79/8b/798bef17da8657de2aa36c74e791b64c0dac378f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.30538/psrp-odam2019.0020"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>
Citation

Jeremiah Ishaya, Department of Mathematical Science, African Institute for Mathematical Sciences, Mbour, Senegal, Abdullahi Ibrahim, Nassirou Lo, Department of Mathematical Science, Baze University Abuja, Nigeria, Department of Mathematical Science, African Institute for Mathematical Sciences, Mbour, Senegal. "A comparative analysis of the travelling salesman problem: Exact and machine learning techniques." Open Journal of Discrete Applied Mathematics 2.3 (2019) 23-37

A Variable Neighborhood Search for Flying Sidekick Traveling Salesman Problem [article]

Julia C. Freitas, Puca Huachi V. Penna
<span title="2018-10-18">2018</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (342.4 kB)
https://web.archive.org/web/20191019103123/https://arxiv.org/pdf/1804.03954v2.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit <a rel="external noopener" href="https://arxiv.org/pdf/1804.03954v2.pdf">the original URL</a>. The file type is <code>application/pdf</code>.

Other Versions

<span title="2018-04-11">2018</span> <span class="release-stage" >pre-print</span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1804.03954v1">arXiv:1804.03954v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/teopltjzfrblpkwo27pl4f4s2e">fatcat:teopltjzfrblpkwo27pl4f4s2e</a> </span>
A variant of the Traveling Salesman Problem (TSP) called Flying Sidekick Traveling Salesman Problem (FSTSP) was introduced involving drone-assisted parcel delivery.  ...  This work proposes a hybrid heuristic that the initial solution is created from the optimal TSP solution reached by a TSP solver.  ...  Acknowledgments This research was supported by the Foundation for Research Support of the State of Minas Gerais (FAPEMIG).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1804.03954v2">arXiv:1804.03954v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ijrybfoafbbnxlcburchz5kjmq">fatcat:ijrybfoafbbnxlcburchz5kjmq</a> </span>
<span class="ui label basic blue small">Multiple Versions</span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191019103123/https://arxiv.org/pdf/1804.03954v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/18/eb/18ebe58d2a45d9d69e86f6f67b742f9ec1cfdc6b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1804.03954v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>
Citation

Julia C. Freitas, Puca Huachi V. Penna. "A Variable Neighborhood Search for Flying Sidekick Traveling Salesman Problem." arXiv (2018)

A Survey of Recent Extended Variants of the Traveling Salesman and Vehicle Routing Problems for Unmanned Aerial Vehicles

Ines Khoufi, Anis Laouiti, Cedric Adjih
<span title="2019-08-24">2019</span> <i title="MDPI AG"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ycpqunwwuja6beynxtnfswzqgy" style="color: black;">Drones</a> </i> &nbsp;

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (351.5 kB)
https://web.archive.org/web/20200217033759/https://res.mdpi.com/d_attachment/drones/drones-03-00066/article_deploy/drones-03-00066-v2.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit <a rel="external noopener" href="https://res.mdpi.com/d_attachment/drones/drones-03-00066/article_deploy/drones-03-00066-v2.pdf">the original URL</a>. The file type is <code>application/pdf</code>.

These are related to the two existing general classic ones—the Traveling Salesman Problem and the Vehicle Routing Problem.  ...  We analyze the recent literature that adapted the problems to the UAV context, provide an extensive classification and taxonomy of their problems and their formulation and also give a synthetic overview  ...  Traveling Salesman Problem TSP The Traveling Salesman Problem (TSP) is a combinatorial optimization problem.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/drones3030066">doi:10.3390/drones3030066</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xzvuhjuwkva45fmgmjbk3b4osm">fatcat:xzvuhjuwkva45fmgmjbk3b4osm</a> </span>
<span class="ui label basic orange small" title="Directory of Open Access Journals">DOAJ</span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200217033759/https://res.mdpi.com/d_attachment/drones/drones-03-00066/article_deploy/drones-03-00066-v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/07/9e/079e8db14fecc96f87b0a0b3e8d1af88ba65494e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/drones3030066"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> mdpi.com </button> </a>
Citation

Ines Khoufi, Anis Laouiti, Cedric Adjih. "A Survey of Recent Extended Variants of the Traveling Salesman and Vehicle Routing Problems for Unmanned Aerial Vehicles." Drones 3.3 (2019) 66

Research on the Distribution System Simulation of Large Company's Logistics under Internet of Things Based on Traveling Salesman Problem Solution

Liu Hui, Chen Min
<span title="2016-10-01">2016</span> <i title="Walter de Gruyter GmbH"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/yqncwzlovvhvhktpm65k4wwuoe" style="color: black;">Cybernetics and Information Technologies</a> </i> &nbsp;

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (339.7 kB)
https://web.archive.org/web/20190426171251/https://content.sciendo.com/downloadpdf/journals/cait/16/5/article-p78.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit <a rel="external noopener" href="https://content.sciendo.com/downloadpdf/journals/cait/16/5/article-p78.pdf">the original URL</a>. The file type is <code>application/pdf</code>.

This paper is research on the distribution system's simulation of large company's logistics under Internet of Things (IoT) based on traveling salesman problem solution.  ...  The information synergy had an obvious enhancing effect on system operation efficiency.  ...  TSP (Traveling Salesman Problem) is a combination optimization problem with simple definition but difficult to be solved, which attracts many researchers in various fields including mathematics, physics  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1515/cait-2016-0054">doi:10.1515/cait-2016-0054</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/qjvpmtpdhjbinlclebcp6qscu4">fatcat:qjvpmtpdhjbinlclebcp6qscu4</a> </span>
<span class="ui label basic orange small" title="Directory of Open Access Journals">DOAJ</span> <span class="ui label basic orange small" title="Szcezepanski OA Journal List">Szczepanski</span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190426171251/https://content.sciendo.com/downloadpdf/journals/cait/16/5/article-p78.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/49/cb/49cbbd7c8c46bafa4d33229afe12dee948f4da93.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1515/cait-2016-0054"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> degruyter.com </button> </a>
Citation

Liu Hui, Chen Min. "Research on the Distribution System Simulation of Large Company's Logistics under Internet of Things Based on Traveling Salesman Problem Solution." Cybernetics and Information Technologies 16.5 (2016) 78-87

A branch-and-cut framework for the consistent traveling salesman problem

Anirudh Subramanyam, Chrysanthos E. Gounaris
<span title="">2016</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2fqqu5s6wbgk5gcucpt3wqm3gy" style="color: black;">European Journal of Operational Research</a> </i> &nbsp;

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (442.8 kB)
https://web.archive.org/web/20180723063152/https://manuscript.elsevier.com/S0377221715006633/pdf/S0377221715006633.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit <a rel="external noopener" href="https://manuscript.elsevier.com/S0377221715006633/pdf/S0377221715006633.pdf">the original URL</a>. The file type is <code>application/pdf</code>.

We develop an exact solution framework for the Consistent Traveling Salesman Problem.  ...  Traveling Salesman Problem (ConTSP) is a variant of the well-known Traveling 25 Salesman Problem (TSP) that attempts to address the issue of arrival-time consistency in multi-26 period routing applications  ...  80 with consistency requirements in an exact framework.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.ejor.2015.07.030">doi:10.1016/j.ejor.2015.07.030</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5aey5uaf35blfeqn7htq3gx5r4">fatcat:5aey5uaf35blfeqn7htq3gx5r4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180723063152/https://manuscript.elsevier.com/S0377221715006633/pdf/S0377221715006633.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/e3/ee/e3ee763a390e69d1cbafa1ce16573ed16e041600.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.ejor.2015.07.030"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>
Citation

Anirudh Subramanyam, Chrysanthos E. Gounaris. "A branch-and-cut framework for the consistent traveling salesman problem." European Journal of Operational Research 248.2 (2016) 384-395

&laquo; Previous Showing results 1 &mdash; 15 out of 117 results