Heuristic algorithms for the multi-depot ring-star problem
From MaRDI portal
Publication:1043363
DOI10.1016/j.ejor.2009.07.026zbMath1176.90086OpenAlexW1981242636WikidataQ59222258 ScholiaQ59222258MaRDI QIDQ1043363
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
Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Models for a Steiner multi-ring network design problem with revenues, A variable neighborhood search based matheuristic for a waste cooking oil collection network design problem, A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution, A heuristic procedure for the capacitated \(m\)-ring-star 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, Multiple depot ring star problem: a polyhedral study and an exact algorithm, Capacitated ring arborescence problems with profits, Algorithms for the metric ring star problem with fixed edge-cost ratio, A parallel variable neighborhood search for solving covering salesman problem, An efficient evolutionary algorithm for the ring star problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The vehicle routing-allocation problem: A unifying framework
- Locating median cycles in networks
- Optimizing a Ring-Based Private Line Telecommunication Network Using Tabu Search
- The Capacitated m-Ring-Star Problem
- Assignment Problems
- TSPLIB—A Traveling Salesman Problem Library
- The Ring Star Problem: Polyhedral analysis and exact algorithm
- A Tabu Search Heuristic for the Vehicle Routing Problem
- Computer Solutions of the Traveling Salesman Problem