Intensification and diversification with elite tabu search solutions for the linear ordering problem

No abstract is available for this paper.

• Publication year

  1999

• Venue

  Computers & Operations Research

• Publication date

  1999-10-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/S0305-0548(98)00104-X
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization

  1999cited by this paper
• Tabu Search

  1997influential reference
• A new heuristic algorithm solving the linear ordering problem

  1996influential reference
• A Greedy Randomized Adaptive Search Procedure for the Two-Partition Problem

  1994cited by this paper
• The Stanford GraphBase - a platform for combinatorial computing

  1993influential reference
• THE LINEAR ORDERING PROBLEM: ALGORITHMS AND APPLICATIONS (Research and Exposition in Mathematics 8)

  1987cited by this paper
• The linear ordering problem: algorithms and applications

  1985cited by this paper
• A Cutting Plane Algorithm for the Linear Ordering Problem

  1984cited by this paper
• International Comparisons of the Structure of Production

  1958cited by this paper

• PACE Solver Description: CIMAT_Team

  2024cites this paper
• Feature-Guided Metaheuristic with Diversity Management for Solving the Capacitated Vehicle Routing Problem

  2024influential citation
• Comprehensive learning TLBO with recursive precedence-based solution construction and multilevel local search for the linear ordering problem

  2024cites this paper
• Applicability of Neural Combinatorial Optimization: A Critical View

  2024cites this paper
• A linear ordering problem with weighted rank

  2024cites this paper
• Solution-based tabu search for the capacitated dispersion problem

  2023cites this paper
• A new robust Harris Hawk optimization algorithm for large quadratic assignment problems

  2023cites this paper
• Transitions from P to NP-hardness: the case of the Linear Ordering Problem

  2022cites this paper
• Neural Improvement Heuristics for Graph Combinatorial Optimization Problems

  2022cites this paper
• Neural Improvement Heuristics for Preference Ranking

  2022cites this paper
• A diversity-aware memetic algorithm for the linear ordering Problem

  2021influential citation
• A matheuristic for the generalized order acceptance and scheduling problem

  2021cites this paper
• Block-insertion-based algorithms for the linear ordering problem

  2020cites this paper
• Exact and heuristic approaches for a new circular layout problem

  2020influential citation
• Simulated Annealing Algorithm for the Linear Ordering Problem: The Case of Tanzania Input Output Tables

  2020cites this paper
• Basic variable neighborhood search for the minimum sitting arrangement problem

  2020cites this paper
• Supervised neighborhood selection and MIP-based primal heuristics

  2019cites this paper
• Probabilistic transitivity in sports

  2019cites this paper
• Primal Heuristic for the Linear Ordering Problem

  2019cites this paper
• Artificial bee colony optimization for the quadratic assignment problem

  2019cites this paper
• Randomized Algorithms for Lexicographic Inference

  2019cites this paper
• Characterising the rankings produced by combinatorial optimisation problems and finding their intersections

  2019cites this paper
• Hybrid Heuristics for the Linear Ordering Problem

  2019cites this paper
• Optimal Bayesian point estimates and credible intervals for ranking with application to county health indices

  2018cites this paper
• Solving the Linear Ordering Problem via A Memetic Algorithm

  2018cites this paper
• Principles and Strategies of Tabu Search

  2018cites this paper
• Testing probabilistic models of choice using column generation

  2018cites this paper
• Variable Neighborhood Search

  2018cites this paper
• Developing tabu search with intensification and diversification for the seriation problem

  2018cites this paper
• Solving the Linear Ordering Problem Using a Genetic Algorithm with Local Search

  2018cites this paper
• A preordering model based on phrasal dependency tree

  2018cites this paper
• Computing minimum feedback arc set to quantify the transitivity in sports teams

  2017cites this paper
• On a new modelling approach for circular layouts and its practical advantages

  2017cites this paper
• A Hybrid Tabu Search Algorithm for the Variable Periodic Vehicle Routing Problem

  2017cites this paper
• On Asymptotic Complexity of Linear Ordering the Paley Tournament Graphs : First Prototypes with Self-Avoiding Walks

  2017cites this paper
• Essays on teamwork

  2016cites this paper
• Working Papers 520 August 2014 Probabilistic Transitivity in Sports

  2016cites this paper
• A Mathematical Optimization Model for Solving Minimum Ordering Problem with Constraint Analysis and some Generalizations

  2016cites this paper
• A Hybrid Tabu Search Algorithm for the Variable Periodic Vehicle Routing Problem

  2016cites this paper
• Algorithms for Problems in Voting and Scheduling

  2016cites this paper
• The linear ordering problem revisited

  2015cites this paper
• Metaheuristics for large-scale instances of the linear ordering problem

  2015cites this paper
• Linear Ordering Optimization with a Combinatorial Differential Evolution

  2015cites this paper
• A heuristic framework on a common generalization of the Vehicle Routing Problem and the Linear Ordering Problem

  2015cites this paper
• On the performance of parallel hybrid algorithms for the solution of the quadratic assignment problem

  2015cites this paper
• A heterogeneous cellular processing algorithm for minimizing the power consumption in wireless communications systems

  2015cites this paper
• A heterogeneous cellular processing algorithm for minimizing the power consumption in wireless communications systems

  2015cites this paper
