Grasp and Path Relinking for 2-Layer Straight Line Crossing Minimization

Authors:
Manuel Laguna;Rafael Marti
Affiliations:
-;-
Venue:
INFORMS Journal on Computing
Year:
1999

Citing 0
Cited 60

Reactive GRASP with path relinking for channel assignment in mobile phone networks

DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
GRASP for Seam Drawing in Mosaicking of Aerial Photographic Maps

Journal of Heuristics
Graph Visualization and Navigation in Information Visualization: A Survey

IEEE Transactions on Visualization and Computer Graphics
A Parallel GRASP Heuristic for the 2-Path Network Design Problem (Research Note)

Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Parallel GRASP with path-relinking for job shop scheduling

Parallel Computing - Special issue: Parallel computing in numerical optimization
Heuristics and meta-heuristics for 2-layer straight line crossing minimization

Discrete Applied Mathematics
Metaheuristics in combinatorial optimization: Overview and conceptual comparison

ACM Computing Surveys (CSUR)
A Hybrid Heuristic for the p-Median Problem

Journal of Heuristics
A GRASP heuristic for the capacitated minimum spanning tree problem using a memory-based local search strategy

Metaheuristics
A greedy random adaptive search procedure for the weighted maximal planar graph problem

Computers and Industrial Engineering
A GRASP and Path Relinking Heuristic for Rural Road Network Development

Journal of Heuristics
Solving two location models with few facilities by using a hybrid heuristic: a real health resources case

Computers and Operations Research - Articles presented at the conference on routing and location (CORAL)
GRASP with path relinking for the weighted MAXSAT problem

Journal of Experimental Algorithmics (JEA)
Metaheuristics for optimization problems in computer communications

Computer Communications
A GRASP algorithm to solve the unicost set covering problem

Computers and Operations Research
New heuristics for the maximum diversity problem

Journal of Heuristics
Adaptive memory programing for the robust capacitated international sourcing problem

Computers and Operations Research
A new modeling and solution approach for the set-partitioning problem

Computers and Operations Research
Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times

Computers and Operations Research
A GRASP approach for the extended car sequencing problem

Journal of Scheduling
A greedy randomized adaptive search procedure for the point-feature cartographic label placement

Computers & Geosciences
Advanced Scatter Search for the Max-Cut Problem

INFORMS Journal on Computing
GRASP and path relinking for the max-min diversity problem

Computers and Operations Research
Solving two location models with few facilities by using a hybrid heuristic: a real health resources case

Computers and Operations Research - Articles presented at the conference on routing and location (CORAL)
Investigation of a new GRASP-based clustering algorithm applied to biological data

Computers and Operations Research
M-GRASP: a GRASP with memory for latency-aware partitioning methods in DVE systems

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
A Path Relinking approach for the Team Orienteering Problem

Computers and Operations Research
Black box scatter search for general classes of binary optimization problems

Computers and Operations Research
Exploring multi-objective PSO and GRASP-PR for rule induction

EvoCOP'08 Proceedings of the 8th European conference on Evolutionary computation in combinatorial optimization
Heuristics for the bandwidth colouring problem

International Journal of Metaheuristics
A GRASP-based network re-optimization strategy for improving RWA in multi-constrained optical transport infrastructures

Computer Communications
A GRASP with evolutionary path relinking for the truck and trailer routing problem

Computers and Operations Research
A hybrid evolutionary metaheuristics (HEMH) applied on 0/1 multiobjective knapsack problems

Proceedings of the 13th annual conference on Genetic and evolutionary computation
A parallel multi-start search algorithm for dynamic traveling salesman problem

SEA'11 Proceedings of the 10th international conference on Experimental algorithms
GRASP with path-relinking for data clustering: a case study for biological data

SEA'11 Proceedings of the 10th international conference on Experimental algorithms
GRASP with path-relinking for the generalized quadratic assignment problem

Journal of Heuristics
Seeking global edges for traveling salesman problem in multi-start search

Journal of Global Optimization
A rearrangement of adjacency matrix based approach for solving the crossing minimization problem

Journal of Combinatorial Optimization
Revised GRASP with path-relinking for the linear ordering problem

Journal of Combinatorial Optimization
Improvement in the performance of island based genetic algorithms through path relinking

HM'06 Proceedings of the Third international conference on Hybrid Metaheuristics
GRASP and path relinking hybridizations for the point matching-based image registration problem

Journal of Heuristics
Automatic tuning of GRASP with path-relinking heuristics with a biased random-key genetic algorithm

SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
GRASP with path-relinking for the weighted maximum satisfiability problem

WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Parametrized GRASP heuristics for three-index assignment

EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
Path-relinking intensification methods for stochastic local search algorithms

Journal of Heuristics
Dynamic routing and spectrum (re)allocation in future flexgrid optical networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
An efficient compact quadratic convex reformulation for general integer quadratic programs

Computational Optimization and Applications
Scatter Search and Path Relinking: A Tutorial on the Linear Arrangement Problem

International Journal of Swarm Intelligence Research
A hybrid GRASP heuristic to construct effective drawings of proportional symbol maps

Computers and Operations Research
Greedy Randomized Search Procedure to Sort Genomes using Symmetric, Almost-Symmetric and Unitary Inversions

Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics
Heuristics and metaheuristics for the maximum diversity problem

Journal of Heuristics
Solution attractor of local search in travelling salesman problem: concept, construction and application

International Journal of Metaheuristics
A GRASP/Path Relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems

Computers and Operations Research
A hybrid Lagrangean heuristic with GRASP and path-relinking for set k-covering

Computers and Operations Research
A hybrid data mining GRASP with path-relinking

Computers and Operations Research
GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem

Computers and Operations Research
A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem

Computers and Operations Research
Randomized heuristics for handover minimization in mobility networks

Journal of Heuristics
GRASP for the uncapacitated r-allocation p-hub median problem

Computers and Operations Research
QoS-aware web services composition using GRASP with Path Relinking

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this article, we develop a greedy randomized adaptive search procedure (GRASP) for the problem of minimizing straight line crossings in a 2-layer graph. The procedure is fast and is particularly appealing when dealing with low-density graphs. When a modest increase in computational time is allowed, the procedure may be coupled with a path relinking strategy to search for improved outcomes. Although the principles of path relinking have appeared in the tabu search literature, this search strategy has not been fully implemented and tested. We perform extensive computational experiments with more than 3,000 graph instances to first study the effect of changes in critical search parameters and then to compare the efficiency of alternative solution procedures. Our results indicate that graph density is a major influential factor on the performance of a solution procedure.