Multi-neighborhood local search optimization for machine reassignment problem

DOI10.1016/J.COR.2015.10.015zbMATH Open1349.90574OpenAlexW2217251924MaRDI QIDQ342289FDOQ342289

Tao Ye, Zhuo Wang, Zhipeng Lü

Publication date: 17 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2015.10.015

Recommendations

• Constraint-based large neighborhood search for machine reassignment. A solution approach to the ROADEF/EURO challenge 2012
• An optimization-based heuristic for the machine reassignment problem
• Variable neighborhood search for Google machine reassignment problem
• Fast machine reassignment
• An efficient local search with noising strategy for Google machine reassignment problem

zbMATH Keywords

local searchneighborhood structuremachine reassignmentgoogle ROADEF/EURO challengepartition search

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Discrete location and assignment (90B80)

Cites Work

• Title not available (Why is that?)
• Optimization by Simulated Annealing
• Title not available (Why is that?)
• A survey of algorithms for the generalized assignment problem
• An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions
• The generalized assignment problem
• Assignment problems: a golden anniversary survey
• The reliable facility location problem: formulations, heuristics, and approximation algorithms
• A branch and bound algorithm for the generalized assignment problem
• A Branch-and-Price Algorithm for the Generalized Assignment Problem
• Greedy randomized adaptive search procedures
• Bees algorithm for generalized assignment problem
• New route relaxation and pricing strategies for the vehicle routing problem
• Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
• A unified exact method for solving different classes of vehicle routing problems
• An ejection chain approach for the generalized assignment problem
• A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem
• Effective algorithm and heuristic for the generalized assignment problem.
• A path relinking approach with ejection chains for the generalized assignment problem
• Variable neighborhood search for Google machine reassignment problem
• Tuning Parameters of Large Neighborhood Search for the Machine Reassignment Problem
• A variable depth search algorithm with branching search for the generalized assignment problem
• Heuristics and matheuristics for a real‐life machine reassignment problem
• A genetic algorithm for the generalised assignment problem
• A hybrid heuristic for the generalized assignment problem
• Modeling Facility Location Problems as Generalized Assignment Problems
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

• An efficient local search with noising strategy for Google machine reassignment problem
• An optimization-based heuristic for the machine reassignment problem

Uses Software

• Tabu search

This page was built for publication: Multi-neighborhood local search optimization for machine reassignment problem

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