Two level general variable neighborhood search for attractive traveling salesman problem

DOI10.1016/J.COR.2013.04.015zbMATH Open1348.90113OpenAlexW2040532988MaRDI QIDQ337241FDOQ337241

Dragan Urošević, Nenad Mladenović, Raca Todosijević

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2013.04.015

Recommendations

• The attractive traveling salesman problem
• An efficient general variable neighborhood search for large travelling salesman problem with time windows
• A general VNS heuristic for the traveling salesman problem with time windows
• Solving the traveling repairman problem with profits: a novel variable neighborhood search approach
• Variable neighbourhood search algorithms for asymmetric travelling salesman problems

zbMATH Keywords

traveling salesman problemvariable neighborhood search2-level GVNSdemand allocationdemand attraction

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06)

Cites Work

• TSPLIB—A Traveling Salesman Problem Library
• Variable neighbourhood search: Methods and applications
• Variable neighborhood search
• Variable neighbourhood search: methods and applications
• A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem
• Title not available (Why is that?)
• The attractive traveling salesman problem
• A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
• New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
• An efficient General Variable Neighborhood Search for large Travelling Salesman Problem with Time Windows
• Gaussian variable neighborhood search for continuous optimization
• Variable neighborhood search for the travelling deliveryman problem
• Sum-of-squares clustering on networks

Cited In (9)

• The pollution traveling salesman problem with refueling
• Variable neighborhood search: the power of change and simplicity
• Two multi-start heuristics for the \(k\)-traveling salesman problem
• A general variable neighborhood search for the swap-body vehicle routing problem
• The multiple trip vehicle routing problem with backhauls: formulation and a two-level variable neighbourhood search
• Variable neighborhood search: basics and variants
• A general variable neighborhood search variants for the travelling salesman problem with draft limits
• Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems
• A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem

Uses Software

• TSPLIB

This page was built for publication: Two level general variable neighborhood search for attractive traveling salesman problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337241)