Multi-start methods for combinatorial optimization

DOI10.1016/J.EJOR.2012.10.012MaRDI QIDQ2253534zbMATH OpenOpenAlexFDO

Authors Rafael Martí, Mauricio G. C. Resende, Celso C. Ribeiro

Publication date 27 July 2014

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

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

zbMATH Keywords

metaheuristicsGRASPadaptive memory programmingmulti-start methods

Mathematics Subject Classification ID

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

Recommendations

• Multi-Start Methods
• A new adaptive multi-start technique for combinatorial global optimizations
• Multistart algorithms for seeking feasibility
• scientific article; zbMATH DE number 2156685
• scientific article; zbMATH DE number 1302198
• Multi-start approach for an integer determinant maximization problem
• Multiobjective combinatorial optimization: some approaches
• Multistart method with estimation scheme for global satisfycing problems
• Efficient multi-start strategies for local search algorithms

Cited in

(28)

• Efficient multi-start strategies for local search algorithms
• A multi-start local search heuristic for the green vehicle routing problem based on a multigraph reformulation
• Start Strategies of ACO Applied on Subset Problems
• Solving a large multicontainer loading problem in the car manufacturing industry
• A general variable neighborhood search approach for the minimum load coloring problem
• A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem
• Solving the multidepot vehicle routing problem with limited depot capacity and stochastic demands
• Maximizing network throughput under stochastic user equilibrium with elastic demand
• Hybrid algorithms for placement of virtual machines across geo-separated data centers
• The maximum balanced subgraph of a signed graph: applications and solution approaches
• Initialization of metaheuristics: comprehensive review, critical analysis, and research directions
• Beam angle optimization in IMRT: are we really optimizing what matters?
• Minimizing average project team size given multi-skilled workers with heterogeneous skill levels
• scientific article; zbMATH DE number 1094167 (Why is no real title available?)
• An optimum generation scheduling of electrical power system considering the effect of renewable energy sources by using a hybrid metaheuristic search algorithm
• The firefighter problem: empirical results on random graphs
• Optimizing node infiltrations in complex networks by a local search based heuristic
• A new adaptive multi-start technique for combinatorial global optimizations
• Multi-Start Methods
• Image-based inverse characterization of in-situ microscopic composite properties
• Split-merge: using exponential neighborhood search for scheduling a batching machine
• Hybridizing local search algorithms for global optimization
• Clustering data that are graph connected
• A robust optimisation approach for the placement of forest fire suppression resources
• A biased-randomized discrete-event heuristic for coordinated multi-vehicle container transport across interconnected networks
• A multi-start local search heuristic for the multi-period auto-carrier loading and transportation problem in Brazil
• Iterated local search for the placement of wildland fire suppression resources
• A multi-start gradient combination method for high-performance global search

This page was built for publication: Multi-start methods for combinatorial optimization

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