A tabu search heuristic for the dynamic space allocation problem

McKendall, Alan; Jaramillo, Juan R.

doi:10.1016/j.cor.2004.08.007

Cited by 25 publications

(22 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Best solutions are set off in bold typeface. Those values reported by [6] that are lower than those found by Cplex are indicated by underlined italics. The last line in Table 1 shows the average processing time for each algorithm.…”

Section: Computational Resultsmentioning

confidence: 75%

“…We solved the formulation described in [8] using Cplex 11 and, besides the previous known optimal values, we were able to find optimal solutions to instances P25, P26, P28, P29, P30, P31, P32, P35, P36, P39 and P40. Surprisingly, for instances P25, P26, P28, P32, P35, P36, P39 and P40, the best known upper bounds (heuristic algorithm solutions) reported in [6] were smaller than the optimal solutions found by Cplex 11. Table 1 reports the results for the instances solved by Cplex 11, comparing the solutions and computational times for Cplex 11, the literature, and VNS and ILS algorithms.…”

Section: Computational Resultsmentioning

confidence: 96%

“…The computer reported in [6], a Pentium IV 2.4 GHz, has an estimated power of 4595 MFlops (http://www.activewin.com/reviews/hardware/processors/intel/p424ghz/benchs.shtml), while our computer has an estimated power of 44300 MFlops (http://techgage.com/print/intel_core_2_quad_q6600). Thus, in order to perform a fair comparison between the computational times, we use the rate of 4595/44300 Mflops to adjust the best literature times (fifth column of Table 2).…”

Section: Computational Resultsmentioning

confidence: 99%

“…In McKendall et al [8], a mathematical model is presented and two simulated annealing heuristics are developed. McKendall and Jaramillo [7] presented five constructive methods together with a simple tabu search heuristic. McKendall [6] presented three tabu search heuristics.…”

Section: Idle Resourcesmentioning

confidence: 99%

“…McKendall and Jaramillo [7] presented five constructive methods together with a simple tabu search heuristic. McKendall [6] presented three tabu search heuristics.…”

Section: Idle Resourcesmentioning

confidence: 99%

See 4 more Smart Citations

Efficient Metaheuristics For The Dynamic Space Allocation Problem

Silva¹,

Bahiense²,

Ochi³

et al. 2016

Anais Do 10. Congresso Brasileiro De Inteligência Computacional

View full text Add to dashboard Cite

-This work is devoted to the Dynamic Space Allocation Problem (DSAP), where project duration is divided into a number of consecutive periods, each of them associated with a number of activities. The resources required by the activities have to be available in the corresponding workspaces and those sitting idle during a period have to be stored. This problem contains the Quadratic Assignment Problem (QAP) as a particular case, which places it in the NP-hard class. In this context, the difficulty of identifying optimal solutions, even for instances of medium size, justifies the use of heuristic techniques. This work presents new construction and local search methods and heuristic algorithms based on the VNS and ILS metaheuristics to obtain near optimal solutions for the DSAP. Comp arisons are presented for values obtained by VNS, ILS, and results from the literature. Computational results show the proposed methods to be competitive in relation to instances in the literature and to existing techniques.

show abstract

Section: Computational Resultsmentioning

confidence: 75%

Section: Computational Resultsmentioning

confidence: 96%

Section: Computational Resultsmentioning

confidence: 99%

Section: Idle Resourcesmentioning

confidence: 99%

“…McKendall and Jaramillo [7] presented five constructive methods together with a simple tabu search heuristic. McKendall [6] presented three tabu search heuristics.…”

Section: Idle Resourcesmentioning

confidence: 99%

See 3 more Smart Citations