Heuristic algorithms for the multi-depot ring-star problem

DOI10.1016/J.EJOR.2009.07.026MaRDI QIDQ1043363zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Roberto Baldacci, Mauro Dell'Amico

Publication date 7 December 2009

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

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

zbMATH Keywords

heuristicsoptical network designtabu search

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Multiple depot ring star problem: a polyhedral study and an exact algorithm
• Algorithms for the ring star problem
• The Capacitated m-Ring-Star Problem
• An Efficient Heuristic for the Ring Star Problem
• A heuristic procedure for the capacitated m-ring-star problem

Cites work

• A Tabu Search Heuristic for the Vehicle Routing Problem
• Assignment Problems
• Computer Solutions of the Traveling Salesman Problem
• scientific article; zbMATH DE number 1062113 (Why is no real title available?)
• scientific article; zbMATH DE number 1749224 (Why is no real title available?)
• scientific article; zbMATH DE number 1453000 (Why is no real title available?)
• Locating median cycles in networks
• Optimizing a ring-based private line telecommunication network using tabu search
• The Capacitated m-Ring-Star Problem
• The Ring Star Problem: Polyhedral analysis and exact algorithm
• The vehicle routing-allocation problem: A unifying framework
• TSPLIB—A Traveling Salesman Problem Library

Cited in

(18)

• Heuristic solutions to multi-depot location-routing problems
• A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution
• Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms
• Algorithms for the ring star problem
• Algorithms for the metric ring star problem with fixed edge-cost ratio
• A parallel variable neighborhood search for solving covering salesman problem
• A variable neighborhood search based matheuristic for a waste cooking oil collection network design problem
• Algorithms for the design of network topologies with balanced disjoint rings
• Capacitated ring arborescence problems with profits
• An efficient evolutionary algorithm for the ring star problem
• Comparing metaheuristic algorithms for SONET network design problems
• Models for a Steiner multi-ring network design problem with revenues
• An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem
• Multiple depot ring star problem: a polyhedral study and an exact algorithm
• An Efficient Heuristic for the Ring Star Problem
• New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems
• A heuristic procedure for the capacitated m-ring-star problem
• Robot-aided electric vehicle routing problem with lockers and prime customers prioritization

Describes a project that uses

Uses Software

• TSPLIB
• Tabu search

This page was built for publication: Heuristic algorithms for the multi-depot ring-star problem

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