Results 31 to 40 of about 15,296 (207)
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 +6 more
doaj +1 more source
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 +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 +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 +4 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 +2 more
doaj +1 more source
N-body Approach to the Traveling Salesman Problem (TSP)
, 2019 19 pages, 19 figures, 2 ...
Seay, Johnny +4 more
openaire +2 more sources
Business Strategy and the Environment, EarlyView.ABSTRACT This study demonstrates how a profitable, lean, and environmentally responsible e‐waste reverse logistics system can be designed using integrated Operations Research (OR) techniques. Addressing the growing urgency of responsible consumption (UN SDG 12) and the projected rise of the e‐waste sector to USD 137.60 billion by 2029, the research ...
Sheeba Pathak, Hajar Fatorachian
wiley +1 more source
Exact algorithms for the order picking problem [PDF]
, 2018 Order picking is the problem of collecting a set of products in a warehouse in a minimum amount of time. It is currently a major bottleneck in supply-chain because of its cost in time and labor force.
Cambazard, Hadrien +2 more
core +4 more sources
Revisiting Traveling Salesman Problem (TSP): Analysis of GA and SA based Solutions
International Journal of Recent Contributions from Engineering, Science & IT (iJES), 2021 The purpose of this study to analyze genetic algorithm (GA) and simulated an-nealing (SA) based approaches applied to well-known Traveling Salesman Prob-lem (TSP). As a NP-Hard problem, the goal of TSP is to find the shortest route possible to travel all the cities, given a set of cities and distances between cities.
Darius Bethel, Hakki Erhan Sevil
openaire +2 more sources