Results 21 to 30 of about 5,666,790 (163)

Traveling Salesman Problem with Transportation [PDF]

Computer Science Journal of Moldova, 2006
Traveling Salesman Problem (TSP) is a generic name that includes diverse practical models. Motivated by applications, a new model of TSP is examined – a synthesis of classical TSP and classical Transportation Problem.
Valeriu Ungureanu
doaj  

Solving Dynamic Traveling Salesman Problem Using Dynamic Gaussian Process Regression

Journal of Applied Mathematics, 2014
This paper solves the dynamic traveling salesman problem (DTSP) using dynamic Gaussian Process Regression (DGPR) method. The problem of varying correlation tour is alleviated by the nonstationary covariance function interleaved with DGPR to generate a ...
Stephen M. Akandwanaho, Aderemi O. Adewumi, Ayodele A. Adebiyi   +2 more
doaj   +1 more source

Perbandingan Algoritma Genetika dan TSP Untuk Optimalisasi Jaringan Akses Fiber To The Home

JuTISI (Jurnal Teknik Informatika dan Sistem Informasi), 2017
Genetic algorithm and TSP are  methods that can be solve optimization problem  of route or path. This paper discusses the application of genetic algorithms and Traveling Salesman Problem modeling (TSP) to those problems.
Try Feby Ramadonna, Ade Silvia, Ciksadan Ciksadan   +2 more
doaj   +1 more source

A collaborative neurodynamic optimization algorithm to traveling salesman problem

Complex & Intelligent Systems, 2022
This paper proposed a collaborative neurodynamic optimization (CNO) method to solve traveling salesman problem (TSP). First, we construct a Hopfield neural network (HNN) with $$n \times n$$ n × n neurons for the n cities.
Jing Zhong, Yuelei Feng, Shuyu Tang, Jiang Xiong, Xiangguang Dai, Nian Zhang   +5 more
doaj   +1 more source

Traveling Salesman Problems With Replenishment Arcs and Improved Ant Colony Algorithms

IEEE Access, 2021
The traveling salesman problem (TSP), can be used as a typical combinatorial optimization problem, to describe a wide variety of practical engineering optimization problems in various fields.
Xiaoxu Zeng, Qi Song, Song Yao, Zhiqiang Tian, Qinglei Liu   +4 more
doaj   +1 more source

A model of human performance on the traveling salesperson problem. [PDF]

, 2000
A computational model is proposed of how humans solve the traveling salesperson problem (TSP). Tests of the model are reported, using human performance measures from a variety of 10-, 20-, 40-, and 60-node problems, a single 48-node problem, and a single
MacGregor, J. N., Chronicle, E., Ormerod, Thomas C.   +2 more
core   +5 more sources

A Carnivorous Plant Algorithm With Heuristic Decoding Method for Traveling Salesman Problem

IEEE Access, 2022
The traveling salesman problem (TSP) is one of the most extensively studied problems in the combinatorial optimization area and still presents unsolved challenges due to its NP-hard attribute.
Jiquan Wang, Panli Zhang, Hongyu Zhang, Haohao Song, Jinling Bei, Wenfeng Sun, Xiaobo Sun   +6 more
doaj   +1 more source

New techniques for cost sharing in combinatorial optimization games [PDF]

, 2010
Combinatorial optimization games form an important subclass of cooperative games. In recent years, increased attention has been given to the issue of finding good cost shares for such games.
Caprara, A, A. N. Letchford, CAPRARA, ALBERTO, Letchford, A N   +3 more
core   +4 more sources

The Single Picker Routing Problem with Scattered Storage in Parallel‐Aisle Warehouses With Multiple Blocks

Networks, EarlyView.
ABSTRACT This paper investigates the b$$ b $$‐block single picker routing problem with scattered storage (b$$ b $$‐SPRP‐SS). For a parallel‐aisle warehouse comprising b$$ b $$ blocks, the b$$ b $$‐SPRP‐SS asks for the determination of a picker tour that minimizes travel distance while collecting all articles from a given pick list.
Stefan Irnich, Laura Lüke
wiley   +1 more source

A Supervised Learning Framework for Accelerating Solvers and Metaheuristics in Routing Problems

Networks, EarlyView.
ABSTRACT Routing problems such as the traveling salesman problem (TSP) and the capacitated vehicle routing problem (CVRP) are computationally challenging due to the exponential growth of their feasible solution spaces with increasing instance size.
Johannes Gückel, Stefan Voigt, Pirmin Fontaine   +2 more
wiley   +1 more source