A discrete tree-seed algorithm for solving symmetric traveling salesman problem-Reference-Cited by-同舟云学术

A discrete tree-seed algorithm for solving symmetric traveling salesman problem

Published:2020-08 Issue:4 Volume:23 Page:879-890
ISSN:2215-0986
Container-title:Engineering Science and Technology, an International Journal
language:en
Short-container-title:Engineering Science and Technology, an International Journal

Author:

Cinar Ahmet Cevahir,Korkmaz Sedat,Kiran Mustafa Servet

Publisher

Elsevier BV

Subject

Metals and Alloys,Computer Networks and Communications,Fluid Flow and Transfer Processes,Hardware and Architecture,Mechanical Engineering,Biomaterials,Civil and Structural Engineering,Electronic, Optical and Magnetic Materials

Reference86 articles.

1. Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems;Arora;J. ACM (JACM),1998

2. Parallel techniques for solving large scale travelling salesperson problems;Ravikumar;Microprocess. Microsyst.,1992

3. Branch-and-bound methods: a survey;Lawler;Oper. Res.,1966

4. Optimization of a 532-city symmetric traveling salesman problem by branch and cut;Padberg;Operat. Res. Lett.,1987

5. Branch-and-price: column generation for solving huge integer programs;Barnhart;Oper. Res.,1998

Cited by 52 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Manipulation order optimization in industrial pick-and-place operations: application to textile and leather industry;The International Journal of Advanced Manufacturing Technology;2024-03-25

2. A New Approach Based on Collective Intelligence to Solve Traveling Salesman Problems;Biomimetics;2024-02-16

3. Advanced strategies on update mechanism of tree-seed algorithm for function optimization and engineering design problems;Expert Systems with Applications;2024-02

4. ATSA: An Adaptive Tree Seed Algorithm based on double-layer framework with tree migration and seed intelligent generation;Knowledge-Based Systems;2023-11

5. A review of metaheuristic algorithms for solving TSP-based scheduling optimization problems;Applied Soft Computing;2023-11