scholarly journals Hierarchical Search-Embedded Hybrid Heuristic Algorithm for Two-Dimensional Strip Packing Problem

IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 179086-179103 ◽  
Author(s):  
Mengfan Chen ◽  
Kai Li ◽  
Defu Zhang ◽  
Ling Zheng ◽  
Xin Fu
Keyword(s):  
Heuristic Algorithm ◽  
Packing Problem ◽  
Two Dimensional ◽  
Strip Packing ◽  
Hybrid Heuristic ◽  
Hierarchical Search ◽  
Hybrid Heuristic Algorithm

A hybrid heuristic algorithm for the 2D variable-sized bin packing problem

2014 ◽  
Vol 238 (1) ◽  
pp. 95-103 ◽  
Author(s):  
Shaohui Hong ◽  
Defu Zhang ◽  
Hoong Chuin Lau ◽  
XiangXiang Zeng ◽  
Yain-Whar Si
Keyword(s):  
Heuristic Algorithm ◽  
Bin Packing ◽  
Packing Problem ◽  
Hybrid Heuristic ◽  
Bin Packing Problem ◽  
Hybrid Heuristic Algorithm

Hybrid heuristic algorithm for two-dimensional steel coil cutting problem

2012 ◽  
Vol 62 (3) ◽  
pp. 829-838 ◽  
Author(s):  
Weimin Zheng ◽  
Peiyu Ren ◽  
Peng Ge ◽  
Yanqing Qiu ◽  
Zhusheng Liu
Keyword(s):  
Heuristic Algorithm ◽  
Two Dimensional ◽  
Hybrid Heuristic ◽  
Steel Coil ◽  
Hybrid Heuristic Algorithm ◽  
Cutting Problem

scholarly journals Improved Hybrid Heuristic Algorithm Inspired by Tissue-Like Membrane System to Solve Job Shop Scheduling Problem

Processes ◽  
2021 ◽  
Vol 9 (2) ◽  
pp. 219
Author(s):  
Xiang Tian ◽  
Xiyu Liu
Keyword(s):  
Local Search ◽  
Heuristic Algorithm ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Membrane System ◽  
Scheduling Problem ◽  
Job Shop Scheduling Problem ◽  
Hybrid Heuristic ◽  
Shop Scheduling ◽  
Hybrid Heuristic Algorithm

In real industrial engineering, job shop scheduling problem (JSSP) is considered to be one of the most difficult and tricky non-deterministic polynomial-time (NP)-hard problems. This study proposes a new hybrid heuristic algorithm for solving JSSP inspired by the tissue-like membrane system. The framework of the proposed algorithm incorporates improved genetic algorithms (GA), modified rumor particle swarm optimization (PSO), and fine-grained local search methods (LSM). To effectively alleviate the premature convergence of GA, the improved GA uses adaptive crossover and mutation probabilities. Taking into account the improvement of the diversity of the population, the rumor PSO is discretized to interactively optimize the population. In addition, a local search operator incorporating critical path recognition is designed to enhance the local search ability of the population. Experiment with 24 benchmark instances show that the proposed algorithm outperforms other latest comparative algorithms, and hybrid optimization strategies that complement each other in performance can better break through the original limitations of the single meta-heuristic method.

scholarly journals A SAT-based Method for Solving the Two-dimensional Strip Packing Problem

2010 ◽  
Vol 102 (3-4) ◽  
pp. 467-487 ◽  
Author(s):  
Takehide Soh ◽  
Katsumi Inoue ◽  
Naoyuki Tamura ◽  
Mutsunori Banbara ◽  
Hidetomo Nabeshima
Keyword(s):  
Packing Problem ◽  
Two Dimensional ◽  
Strip Packing
Sign in / Sign up

Export Citation Format

Share Document