MEALS: a multiobjective evolutionary algorithm with local search for solving the bi-objective ring star problem
From MaRDI portal
Publication:322470
DOI10.1016/j.ejor.2015.09.044zbMath1346.90733MaRDI QIDQ322470
José A. Iranzo, Herminia I. Calvete, Carmen Galé
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2015.09.044
metaheuristics; local search; hybrid evolutionary algorithm; bi-objective optimization; ring star problem
90C35: Programming involving graphs or networks
90C29: Multi-objective and goal programming
90C59: Approximation methods and heuristics in mathematical programming
Related Items
Algorithms for the metric ring star problem with fixed edge-cost ratio, An optimization-based approach for the healthcare districting under uncertainty
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Improved bounds for large scale capacitated arc routing problem
- The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm
- Variable neighborhood tabu search and its application to the median cycle problem.
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem
- An efficient evolutionary algorithm for the ring star problem
- Metaheuristics and cooperative approaches for the bi-objective ring star problem
- An exact algorithm for solving the ring star problem
- A concise guide to the Traveling Salesman Problem
- TSPLIB—A Traveling Salesman Problem Library
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- The Ring Star Problem: Polyhedral analysis and exact algorithm
- Efficient heuristics for Median Cycle Problems
- An Efficient Heuristic for the Ring Star Problem
- Multicriteria Optimization
- Evolutionary Algorithms for Solving Multi-Objective Problems
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Genetic local search for multi-objective combinatorial optimization
