Scatter Search

Laguna, Manuel

doi:10.1007/978-1-4614-6940-7_5

Cited by 13 publications

(10 citation statements)

References 40 publications

(34 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The improvement method transforms a trial solution into another with higher quality. If there is no improvement to the input trial solution results, then the enhanced solution is considered to be the same as the input solution [23]; •…”

Section: Scatter Search Methodsmentioning

confidence: 99%

Adaptive Scatter Search to Solve the Minimum Connected Dominating Set Problem for Efficient Management of Wireless Networks

et al. 2020

View full text Add to dashboard Cite

An efficient routing using a virtual backbone (VB) network is one of the most significant improvements in the wireless sensor network (WSN). One promising method for selecting this subset of network nodes is by finding the minimum connected dominating set (MCDS), where the searching space for finding a route is restricted to nodes in this MCDS. Thus, finding MCDS in a WSN provides a flexible low-cost solution for the problem of event monitoring, particularly in places with limited or dangerous access to humans as is the case for most WSN deployments. In this paper, we proposed an adaptive scatter search (ASS-MCDS) algorithm that finds the near-optimal solution to this problem. The proposed method invokes a composite fitness function that aims to maximize the solution coverness and connectivity and minimize its cardinality. Moreover, the ASS-MCDS methods modified the scatter search framework through new local search and solution update procedures that maintain the search objectives. We tested the performance of our proposed algorithm using different benchmark-test-graph sets available in the literature. Experiments results show that our proposed algorithm gave good results in terms of solution quality.

show abstract

Section: Scatter Search Methodsmentioning

confidence: 99%

Adaptive Scatter Search to Solve the Minimum Connected Dominating Set Problem for Efficient Management of Wireless Networks

et al. 2020

View full text Add to dashboard Cite

show abstract

“…In this step, the aim is to improve the initial solutions in terms of quality; in the case of non-feasible solutions the aim is to make them feasible. Several improvement methods can be used and the usual rule is to stop the search as soon as no improvement in the neighborhood of the current solution can be found (Laguna, 2014). In this paper, we propose two improvement method versions (Improvement Heuristics): a sequential and parallel bisection search for processing the locations.…”

Section: Improvement Methodsmentioning

confidence: 99%

“…Based on the basic SS framework (e.g. Laguna, 2014, Martí et al, 2006, which consists of five steps, a tailor-made solution approach with regard to how the steps are implemented is proposed for optimizing the (s,S) policies at all locations in J. The metaheuristic searches for promising inventory policies on the following solution space:…”

Section: Determining (Ss) Values: Scatter Search Metaheuristic (Ss)mentioning

confidence: 99%

A simulation–optimization approach for a service-constrained multi-echelon distribution network

Noordhoek

Dullaert

Lai

et al. 2018

Transportation Research Part E: Logistics and Transportation Re

View full text Add to dashboard Cite

Academic research on (s,S) inventory policies for multi-echelon distribution networks with deterministic lead times, backordering, and fill rate constraints is limited. Inspired by a real-life Dutch food retail case we develop a simulation-optimization approach to optimize (s,S) inventory policies in such a setting. We compare the performance of a Nested Bisection Search (NBS) and a novel Scatter Search (SS) metaheuristic using 1280 instances from literature and we derive managerial implications from a real-life case. Results show that the SS outperforms the NBS on solution quality. Additionally, supply chain costs can be saved by allowing lower fill rates at upstream echelons.

show abstract

“…For an overview of the features of this method, we refer to Glover and Laguna [11] and Martí et al [12]. Laguna [13] summarized the basic scatter search framework as five component methods: diversification generation method, improvement method, reference set update method, subset generation method and combination method. The basic scatter search framework is shown in Fig.…”

Section: The Proposed Scatter Search Algorithmmentioning

confidence: 99%

A new scater search approach for the singe machine total weighted tardiness scheduling problem with sequence-dependent setup times

Guo

Tang

2011

The Fourth International Workshop on Advanced Computational Intelligence

View full text Add to dashboard Cite

In this paper, we propose a scatter search based meta-heuristic algorithm to solve the single machine total weighted tardiness problem with sequence-dependent setup times. Both construction heuristics and random strategy based heuristics are adopted to generate the diversified population. A variable neighborhood search based local search method is adopted to improve the trial solutions and the combined solutions. To measure the diversification value between two solutions, we count the number of edges by which the two solutions differ from each other. We also propose a new strategy that the length of the reference set could be adjusted adaptively to balance the computing time and solving ability. Three different combination methods are presented to generate the new trial solutions with the solutions in the subsets. Computational results of the benchmark problems indicate that the proposed method is stable and can find 19 better solutions among the total 120 test problems than the best known solutions. The yielded average relative percentage deviations from the best known solutions and a recent scatter search algorithm were 1.98% and -3.14%.

show abstract

Scatter Search

Cited by 13 publications

References 40 publications

Adaptive Scatter Search to Solve the Minimum Connected Dominating Set Problem for Efficient Management of Wireless Networks

Adaptive Scatter Search to Solve the Minimum Connected Dominating Set Problem for Efficient Management of Wireless Networks

A simulation–optimization approach for a service-constrained multi-echelon distribution network

A new scater search approach for the singe machine total weighted tardiness scheduling problem with sequence-dependent setup times

Contact Info

Product

Resources

About