Cargando…
A one-commodity pickup-and-delivery traveling salesman problem solved by a two-stage method: A sensor relocation application
In the carrier-based coverage repair problem, a single mobile robot replaces damaged sensors by picking up spare ones in the region of interest or carrying them from a base station in wireless sensor and robot networks. The objective is to find the shortest path of the robot. The problem is an exten...
Autores principales: | Miao, Kun, Duan, Hailan, Qian, Feng, Dong, Ye |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2019
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6469814/ https://www.ncbi.nlm.nih.gov/pubmed/30995233 http://dx.doi.org/10.1371/journal.pone.0215107 |
Ejemplares similares
-
Solving the clustered traveling salesman problem via traveling salesman problem methods
por: Lu, Yongliang, et al.
Publicado: (2022) -
Simultaneous Pickup and Delivery Traveling Salesman Problem considering the Express Lockers Using Attention Route Planning Network
por: Du, Yu, et al.
Publicado: (2021) -
Solving the Traveling Salesman's Problem Using the African Buffalo Optimization
por: Odili, Julius Beneoluchi, et al.
Publicado: (2016) -
Solving Traveling Salesman Problems Based on Artificial Cooperative Search Algorithm
por: Liu, Guangjun, et al.
Publicado: (2022) -
Automatic Combination of Operators in a Genetic Algorithm to Solve the Traveling Salesman Problem
por: Contreras-Bolton, Carlos, et al.
Publicado: (2015)