Results 71 to 80 of about 30,647 (208)
The travelling salesman problem on randomly diluted lattices: results for small-size systems [PDF]
, 2000 If one places N cities randomly on a lattice of size L, we find that the normalized optimal travel distances per city in the Euclidean and Manhattan metrics vary monotonically with the city concentration p. We have studied such optimal tours for visiting
Chakrabarti, Bikas K. +1 more
core +3 more sources
International Transactions in Operational Research, EarlyView.Abstract This paper investigates an extension of the vehicle routing problem in which, in addition to minimizing the distance traveled, the sequencing of customer visits is subject to precedence constraints that impose visiting priorities among customers.
Eduardo dos Santos Teixeira +1 more
wiley +1 more source
Solving travelling salesman problem using hybrid fluid genetic algorithm (HFGA) [PDF]
, 2019 Gezgin Satıcı Problemi (GSP), bir satıcının bütün şehirleri sadece bir defa ziyaret ederek başlangıç noktasına dönmesini sağlayan en kısa rotanın belirlendiği problemdir. GSP, araç rotalamadan baskılı devre kartı montajına kadar birçok problemin temelini
Karagül, Kenan, Şahin, Yusuf
core +1 more source
Evaluation of drone system for thinning operations–a case study in Sweden
International Transactions in Operational Research, EarlyView.Abstract Thinning operations in forestry typically involve a two‐machine system (TMS) with a harvester and a forwarder. Its productivity in different forest conditions is well documented. To date, drones have been used for data collection and surveillance but not as an alternative to a TMS.
Mikael Rönnqvist +3 more
wiley +1 more source
PERBANDINGAN METODE RESTRICTED MATING DAN FITNESS SHARING UNTUK MENJAGA DIVERSITY DALAM PENYELESAIAN TRAVELING SALESMAN PROBLEM (TSP) DENGAN MENGGUNAKAN ALGORITMA BEREVOLUSI [PDF]
, 2016 Travelling Salesman Problem (TSP) banyak dimanfaatkan untuk menyelesaikan permasalahan dalam menentukan keputusan terbaik maupun dalam mendapatkan solusi yang optimum.
Feri Susilawati
core
Prüfer-Karagül algorithm: A novel approach for travelling salesman problem [PDF]
, 2019 Kombinatoryal optimizasyon alanında temel bir model olduğu için literatürde oldukça yaygın çalışılan gezgin satıcı probleminin etkin ve hızlı çözümü için yeni sezgisel yöntemler geliştirilmesine devam edilmektedir.
Karagül, Kenan
core +2 more sources
International Transactions in Operational Research, EarlyView.Abstract We address the scheduling conflicting jobs on parallel identical machines problem with makespan minimization, a classical and computationally challenging variant of parallel machine scheduling. We develop and evaluate three distinct solution methodologies: a novel constraint programming (CP) formulation, and two metaheuristics: a multi ...
Roberto Maria Rosati +3 more
wiley +1 more source
Ensuring connectedness for the maximum quasi‐clique and densest k‐subgraph problems
International Transactions in Operational Research, EarlyView.Abstract Given an undirected graph G$G$, a quasi‐clique is a subgraph of G$G$ with density at least γ$\gamma$ (0<γ≤1)$(0 < \gamma \le 1)$. Two optimisation problems can be defined for quasi‐cliques: the maximum quasi‐clique (MQC) problem, which finds a quasi‐clique with maximum vertex cardinality, and the densest k$k$‐subgraph (DKS) problem, which ...
Daniela Scherer dos Santos +3 more
wiley +1 more source
Can the Agent with Limited Information Solve Travelling Salesman Problem?
Complexity, 2017 Here, we develop new heuristic algorithm for solving TSP (Travelling Salesman Problem). In our proposed algorithm, the agent cannot estimate tour lengths but detect only a few neighbor sites. Under the circumstances, the agent occasionally ignores the NN
Tomoko Sakiyama, Ikuo Arizono
doaj +1 more source
The Metric Travelling Salesman Problem: The Experiment on Pareto-optimal Algorithms
Труды Института системного программирования РАН, 2018 The Metric Travelling Salesman Problem is a subcase of the Travelling Salesman Problem (TSP), where the triangle inequality holds. It is a key problem in combinatorial optimization.
S. M. Avdoshin, E. N. Beresneva
doaj +1 more source