A general variable neighborhood search algorithm for the k-traveling salesman problem-Reference-Cited by-同舟云学术

A general variable neighborhood search algorithm for the k-traveling salesman problem

Published:2018 Issue: Volume:143 Page:189-196
ISSN:1877-0509
Container-title:Procedia Computer Science
language:en
Short-container-title:Procedia Computer Science

Author:

Venkatesh Pandiri,Srivastava Gaurav,Singh Alok

Publisher

Elsevier BV

Subject

General Engineering

Reference14 articles.

1. S. Arora, G. Karakostas, A 2+ ε approximation algorithm for the k-mst problem, in: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, Society for Industrial and Applied Mathematics, 2000, pp. 754–759.

2. Prize-collecting traveling salesman and related problems;Ausiello;Handbook of Approximation Algorithms and Metaheuristics,2007

3. The prize collecting traveling salesman problem;Balas;Networks,1989

4. Approximation algorithms for orienteering and discounted-reward tsp;Blum;SIAM Journal on Computing,2007

5. A. Blum, R. Ravi, S. Vempala, A constant-factor approximation algorithm for the k mst problem, in: Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, ACM, 1996, pp. 442–448.

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

1. Study of GVNS-RVND hybrid algorithm for the split load vehicle routing problem and its implementation;THE 3RD INTERNATIONAL CONFERENCE ON MATHEMATICS AND ITS APPLICATIONS (ICOMATHAPP) 2022: The Latest Trends and Opportunities of Research on Mathematics and Mathematics Education;2024

2. A General Variable Neighborhood Search Approach for the Clustered Traveling Salesman Problem with d-Relaxed Priority Rule;Lecture Notes in Computer Science;2024

3. Optimization Framework for Global Path Planning and Local Motion Planning for Robotic Welding of Multiple Large Industrial Parts;2023 IEEE 19th International Conference on Automation Science and Engineering (CASE);2023-08-26

4. An efficient hybrid genetic algorithm for solving truncated travelling salesman problem;DECISION SCI LETT;2022

5. Multi-start heuristics for the profitable tour problem;Swarm and Evolutionary Computation;2021-07