GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem

DOI10.1016/j.cor.2016.09.005zbMath1391.90666OpenAlexW2523147401MaRDI QIDQ1652080

Manuel Lozano, Fred Glover, Carlos García-Martínez, Rafael Martí, Francisco J. Rodriguez

Publication date: 11 July 2018

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

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

zbMATH Keywords

GRASPbinary combinatorial optimisationexterior path-relinkingmultidimensional two-way number partitioning problemrestricted local search

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

New mixed-integer linear programming model for solving the multidimensional multi-way number partitioning problem, A binary algebraic differential evolution for the multidimensional two-way number partitioning problem, Finding efficient make-to-order production and batch delivery schedules, A mixed-integer linear programming model to solve the multidimensional multi-way number partitioning problem

Uses Software

• Scatter Search
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A scatter search algorithm for the distributed permutation flowshop scheduling problem
• An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem
• GRASP and path relinking for the equitable dispersion problem
• Two metaheuristic approaches for solving multidimensional two-way number partitioning problem
• Integer linear programming model for multidimensional two-way number partitioning problem
• Variable neighbourhood search: methods and applications
• Hybrid metaheuristics with evolutionary algorithms specializing in intensification and diversification: overview and progress report
• GRASP and path relinking for the max-min diversity problem
• Heuristics and exact methods for number partitioning
• A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 special session on real parameter optimization
• A probabilistic heuristic for a computationally difficult set covering problem
• A complete anytime algorithm for number partitioning
• A memetic algorithm approach for solving the multidimensional multi-way number partitioning problem
• Greedy randomized adaptive search procedures
• Easily searched encodings for number partitioning
• GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times
• Path relinking for the vehicle routing problem
• Randomized methods for the number partitioning problem
• Multiobjective GRASP with path relinking
• A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs
• GRASP with Path Relinking for Three-Index Assignment
• Approximations of the critical region of the fbietkan statistic
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
• Computing Partitions with Applications to the Knapsack Problem
• GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
• Scatter Search and Path Relinking: Advances and Applications
• Phase Transition in the Number Partitioning Problem
• A GRASP with path-relinking for private virtual circuit routing