Intensification and diversification with elite tabu search solutions for the linear ordering problem
From MaRDI portal
Publication:1302560
DOI10.1016/S0305-0548(98)00104-XzbMath1016.90081MaRDI QIDQ1302560
Manuel Laguna, Rafael Martí, Vicente Campos
Publication date: 2 March 2000
Published in: Computers \& Operations Research (Search for Journal in Brave)
Related Items
Ranking data with ordinal labels: optimality and pairwise aggregation, Revised GRASP with path-relinking for the linear ordering problem, A benchmark library and a comparison of heuristic methods for the linear ordering problem, Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis, Adaptive memory in multistart heuristics for multicommodity network design, Adaptive memory programming for matrix bandwidth minimization, A unified framework for population-based metaheuristics, An unconstrained quadratic binary programming approach to the vertex coloring problem, Tabu search and GRASP for the maximum diversity problem, A hybrid meta-heuristic for the batching problem in just-in-time flow shops, A heterogeneous cellular processing algorithm for minimizing the power consumption in wireless communications systems, Scatter search and genetic algorithms for MAX-SAT problems, An updated survey on the linear ordering problem for weighted or unweighted tournaments, Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries, The linear ordering problem: instances, search space analysis and algorithms, Workload balancing and loop layout in the design of a flexible manufacturing system, A memetic algorithm with dynamic population management for an integrated production-distribution problem, On VLSI interconnect optimization and linear ordering problem, \(\text{MA}\mid\text{PM}\): memetic algorithms with population management, Variable neighborhood search for the linear ordering problem, Principles of scatter search, Combining path relinking and genetic algorithms for the multiple-level warehouse layout problem, Tabu search directed by direct search methods for nonlinear global optimization, Comparing metaheuristic algorithms for SONET network design problems, The linear ordering problem revisited, A survey on the linear ordering problem for weighted or unweighted tournaments, Efficient local search algorithms for the linear ordering problem, A scatter search approach with dispatching rules for a joint decision of cell formation and parts scheduling in batches
Uses Software
