Search Results - Complete 2-opt algorithm

A hybrid algorithm combining glowworm swarm optimization and complete 2-opt algorithm for spherical travelling salesman problems by Chen, Xin, Zhou, Yongquan, Tang, Zhonghua, Luo, Qifang

“…•A hybrid algorithm based on the glowworm swarm optimization (GSO) and the complete 2-opt algorithm is proposed…”
Get full text

Optimizing 2-opt-based heuristics on GPU for solving the single-row facility layout problem by Sun, Xue, Chou, Ping, Koong, Chorng-Shiuh, Wu, Chao-Chin, Chen, Liang-Rui

“… Many heuristic algorithms can apply the 2-opt local search to find better solutions. In complete 2-opt local search, every valid neighboring solutions of swapping…”
Get full text

A combination k-means clustering and 2-opt algorithm for solving the two echelon e-commerce logistic distribution by Zuhanda, Muhammad Khahfi, Suwilo, Saib, Sitompul, Opim Salim, Mardiningsih, Mardiningsih

Get full text

Fuzzy Rule Selection Using Hybrid Artificial Bee Colony with 2-Opt Algorithm for MANET by Logesh Babu, R., Balasubramanie, P.

“…The Mobile Ad-hoc Networks (MANET) is an independent and self-governing hosts of wireless communication that communicate using wireless links thus forming a…”
Get full text

Discrete sparrow search algorithm for symmetric traveling salesman problem by Zhang, Zhen, Han, Yang

“… This paper proposes a swarm intelligence approach using a discrete sparrow search algorithm (DSSA…”
Get full text

A Hybrid Tabu Search and 2-opt Path Programming for Mission Route Planning of Multiple Robots under Range Limitations by Lee, Meng-Tse, Chen, Bo-Yu, Lai, Ying-Chih

“… A two-phase heuristic algorithm was used to pursue this goal. In the first phase, a tabu search and the 2-opt node exchange method were used to generate a single optimal path for all target nodes…”
Get full text

Discrete Salp Swarm Algorithm for Euclidean Travelling Salesman Problem by Panwar, Karuna, Deep, Kusum

“…The Salp Swarm Algorithm (SSA) is one of the recently proposed swarm intelligence-based algorithms, which finds its motivation in the swarming behaviour of salps when navigating and foraging in the ocean…”
Get full text

Multiple k −opt evaluation multiple k −opt moves with GPU high performance local search to large-scale traveling salesman problems by Qiao, Wen-Bao, Créput, Jean-Charles

“…The 2-opt, 3-opt or k –opt heuristics are classical local search algorithms for traveling salesman problems (TSP…”
Get full text

Exploring Variants of 2-Opt and 3-Opt for the General Routing Problem by Muyldermans, Luc, Beullens, Patrick, Cattrysse, Dirk, Van Oudheusden, Dirk

“… In this paper, we describe how the well-known 2-opt and 3-opt local search procedures for node routing problems can be adapted to solve arc and general routing problems successfully…”
Get full text

Parallel heuristic local search algorithm on OTIS hyper hexa-cell and OTIS mesh of trees optoelectronic architectures by Al-Adwan, Aryaf, Sharieh, Ahmad, Mahafzah, Basel A.

“…). One of the well-known local search algorithms is the 2-opt algorithm. As a local search algorithm, 2-opt has achieved approximate optimal solutions for TSP within a reasonable time, especially for small data instances…”
Get full text

Greedy Mechanism Based Particle Swarm Optimization for Path Planning Problem of an Unmanned Surface Vehicle by Xin, Junfeng, Zhong, Jiabao, Li, Shixin, Sheng, Jinlu, Cui, Ying

“… of unmanned surface vehicles (USVs). In order to design high-quality routes for a multi-sensor integrated USV, this work improves the conventional particle swarm optimization algorithm by introducing the greedy mechanism and the 2-opt…”
Get full text

Discrete artificial ecosystem-based optimization for spherical capacitated vehicle routing problem by Tang, Jiaju, Luo, Qifang, Zhou, Yongquan

“… DAEO uses five local search operators to discretize the position update formula of the original AEO algorithm and introduces the 2-opt algorithm to simulate the mutation mechanism of organisms in the ecosystem…”
Get full text

A Discrete Hybrid Invasive Weed Optimization Algorithm for the Capacitated Vehicle Routing Problem by Zhao, Yanwei, Leng, Longlong, Qian, Zhenyu, Wang, Wanliang

“…The capacitated vehicle routing problem (CVRP) has been proved to be NP complete problem…”
Get full text

Delayed improvement local search by Amaral, Heber F., Urrutia, Sebastián, Hvattum, Lars M.

“…Local search is a fundamental tool in the development of heuristic algorithms. A neighborhood operator takes a current solution and returns a set of similar solutions, denoted as neighbors…”
Get full text

A decision support system of green inventory-routing problem by Liu, Gia-Shie, Lin, Kuo-Ping

“… Next, two modified Heuristic-Tabu combination methods that combine savings approach, 2-opt and 1-1 λ…”
Get full text

Hybrid Genetic Algorithm and Ant Colony Algorithm for Solving Travelling Salesman Problem by Thongpiem, Jirawat, Punkong, Narong, Ratanavilisagul, Chiabwoot, Kosolsombat, Somkiat

“… the ACO algorithm by the results from searching for 2-OPT algorithms that are applied with pheromones of ants…”
Get full text

Compact models for influential nodes identification problem in directed networks by Jiang, Cheng, Liu, Xueyong, Zhang, Jun, Yu, Xiao

“… Then, we formulate a compact model for INIP and prove it to be NP-Complete. Furthermore, we design a novel heuristic algorithm for the proposed model by integrating a 2-opt local search into a greedy framework…”
Get more information

Investigating the use of metaheuristics for solving single vehicle routing problems with time-varying traversal costs by Harwood, K, Mumford, C, Eglese, R

“…Metaheuristic algorithms, such as simulated annealing and tabu search, are popular solution techniques for vehicle routing problems (VRPs…”
Get full text

On inverse traveling salesman problems by Chung, Yerim, Demange, Marc

“… In this paper, we consider a variant of the inverse traveling salesman problem, denoted by I TSP W,A , by taking into account a set W of admissible weight systems and a specific algorithm…”
Get full text

A Multi-Start Iterated Local Search Algorithm for the Bottleneck Traveling Salesman Problem by Rajaramon, Viknesh, Pandiri, Venkatesh

“… A multi-start iterated local search algorithm for the BTSP is proposed in this paper. As part of this approach, two local search algorithms have been developed - one based on modified 2-opt moves and the other based on node insertion…”
Get full text