A hybrid algorithm based on a new neighborhood structure evaluation method for job shop scheduling problem. (October 2015)
- Record Type:
- Journal Article
- Title:
- A hybrid algorithm based on a new neighborhood structure evaluation method for job shop scheduling problem. (October 2015)
- Main Title:
- A hybrid algorithm based on a new neighborhood structure evaluation method for job shop scheduling problem
- Authors:
- Gao, Liang
Li, Xinyu
Wen, Xiaoyu
Lu, Chao
Wen, Feng - Abstract:
- Highlights: We proposed a hybrid PSO and VNS algorithm for job shop scheduling problem. We proposed a new neighborhood structure evaluation method to guide the algorithm design. The proposed algorithm solves the job shop scheduling problem effectively. Proposed algorithm has found many optimal solutions for some famous benchmark problems. Abstract: Job shop scheduling problem (JSP) which is widespread in the real-world production system is one of the most general and important problems in various scheduling problems. Nowadays, the effective method for JSP is a hot topic in research area of manufacturing system. JSP is a typical NP-hard combinatorial optimization problem and has a broad engineering application background. Due to the large and complicated solution space and process constraints, JSP is very difficult to find an optimal solution within a reasonable time even for small instances. In this paper, a hybrid particle swarm optimization algorithm (PSO) based on variable neighborhood search (VNS) has been proposed to solve this problem. In order to overcome the blind selection of neighborhood structures during the hybrid algorithm design, a new neighborhood structure evaluation method based on logistic model has been developed to guide the neighborhood structures selection. This method is utilized to evaluate the performance of different neighborhood structures. Then the neighborhood structures which have good performance are selected as the main neighborhood structuresHighlights: We proposed a hybrid PSO and VNS algorithm for job shop scheduling problem. We proposed a new neighborhood structure evaluation method to guide the algorithm design. The proposed algorithm solves the job shop scheduling problem effectively. Proposed algorithm has found many optimal solutions for some famous benchmark problems. Abstract: Job shop scheduling problem (JSP) which is widespread in the real-world production system is one of the most general and important problems in various scheduling problems. Nowadays, the effective method for JSP is a hot topic in research area of manufacturing system. JSP is a typical NP-hard combinatorial optimization problem and has a broad engineering application background. Due to the large and complicated solution space and process constraints, JSP is very difficult to find an optimal solution within a reasonable time even for small instances. In this paper, a hybrid particle swarm optimization algorithm (PSO) based on variable neighborhood search (VNS) has been proposed to solve this problem. In order to overcome the blind selection of neighborhood structures during the hybrid algorithm design, a new neighborhood structure evaluation method based on logistic model has been developed to guide the neighborhood structures selection. This method is utilized to evaluate the performance of different neighborhood structures. Then the neighborhood structures which have good performance are selected as the main neighborhood structures in VNS. Finally, a set of benchmark instances have been conducted to evaluate the performance of proposed hybrid algorithm and the comparisons among some other state-of-art reported algorithms are also presented. The experimental results show that the proposed hybrid algorithm has achieved good improvement on the optimization of JSP, which also verifies the effectiveness and efficiency of the proposed neighborhood structure evaluation method. … (more)
- Is Part Of:
- Computers & industrial engineering. Volume 88(2015)
- Journal:
- Computers & industrial engineering
- Issue:
- Volume 88(2015)
- Issue Display:
- Volume 88, Issue 2015 (2015)
- Year:
- 2015
- Volume:
- 88
- Issue:
- 2015
- Issue Sort Value:
- 2015-0088-2015-0000
- Page Start:
- 417
- Page End:
- 429
- Publication Date:
- 2015-10
- Subjects:
- Job shop scheduling problem -- Neighborhood structure evaluation -- Logistic model -- Hybrid algorithm
Engineering -- Data processing -- Periodicals
Industrial engineering -- Periodicals
620.00285 - Journal URLs:
- http://www.sciencedirect.com/science/journal/03608352 ↗
http://www.elsevier.com/journals ↗ - DOI:
- 10.1016/j.cie.2015.08.002 ↗
- Languages:
- English
- ISSNs:
- 0360-8352
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library DSC - 3394.713000
British Library DSC - BLDSS-3PM
British Library HMNTS - ELD Digital store - Ingest File:
- 7567.xml