The priority-based traveling backpacker problem: Formulations and heuristics
CR da Costa, MCV Nascimento - Expert Systems with Applications, 2024 - Elsevier
Abstract The Traveling Backpacker Problem (TBP) has been recently proposed to address
the growing use of air transportation for tourism. It aims to identify routes with the minimum …
the growing use of air transportation for tourism. It aims to identify routes with the minimum …
A novel Algorithm for Solving the Prize Collecting Traveling Salesman Problem based on DNA Computing
ZC Wang, K Liang, XG Bao… - IEEE Transactions on …, 2023 - ieeexplore.ieee.org
DNA computing is a new pattern of computing that combines biotechnology and information
technology. As a new technology born in less than three decades, it has developed at an …
technology. As a new technology born in less than three decades, it has developed at an …
Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem
G Pantuza Jr, MC de Souza - International Transactions in …, 2022 - Wiley Online Library
The prize collecting traveling salesman problem (PCTSP) is a generalization of the traveling
salesman problem (TSP) in which a tour starting at a root node must visit a subset of nodes …
salesman problem (TSP) in which a tour starting at a root node must visit a subset of nodes …
Meta-heurísticas hibridizadas com variações de busca local aplicadas ao problema do caixeiro viajante com coleta de prêmios.
MC Carmo - 2023 - repositorio.ufba.br
Resumo O Problema do Caixeiro Viajante com Coleta de Prêmios (PCVCP) é uma variante
do tradicional Problema do Caixeiro Viajante (PCV). No PCVCP, o caixeiro percorre um …
do tradicional Problema do Caixeiro Viajante (PCV). No PCVCP, o caixeiro percorre um …