GRASP for set packing problems

Delorme, Xavier; Gandibleux, Xavier; Rodríguez, Joaquín

doi:10.1016/s0377-2217(03)00263-7

Cited by 66 publications

(54 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In this section, we report the outcomes of testing the MN/TS algorithm on the set of 16 structured instances derived from the set packing problem [9,1], which have sizes ranging from 1000 to 2000. In [1], the set packing problem is solved via a unconstrained quadratic formulation while in [9], a dedicated GRASP heuristic was used.…”

Section: Computational Results On Structured Instances From Set Packingmentioning

confidence: 99%

See 1 more Smart Citation

Multi-neighborhood tabu search for the maximum weight clique problem

Hao

Glover

2012

Ann Oper Res

View full text Add to dashboard Cite

Given an undirected graph G = (V, E) with vertex set V = {1, ..., n} and edge set E ⊆ V × V . Let w : V → Z + be a weighting function that assigns to each vertex i ∈ V a positive integer. The maximum weight clique problem (MWCP) is to determine a clique of maximum weight. This paper introduces a tabu search heuristic whose key features include a combined neighborhood and a dedicated tabu mechanism using a randomized restart strategy for diversification. The proposed algorithm is evaluated on a total of 136 benchmark instances from different sources (DIMACS, BHOSLIB and set packing). Computational results disclose that our new tabu search algorithm outperforms the leading algorithm for the maximum weight clique problem, and in addition rivals the performance of the best methods for the unweighted version of the problem without being specialized to exploit this problem class.

show abstract

Section: Computational Results On Structured Instances From Set Packingmentioning

confidence: 99%

“…In [1], the set packing problem is solved via a unconstrained quadratic formulation while in [9], a dedicated GRASP heuristic was used. For the approach to convert a set packing problem into a maximum weight independent set problem, interested readers are referred to [18].…”

Section: Computational Results On Structured Instances From Set Packingmentioning

confidence: 99%

Multi-neighborhood tabu search for the maximum weight clique problem

Hao

Glover

2012

Ann Oper Res

View full text Add to dashboard Cite

show abstract

“…Several studies have shown that GRASP produces good quality solutions for hard combinatorial optimization problems, particularly the set covering problems (Feo and Resende, 1995), the node packing problems (Feo et al, 1994) and the set packing problems (Delorme et al, 2004). Due to the fact that ALBPs can be seen as a special packing problem, we selected GRASP algorithm expecting a good behaviour of this search strategy when facing this kind of problem.…”

Section: Grasp Methodsmentioning

confidence: 99%

Balancing and scheduling tasks in assembly lines with sequence-dependent setup times

Andrés¹,

Miralles²,

Pastor³

2008

European Journal of Operational Research

149

109

View full text Add to dashboard Cite

The classical Simple Assembly Line Balancing Problem (SALBP) has been widely enriched over the past few years with many realistic approaches and much effort has been made to reduce the distance between the academic theory and the industrial reality. Despite this effort, the scheduling of the execution of tasks assigned to every workstation following the balancing of the assembly line has been scarcely reported in the scientific literature. This is supposed to be an operational concern that the worker should solve himself, but in several real environments, setups between tasks exist and optimal or near-optimal tasks schedules should be provided inside each workstation. The problem presented in this paper adds sequence-dependent setup time considerations to the classical SALBP in the following way: whenever a task is assigned next to another at the same workstation, a setup time must be added to compute the global workstation time. After formulating a mathematical model for this innovative problem and showing the high combinatorial nature of the problem, eight different heuristic rules and a GRASP algorithm are designed and tested for solving the problem in reasonable computational time.

show abstract

“…The heuristic proposed by Delorme et al (2004) was chosen to solve this SPP, first, because it generates several solutions with the same objective value, which is necessary to compare their stability, and, second, because this is one of the best published heuristics for the SPP according to the recent paper of Alidaee et al (2007).…”

Section: An Example Of Stability Evaluationmentioning

confidence: 99%

Stability evaluation of a railway timetable at station level

Delorme

Gandibleux

Rodríguez³

2009

European Journal of Operational Research

Self Cite

View full text Add to dashboard Cite

This research deals with a real-world planning problem in railway infrastructure operations. It is part of the RECIFE project, which seeks to develop a decision support software to help evaluate the capacity of a rail junction or station. To this end, the project is working on a timetable optimization model, as well as timetable evaluation modules. This paper presents a module for evaluating timetable stability, which uses an original method based on delay propagation and using shortest path problem resolution. A didactic example and a complete case study applying this method to the Pierrefitte-Gonesse junction are also presented.

show abstract

GRASP for set packing problems

Cited by 66 publications

References 18 publications

Multi-neighborhood tabu search for the maximum weight clique problem

Multi-neighborhood tabu search for the maximum weight clique problem

Balancing and scheduling tasks in assembly lines with sequence-dependent setup times

Stability evaluation of a railway timetable at station level

Contact Info

Product

Resources

About