MEALS: a multiobjective evolutionary algorithm with local search for solving the bi-objective ring star problem

DOI10.1016/J.EJOR.2015.09.044MaRDI QIDQ322470zbMATH OpenOpenAlexFDO

Authors Herminia I. Calvete, Carmen Galé, José A. Iranzo

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

zbMATH Keywords

bi-objective optimizationhybrid evolutionary algorithmlocal searchmetaheuristicsring star problem

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Metaheuristics and cooperative approaches for the bi-objective ring star problem
• An evolutionary algorithm for the biobjective capacitated \(m\)-ring star problem
• An efficient evolutionary algorithm for the ring star problem
• An Efficient Heuristic for the Ring Star Problem
• A heuristic procedure for the capacitated m-ring-star problem

Cites work

• A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem
• A concise guide to the Traveling Salesman Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• An efficient evolutionary algorithm for the ring star problem
• An Efficient Heuristic for the Ring Star Problem
• An exact algorithm for solving the ring star problem
• Efficient heuristics for Median Cycle Problems
• Evolutionary Algorithms for Solving Multi-Objective Problems
• Genetic Algorithms and Random Keys for Sequencing and Optimization
• Genetic local search for multi-objective combinatorial optimization
• scientific article; zbMATH DE number 2064412 (Why is no real title available?)
• Improved bounds for large scale capacitated arc routing problem
• Metaheuristics and cooperative approaches for the bi-objective ring star problem
• Multi-objective optimization using evolutionary algorithms
• Multicriteria Optimization
• The Ring Star Problem: Polyhedral analysis and exact algorithm
• The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm
• TSPLIB—A Traveling Salesman Problem Library
• Variable neighborhood tabu search and its application to the median cycle problem.

Cited in

(6)

• Algorithms for the metric ring star problem with fixed edge-cost ratio
• An efficient evolutionary algorithm for the ring star problem
• Metaheuristics and cooperative approaches for the bi-objective ring star problem
• An optimization-based approach for the healthcare districting under uncertainty
• An evolutionary algorithm for the biobjective capacitated \(m\)-ring star problem
• Modeling and solving the two-level generalized median tour problem

Describes a project that uses

Uses Software

• TSPLIB
• irace
• MEALS

This page was built for publication: MEALS: a multiobjective evolutionary algorithm with local search for solving the bi-objective ring star problem

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