A heuristic procedure for the capacitated \(m\)-ring-star problem

DOI10.1016/j.ejor.2010.06.030zbMath1206.90202OpenAlexW2004217741MaRDI QIDQ613432

Zahra Naji-Azimi, Paolo Toth, Majid Salari

Publication date: 20 December 2010

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2010.06.030

zbMATH Keywords

networksheuristic algorithmscapacitated \(m\)-ring-star problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (16)

A Variable Neighborhood Search and its Application to a Ring Star Problem Generalization ⋮ Optimal capacitated ring trees ⋮ Models for a Steiner multi-ring network design problem with revenues ⋮ A branch‐and‐cut algorithm for the ring spur assignment problem ⋮ Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms ⋮ New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems ⋮ An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem ⋮ The caterpillar-packing polytope ⋮ A branch-and-price algorithm for a vehicle routing with demand allocation problem ⋮ A decomposition algorithm for the ring spur assignment problem ⋮ An integer programming-based local search for the covering salesman problem ⋮ A variable neighborhood search for the last-mile delivery problem during major infectious disease outbreak ⋮ A covering traveling salesman problem with profit in the last mile delivery ⋮ The capacitated m two node survivable star problem ⋮ Facet-inducing inequalities with acyclic supports for the caterpillar-packing polytope ⋮ Spatial coverage in routing and path planning problems

Uses Software

• TSPLIB

Cites Work

• Heuristic algorithms for the multi-depot ring-star problem
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• Locating median cycles in networks
• The Capacitated m-Ring-Star Problem
• Column Generation Algorithms for the Capacitated m-Ring-Star Problem
• TSPLIB—A Traveling Salesman Problem Library
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
• The Ring Star Problem: Polyhedral analysis and exact algorithm
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: A heuristic procedure for the capacitated \(m\)-ring-star problem