Improving the anytime behavior of two-phase local search

DOI10.1007/s10472-011-9235-0zbMath1234.68362OpenAlexW2046984822MaRDI QIDQ408982

Manuel López-Ibáñez, Jérémie Dubois-Lacoste, Thomas Stützle

Publication date: 12 April 2012

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://dipot.ulb.ac.be/dspace/bitstream/2013/99870/1/IridiaTr2010-022.pdf

zbMATH Keywords

anytime algorithmsmulti-objectivetwo-phase local search

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

A coordinate-exchange two-phase local search algorithm for the D- and I-optimal designs of split-plot experiments, Anytime Pareto local search, Perturbed decomposition algorithm applied to the multi-objective traveling salesman problem, Improving the anytime behavior of two-phase local search, A multi-objective coordinate-exchange two-phase local search algorithm for multi-stratum experiments, Incorporating decision-maker's preferences into the automatic configuration of bi-objective optimisation algorithms

Uses Software

• SPOT
• SMS-EMOA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improving the anytime behavior of two-phase local search
• A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems
• Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• SMS-EMOA: multiobjective selection based on dominated hypervolume
• Two-phase Pareto local search for the biobjective traveling salesman problem
• Design and analysis of stochastic local search for the multiobjective traveling salesman problem
• Optimal two- and three-stage production schedules with setup times included
• A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem
• Exploratory Analysis of Stochastic Local Search Algorithms in Biobjective Optimization
• Minimizing Total Tardiness on One Machine is NP-Hard
• Bicriteria Transportation Problem
• The Complexity of Flowshop and Jobshop Scheduling