• On the Complexity of Searching the Linear Ordering Problem Neighborhoods

  2015cites this paper
• Hybrid teaching-learning-based optimization algorithms for the Quadratic Assignment Problem

  2015cites this paper
• Hybrid genetic algorithm to solve a joint production maintenance model

  2015cites this paper
• A Survey of Tabu Search in Combinatorial Optimization

  2014cites this paper
• Fixed cardinality linear ordering problem, polyhedral studies and solution methods. (Problème d'ordre linéaire sous containte de cardinalité, étude polyédrale et méthodes de résolution)

  2014cites this paper
• Triangulation of Input–Output Tables Based on Mixed Integer Programs for Inter-temporal and Inter-regional Comparison of Production Structures

  2014cites this paper
• An Efficient Memetic Algorithm for theMax-Bisection Problem

  2013cites this paper
• Ranking data with ordinal labels: optimality and pairwise aggregation

  2013cites this paper
• Cellular Processing Algorithms

  2013cites this paper
• Experimental Study of a New Algorithm-Design-Framework Based on Cellular Computing

  2013cites this paper
• A Population-Based Strategic Oscillation Algorithm for Linear Ordering Problem with Cumulative Costs

  2013cites this paper
• Insertion based Lin-Kernighan heuristic for single row facility layout

  2013cites this paper
• Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods

  2013cites this paper
• Ranking forests

  2013cites this paper
• Méthodes d'apprentissage statistique pour le ranking : théorie, algorithmes et applications

  2013cites this paper
• A Competitive Genetic Algorithm for Single Row Facility Layout

  2012cites this paper
• New results of ant algorithms for the Linear Ordering Problem

  2012influential citation
• Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries

  2012cites this paper
• Memes co‐evolution strategies for fast convergence in solving single machine scheduling problems

  2012cites this paper
• Metaheuristics for the linear ordering problem with cumulative costs

  2012cites this paper
• Shortest Path Routing Modelling, Infeasibility and Polyhedra

  2012cites this paper
• A Lin-Kernighan Heuristic for Single Row Facility Layout

  2012cites this paper
• An empirical study of hyperheuristics for managing very large sets of low level heuristics

  2012cites this paper
• Iterated Local search for the Linear Ordering Problem

  2012cites this paper
• Hybrid GRASP with Composite Local Search And Path-Relinking for the Linear Ordering Problem with Cumulative Costs

  2012cites this paper
• Scatter Search with Multiple Improvement Methods for the Linear Ordering Problem

  2012influential citation
• A Genetic Programming Approach for Solving the Linear Ordering Problem

  2012cites this paper
• The single row facility layout problem: state of the art

  2012cites this paper
• Adaptive memory programming for matrix bandwidth minimization

  2011cites this paper
• COMPARISON OF METAHEURISTIC METHODS TO MINIMIZE MAKESPAN OF CELL SCHEDULING PROBLEMS

  2011cites this paper
• Introduction to Tabu Search

  2011cites this paper
• On VLSI interconnect optimization and linear ordering problem

  2011cites this paper
• A benchmark library and a comparison of heuristic methods for the linear ordering problem

  2011cites this paper
• Scatter Search para el registrado de imágenes 3D: aplicación en antropología forense

  2011cites this paper
• Adaptive memory in multistart heuristics for multicommodity network design

  2011cites this paper
• Multiple Local Searches to Balance Intensification and Diversification in a Memetic Algorithm for the Linear Ordering Problem

  2011influential citation
• Evaluation of meta-heuristic approaches for scheduling optimisation of flexible manufacturing systems

  2011cites this paper
• Iterated Local Search Algorithm for the Linear Ordering Problem with Cumulative Costs (LOPCC)

  2011cites this paper
• A unified framework for population-based metaheuristics

  2011cites this paper
• Single machine scheduling for minimising earliness and tardiness penalties by scatter search approach

  2011cites this paper
• Revised GRASP with path-relinking for the linear ordering problem

  2011cites this paper
• Ranking Multi-Class Data : Optimality and Pairwise Aggregation

  2011cites this paper
• Learning Mechanisms and Local Search Heuristics for the Fixed Charge Capacitated Multicommodity Network Design

  2011cites this paper
• Using Tabu Search to Analyze the Mauritian Economic Sectors

  2010cites this paper
• Automated design of energy functions for protein structure prediction by means of genetic programming and improved structure similarity assessment

  2010cites this paper
• An updated survey on the linear ordering problem for weighted or unweighted tournaments

  2010cites this paper
• An Improved Genetic Algorithm for Knapsack Problems

  2010influential citation
• Improving Iterated Local Search Solution for the Linear Ordering Problem with Cumulative Costs (LOPCC)

  2010cites this paper
• A scatter search approach with dispatching rules for a joint decision of cell formation and parts scheduling in batches

  2010cites this paper
• Using Tabu Search Heuristics in Solving the Vehicle Routing Problem with Time Windows: Application to a Mauritian Firm

  2010cites this paper
• Efficient local search algorithms for the linear ordering problem

  2010cites this paper
• Using Consecutive Swaps to Explore the Insertion Neighborhood in Tabu Search Solution of the Linear Ordering Problem

  2010influential citation
• Competitive simulated annealing and Tabu Search algorithms for the max-cut problem

  2009cites this paper