Results 131 to 140 of about 8,730 (184)

Linear time algorithm for Precedence Constrained Asymmetric Generalized Traveling Salesman Problem

, 2016
A. G. Chent︠s︡ov, Michael Khachay, Daniel Khachay   +2 more
openalex   +1 more source

Implementasi Algoritma Traveling Salesman Problem (TSP) dalam Penentuan Jalur Terpendek pada Rute Berlayar untuk Kegiatan Aplousing dan Perawatan SBNP di Wilayah Kerja Kantor Distrik Navigasi Tipe A Tanjung Perak

Ade Irfan Efendi
openalex   +1 more source

The traveling salesman with passengers and high occupancy problem

, 2017
Ranmsés Emanuel Martins Bastos
openalex   +1 more source

A Clustering-Based Multi-Task Balancing Method for Depot Optimization in Single-Depot Multiple Traveling Salesman Problems

Jiaxin Zou, Chunlong Fu, Guofang Liu, Liping Zheng, Kaiwen Xiao, Yang Deng, Hongxia He, Qi Jiang   +7 more
openalex   +1 more source

Levy-Based Insertion Heuristics for Solving Travelling Salesman Problems

A. Baskar
openalex   +1 more source

REROUTING TRAVELING SALESMAN PROBLEM WITH DRONES

Nguyen Anh-Tu, Shih-Hao Lu
openalex   +1 more source

Exact and anytime heuristic search for the Time Dependent Traveling Salesman Problem with Time Windows

Romain Fontaine
openalex   +1 more source

Comparative Analysis of Crossover and Mutation Operators in Genetic Algorithms for the Traveling Salesman Problem

Maryam Ali, Nisreen Al Habashneh, Maitha AlGhfeli   +2 more
openalex   +1 more source

Optimization for decision-making : applications to the probabilistic traveling salesman problem and spline approximation from real datasets

, 2018
Soufia Benhida
openalex   +1 more source

Some of the next articles are maybe not open access.

Related searches:

On the Dubins Traveling Salesman Problem

IEEE Transactions on Automatic Control, 2012
We study the traveling salesman problem for a Dubins vehicle. We prove that this problem is NP-hard, and provide lower bounds on the approximation ratio achievable by some recently proposed heuristics. We also describe new algorithms for this problem based on heading discretization, and evaluate their performance numerically.
Eric Feron, Emilio Frazzoli
exaly   +2 more sources