Exact Formulation and Analysis for the Bi-Objective Insular Traveling Salesman Problem
This paper aims at studying the Bi-Objective Insular Traveling Salesman Problem (BO-InTSP), which searches for a set of efficient, single visit sequences to collect (or distribute) freight from a set of islands. In this problem, the selection of ports (nodes) to be visited at each island, along with...
Guardado en:
Autores principales: | Pablo A. Miranda-Gonzalez, Javier Maturana-Ross, Carola A. Blazquez, Guillermo Cabrera-Guerrero |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
MDPI AG
2021
|
Materias: | |
Acceso en línea: | https://doaj.org/article/3f31761ef8f04380a5d435a0c80efe80 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
Use of Ant Colony Optimization Algorithm for Determining Traveling Salesman Problem Routes
por: Bib Paruhum Silalahi, et al.
Publicado: (2019) -
Solving the Traveling Salesman Problem on the D-Wave Quantum Computer
por: Siddharth Jain
Publicado: (2021) -
Complexity indices for the traveling salesman problem continued
por: Cvetković Dragoš, et al.
Publicado: (2021) -
A Novel Sparrow Search Algorithm for the Traveling Salesman Problem
por: Changyou Wu, et al.
Publicado: (2021) -
Solving Traveling Salesman Problem with Time Windows Using Hybrid Pointer Networks with Time Features
por: Majed G. Alharbi, et al.
Publicado: (2021)