Two level general variable neighborhood search for attractive traveling salesman problem

DOI10.1016/J.COR.2013.04.015MaRDI QIDQ337241zbMATH OpenOpenAlexFDO

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

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

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)

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

Cites work

• scientific article; zbMATH DE number 1082106 (Why is no real title available?)
• A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
• A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem
• An efficient general variable neighborhood search for large travelling salesman problem with time windows
• Gaussian variable neighborhood search for continuous optimization
• New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
• Sum-of-squares clustering on networks
• TSPLIB—A Traveling Salesman Problem Library
• The attractive traveling salesman problem
• Variable neighborhood search
• Variable neighborhood search for the travelling deliveryman problem
• Variable neighbourhood search: Methods and applications
• Variable neighbourhood search: methods and applications

Cited in

(10)

• The pollution traveling salesman problem with refueling
• Two multi-start heuristics for the \(k\)-traveling salesman problem
• Variable neighborhood search: the power of change and simplicity
• 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
• The attractive traveling salesman problem
• 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

Describes a project that uses

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)