A general variable neighborhood search variants for the travelling salesman problem with draft limits

DOI10.1007/s11590-014-0788-9zbMath1382.90096MaRDI QIDQ1677289

Bernard Gendron, Anis Mjirda, Marko Mladenović, Saïd Hanafi, Raca Todosijević

Publication date: 10 November 2017

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-014-0788-9

zbMATH Keywords

maritime transportation; general variable neighborhood search; sequential variable neighborhood descent; traveling salesman problem with draft limits

Mathematics Subject Classification ID

90C59: Approximation methods and heuristics in mathematical programming

90C27: Combinatorial optimization

Related Items

A Variable Neighborhood Search Algorithm for Cost-Balanced Travelling Salesman Problem, Variable neighborhood search: basics and variants, An efficient heuristic for a hub location routing problem, Two multi-start heuristics for the \(k\)-traveling salesman problem

Uses Software

• TSPLIB

Cites Work

• Unnamed Item
• A two phase variable neighborhood search for the multi-product inventory routing problem
• Two level general variable neighborhood search for attractive traveling salesman problem
• The hierarchical traveling salesman problem
• 3-approximation algorithm for a two depot, heterogeneous traveling salesman problem
• Variable neighbourhood search: methods and applications
• Variable neighbourhood search: Methods and applications
• Variable neighborhood search
• The traveling salesman problem with draft limits
• A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
• Variable neighborhood search for the travelling deliveryman problem
• Exact algorithms for the traveling salesman problem with draft limits
• TSPLIB—A Traveling Salesman Problem Library
• An efficient General Variable Neighborhood Search for large Travelling Salesman Problem with Time Windows