Alternative evaluation functions for the cyclic bandwidth sum problem

DOI10.1016/j.ejor.2018.09.031zbMath1403.90656OpenAlexW2897004792WikidataQ129160468 ScholiaQ129160468MaRDI QIDQ1631512

Abraham Duarte, Eduardo Rodriguez-Tello, Valentina Narvaez-Teran, Frédéric Lardeux

Publication date: 6 December 2018

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

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

zbMATH Keywords

combinatorial optimizationenhanced evaluation functionfitness landscape neutralityrefined discrimination capabilitysearch guiding efficiency

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (2)

Population-based iterated greedy algorithm for the S-labeling problem ⋮ A general variable neighborhood search for the cyclic antibandwidth problem

Uses Software

• NetworkX
• GOAL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• GOAL solver: a hybrid local search based solver for high school timetabling
• Distributed localized bi-objective search
• Multi-objectivization via decomposition: an analysis of helper-objectives and complete decomposition
• Multi-objectivization, fitness landscape transformation and search performance: a case of study on the HP model for protein structure prediction
• An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints
• An iterated local search heuristic for the split delivery vehicle routing problem
• Modelling and evaluation issues in nurse rostering
• A framework for solving VLSI graph layout problems
• Theoretical aspects of local search.
• Variable neighborhood search
• Improved heuristic algorithms for the job sequencing and tool switching problem
• A heuristic algorithm for a single vehicle static bike sharing rebalancing problem
• A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem
• Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs
• Iterated local search and column generation to solve arc-routing as a permutation set-covering problem
• A hybrid breakout local search and reinforcement learning approach to the vertex separator problem
• An improved simulated annealing algorithm for bandwidth minimization
• A study on cyclic bandwidth sum
• An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
• Job-shop local-search move evaluation without direct consideration of the criterion's value
• Optimal Assignments of Numbers to Vertices
• Handbook of metaheuristics
• Cyclic bandwidth sum of graphs

This page was built for publication: Alternative evaluation functions for the cyclic bandwidth sum problem