Multi-neighborhood local search optimization for machine reassignment problem

DOI10.1016/j.cor.2015.10.015zbMath1349.90574OpenAlexW2217251924MaRDI QIDQ342289

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

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)

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Assignment problems: a golden anniversary survey
• A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem
• A survey of algorithms for the generalized assignment problem
• A genetic algorithm for the generalised assignment problem
• A hybrid heuristic for the generalized assignment problem
• Effective algorithm and heuristic for the generalized assignment problem.
• Greedy randomized adaptive search procedures
• Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
• Bees algorithm for generalized assignment problem
• A unified exact method for solving different classes of vehicle routing problems
• An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions
• A path relinking approach with ejection chains for the generalized assignment problem
• Variable Neighborhood Search for Google Machine Reassignment problem
• New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
• An Ejection Chain Approach for the Generalized Assignment Problem
• The Reliable Facility Location Problem: Formulations, Heuristics, and Approximation Algorithms
• A branch and bound algorithm for the generalized assignment problem
• Modeling Facility Location Problems as Generalized Assignment Problems
• A Branch-and-Price Algorithm for the Generalized Assignment 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

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