Narrow search
Showing 1 - 10 of 176,463
Cover Image
A Quick Heuristic Algorithm for Travelling Salesman Problem
Mastan, Shaik - 2019
The Optimization of a large-scales travelling salesman Problem (TSP) mostly in telecommunication networks that may be a well-known NP-hard downside in combinatorial improvement, may be a long downside. During this paper, the planned heuristic algorithmic program is intended for quick parameter,...
Persistent link: https://www.econbiz.de/10012858320
Cover Image
A comprehensive survey on the generalized traveling salesman problem
Pop, Petrică C.; Cosma, Ovidiu; Sabo, Cosmin; Sitar, … - In: European journal of operational research : EJOR 314 (2024) 3, pp. 819-835
Persistent link: https://www.econbiz.de/10014456917
Cover Image
Model of using the exhaustive search algorithm in solving of Traveling Salesman Problem (TSP) on The example of the transport network optimization of Primorje-Gorski Kotar County (...
Vukmirović, Slavomir; Čapko, Zvonko; Babic, Ana - In: Embracing diversity in organisations : 7th …, (pp. 391-401). 2019
This paper considers and presents a model of the use of an exhaustive search algorithm in solving problems of a … methods of modeling and programming in the design of the exhaustive search algorithm in the spreadsheet interface, enable … exhaustive search algorithm. In the example are also defined nodes that are common to both the two sets and that are connecting …
Persistent link: https://www.econbiz.de/10012118702
Cover Image
Exact and heuristic approaches to Truck-Drone Delivery Problems
Freitas, Júlia C.; Penna, Puca Huachi Vaz; Toffolo, … - In: EURO journal on transportation and logistics 12 (2023), pp. 1-15
to obtain high-quality solutions for large-size instances. The efficiency of the algorithm was evaluated on 1415 …
Persistent link: https://www.econbiz.de/10014518050
Cover Image
Flow Shop Arrangement of Heuristics-Palmer, Campbell Dude Smith Algorithm : Effective Tools to Mitigate the Travelling Salesman Problem
Mastan, Shaik - 2019
The briefest pathway issue is characterized an issue in diagram hypothesis. It is tied in with finding another way. The pair of least vertices is framed least length. For assume any system the heaviness of each edge. It is generally spoken to in a type of fresh genuine number. To consequently...
Persistent link: https://www.econbiz.de/10012858323
Cover Image
Exact Algorithms for the Equitable Traveling Salesman Problem
Kinable, Joris - 2016
Given a weighted graph G = (V, E), the Equitable Traveling Salesman Problem (ETSP) asks for two perfect matchings in G such that (1) the two matchings together form a Hamiltonian cycle in G and (2) the absolute difference in costs between the two matchings is minimized. The problem is shown to...
Persistent link: https://www.econbiz.de/10012993673
Cover Image
Solving an Open k-city Travelling Salesman Problem with Ordered Constraint : An Exact Lexi-search Algorithm
Mastan, Shaik; Balakrishna, U.; Raju, G. Sankar Sekhar; … - 2021
consideration has been attained for the exact algorithms. This paper develops an exact Lexi-search algorithm (LSA) that effectively …. A numerical example is also illustrated in the provision of the theory …
Persistent link: https://www.econbiz.de/10013211939
Cover Image
Approximation Algorithm for the Traveling Salesman Problem
Forson, Roland - 2017
The traveling salesman problem is a problem in graph theory requiring the most efficient (i.e., least total distance …
Persistent link: https://www.econbiz.de/10014122915
Cover Image
A matheuristic algorithm for the pollution and energy minimization traveling salesman problems
Cacchiani, Valentina; Contreras-Bolton, Carlos; … - In: International transactions in operational research : a … 30 (2023) 2, pp. 655-687
Persistent link: https://www.econbiz.de/10013417067
Cover Image
A GRASP/Path-Relinking algorithm for the traveling purchaser problem
Cuellar-Usaquén, Daniel; Gómez, Camilo; … - In: International transactions in operational research : a … 30 (2023) 2, pp. 831-857
Persistent link: https://www.econbiz.de/10013417093