A variable neighborhood search and its application to a ring star problem generalization

DOI10.1016/J.ENDM.2010.05.044zbMATH Open1237.90171OpenAlexW2007180585MaRDI QIDQ2883580FDOQ2883580

Authors: Majid Salari, Zahra Naji-Azimi, Paolo Toth 

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

Recommendations

• Variable neighborhood search: Principles and applications
• Variable neighbourhood search: methods and applications
• Variable neighbourhood search: Methods and applications
• A generalized variable neighborhood search for combinatorial optimization problems
• An efficient evolutionary algorithm for the ring star problem
• An Efficient Heuristic for the Ring Star Problem
• The Ring Star Problem: Polyhedral analysis and exact algorithm

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem
• An Efficient Heuristic for the Ring Star Problem
• Two-node-connected star problem

Uses Software

• VRP

This page was built for publication: A variable neighborhood search and its application to a ring star problem generalization

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