A Variable Neighborhood Search and its Application to a Ring Star Problem Generalization

DOI10.1016/j.endm.2010.05.044zbMath1237.90171OpenAlexW2007180585MaRDI QIDQ2883580

Zahra Naji-Azimi, Paolo Toth, Majid Salari

Publication date: 13 May 2012

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2010.05.044

zbMATH Keywords

networksinteger linear programmingvariable neighborhood searchcapacitated \(m\)-ring-star problem

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Related Items

An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem

Uses Software

• VRP

Cites Work

• A heuristic procedure for the capacitated \(m\)-ring-star problem
• An ILP improvement procedure for the open vehicle routing problem
• The Capacitated m-Ring-Star Problem
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem