A parallel variable neighborhood search for solving covering salesman problem
From MaRDI portal
Publication:2070124
DOI10.1007/s11590-020-01642-8zbMath1483.90147OpenAlexW3085937064MaRDI QIDQ2070124
Bin Ding, Xiaoning Zang, Mustapha Ratli, Li Jiang
Publication date: 21 January 2022
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-020-01642-8
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (1)
Uses Software
Cites Work
- Corrigendum to ``An efficient evolutionary algorithm for the ring star problem
- Variable neighborhood search for location routing
- A basic variable neighborhood search heuristic for the uncapacitated multiple allocation \(p\)-hub center problem
- The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm
- Heuristic algorithms for the multi-depot ring-star problem
- Variable neighborhood search
- Variable neighborhood tabu search and its application to the median cycle problem.
- A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups
- Variable neighborhood search: basics and variants
- An integer programming-based local search for the covering salesman problem
- Heuristics for the multi-vehicle covering tour problem
- A variable neighborhood search heuristic for periodic routing problems
- Linear bilevel multi-follower programming with independent followers
- Unrelated parallel-machine scheduling with deteriorating maintenance activities to minimize the total completion time
- The Generalized Covering Salesman Problem
- The Capacitated m-Ring-Star Problem
- Parallel Metaheuristics Applications
- An exact algorithm for solving the ring star problem
- Genetic Algorithms and Genetic Programming
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
- TSPLIB—A Traveling Salesman Problem Library
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- The Covering Tour Problem
- The Ring Star Problem: Polyhedral analysis and exact algorithm
- Efficient heuristics for Median Cycle Problems
- The Covering Salesman Problem
- Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
This page was built for publication: A parallel variable neighborhood search for solving covering salesman problem
