An improved scatter search algorithm for the corridor allocation problem considering corridor width

Zhang, Zeqiang; Mao, Lili; Guan, Chun; Li-xia, Zhu; Wang, Yi

doi:10.1007/s00500-019-03925-4

Cited by 17 publications

(4 citation statements)

References 37 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Amaral [31] and Yang et al [32] proposed mixed-integer programming models for the parallel row ordering problem. Several algorithms were presented to solve the corridor allocation problem, such as simulated annealing and tabu search [33], a permutation-based genetic algorithm hybridized with a local search technique [34], and a scatter search algorithm [35]. Recently, attention was attracted to the space-free multi-row facility layout problem.…”

Section: Related Workmentioning

confidence: 99%

A Variable Neighborhood Search Approach for the Dynamic Single Row Facility Layout Problem

2022

View full text Add to dashboard Cite

The dynamic single row facility layout problem (DSRFLP) is defined as the problem of arranging facilities along a straight line during a multi-period planning horizon with the objective of minimizing the sum of the material handling and rearrangement costs. The material handling cost is the sum of the products of the flow costs and center-to-center distances between facilities. In this paper, we focus on metaheuristic algorithms for this problem. The main contributions of the paper are three-fold. First, a variable neighborhood search (VNS) algorithm for the DSRFLP is proposed. The main version of VNS uses an innovative strategy to start the search from a solution obtained by constructing an instance of the single row facility layout problem (SRFLP) from a given instance of the DSRFLP and applying a heuristic algorithm for the former problem. Second, a fast local search (LS) procedure is developed. The innovations of this procedure are two-fold: (i) the fast insertion and swap neighborhood exploration techniques are adapted for the case of the dynamic version of the SRFLP; and (ii) to reduce the computational time, the swap operation is restricted on pairs of facilities of equal lengths. Provided the number of planning periods is a constant, the neighborhood exploration procedures for n facilities have only O(n2) time complexity. The superiority of these procedures over traditional LS techniques is also shown by performing numerical tests. Third, computational experiments on DSRFLP instances with up to 200 facilities and three or five planning periods are carried out to validate the effectiveness of the VNS approach. The proposed VNS heuristic is compared with the simulated annealing (SA) method which is the state of the art algorithm for the DSRFLP. Experiments show that VNS outperforms SA by a significant margin.

show abstract

Section: Related Workmentioning

confidence: 99%

A Variable Neighborhood Search Approach for the Dynamic Single Row Facility Layout Problem

2022

View full text Add to dashboard Cite

show abstract

“…González-Velarde et al [145] introduced SS to increase the number of tolls and maintain the optimal traffic flow for transportation network. Zhang et al [146] proposed an improvement in SS (ISS) to solve the corridor allocation problem. e improvement procedures were designed to handle the specific characteristics of allocation problem.…”

Section: Image Processingmentioning

confidence: 99%

A Comprehensive Review on Scatter Search: Techniques, Applications, and Challenges

Kalra

Yadav

Kumar

et al. 2021

Mathematical Problems in Engineering

View full text Add to dashboard Cite

Recent years have witnessed the use of metaheuristic algorithms to solve the optimization problems that usually require extensive computations and time. Among others, scatter search is the widely used evolutionary metaheuristic algorithm. It uses the information of global optima, which is stored in a different and unique set of solutions. In this paper, an updated review of scatter search (SS) is given. SS has been successfully applied in a variety of research problems, namely, data mining, bioinformatics, and engineering design. This paper presents the modified and hybrid versions of SS with their applications. The control strategies are discussed to show their impact on the performance of SS. various issues and future directions related to SS are also discussed. It inspires innovative researchers to use this algorithm for their research domains.

show abstract

“…Kalita et al [30] further studied a bi-objective SF-DRLP and proposed a permutation-based genetic algorithm incorporating a promising local search technique to solve SF-DRLP. Zhang et al [31] established a mixed integer programming model for SF-DRLP, which considers the effect of the corridor width. Moreover, they proposed an improved scatter search algorithm for SR-DRLP, which includes several improvement mechanisms, such as the adoption of a simulated annealing operation, a dynamic reference set update method, and an improved subset generation.…”

Section: Related Literaturementioning

confidence: 99%

A Surrogate Model-Based Hybrid Approach for Stochastic Robust Double Row Layout Problem

2021

View full text Add to dashboard Cite

The double row layout problem is to arrange a number of machines on both sides of a straight aisle so as to minimize the total material handling cost. Aiming at the random distribution of product demands, we study a stochastic robust double row layout problem (SR-DRLP). A mixed integer programming (MIP) model is established for SR-DRLP. A surrogate model is used to linearize the nonlinear term in the MIP to achieve a mixed integer linear programming model, which can be readily solved by an exact method to yield high-quality solutions (layouts) for small-scale SR-DRLPs. Furthermore, we propose a hybrid approach combining a local search and an exact approach (LS-EA) to solve large-scale SR-DRLPs. Firstly, a local search is designed to optimize the machine sequences on two rows and the clearance from the most left machine on row 1 to the left boundary. Then, the exact location of each machine is further optimized by an exact approach. The LS-EA is applied to six problem instances ranging from 8 to 50 machines. Experimental results show that the surrogate model is effective and LS-EA outperforms the comparison approaches.

show abstract

An improved scatter search algorithm for the corridor allocation problem considering corridor width

Cited by 17 publications

References 37 publications

A Variable Neighborhood Search Approach for the Dynamic Single Row Facility Layout Problem

A Variable Neighborhood Search Approach for the Dynamic Single Row Facility Layout Problem

A Comprehensive Review on Scatter Search: Techniques, Applications, and Challenges

A Surrogate Model-Based Hybrid Approach for Stochastic Robust Double Row Layout Problem

Contact Info

Product

Resources

About