Multi-neighborhood local search optimization for machine reassignment problem

DOI10.1016/J.COR.2015.10.015MaRDI QIDQ342289zbMATH OpenOpenAlexFDO

Authors Zhipeng Lü, Tao Ye, Zhuo Wang

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

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)

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

Cites work

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

Cited in

(7)

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

Describes a project that uses

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)