An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem
From MaRDI portal
Publication:439317
DOI10.1016/j.ejor.2011.08.026zbMath1244.90044MaRDI QIDQ439317
Majid Salari, Zahra Naji-Azimi, Paolo Toth
Publication date: 16 August 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2011.08.026
local search; heuristic algorithms; integer linear programming; variable neighborhood search; capacitated \(m\)-ring-star problem
90C10: Integer programming
90C05: Linear programming
90B06: Transportation, logistics and supply chain management
90C59: Approximation methods and heuristics in mathematical programming
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
The capacitated m two node survivable star problem, New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems, Models for a Steiner multi-ring network design problem with revenues, Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms, An ILP-based local search procedure for the VRP with pickups and deliveries, Generalized local branching heuristics and the capacitated ring tree 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, Spatial coverage in routing and path planning problems, A variable neighborhood search based matheuristic for a waste cooking oil collection network design problem, An efficient evolutionary algorithm for the ring star problem
Uses Software
Cites Work
- A heuristic procedure for the capacitated \(m\)-ring-star problem
- An ILP improvement procedure for the open vehicle routing problem
- Heuristic algorithms for the multi-depot ring-star problem
- Variable neighborhood search
- Local branching
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Locating median cycles in networks
- A new ILP-based refinement heuristic for vehicle routing problems
- A Branch-and-Cut-and-Price Approach for the Capacitated m-Ring-Star Problem
- A Variable Neighborhood Search and its Application to a Ring Star Problem Generalization
- The Capacitated m-Ring-Star Problem
- Column Generation Algorithms for the Capacitated m-Ring-Star Problem
- An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems
- Matheuristics
- 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
- The Covering Salesman Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
