scholarly journals Hyper-Heuristic Approach for Improving Marker Efficiency

2018 ◽  
Vol 18 (4) ◽  
pp. 348-363
Author(s):  
Daniel Domović ◽  
Tomislav Rolich ◽  
Marin Golub

Abstract Marker planning is an optimization arrangement problem, where a set of cutting parts need to be placed on a thin paper without overlapping to create a marker – an exact diagram of cutting parts that will be cut from a single spread. An optimal marker that utilizes the length of textile material has to be obtained. The aim of this research was to develop novel algorithms for obtaining an efficient marker that would achieve competitive results and optimize the garment production in terms of improving the utilization of textile material. In this research, a novel Grid heuristic was introduced for obtaining a marker, alongside its improvement methods: Grid-BLP and Grid-Shaking. These heuristics were hybridized with genetic algorithm that determined the placement order of cutting parts using the newly introduced All Equal First (AEF) placement order. A novel individual representation for genetic algorithm was designed that was composed of order sequence, rotation detection and the choice of placement algorithm (hyper-heuristic). Experiments were conducted to determine the best marker making method, and hyper-heuristic efficiency. The implementation and experiments were conducted in MATLAB using GEATbx toolbox on five datasets from the garment industry: ALBANO, DAGLI, MAO, MARQUES and MAN SHIRT. Marker efficiency in percentage was recorded with best results: 84.50%, 80.13%, 79.54%, 84.67% and 86.02% obtained for the datasets respectively. The most efficient heuristic was Grid-Shaking. Hyper-heuristic applied Grid-Shaking in 88% of times. The created algorithm is independent of cutting parts’ shape. It can produce markers of arbitrary shape and is flexible in terms of expansion to new instances from the garment industry (leather nesting, avoiding damaged areas of material, marker making with materials with patterns).

2021 ◽  
Vol 94 ◽  
pp. 107356
Author(s):  
Vithya Ganesan ◽  
M. Sobhana ◽  
G. Anuradha ◽  
Pachipala Yellamma ◽  
O. Rama Devi ◽  
...  

Author(s):  
Oshin Sharma ◽  
Hemraj Saini

To increase the availability of the resources and simultaneously to reduce the energy consumption of data centers by providing a good level of the service are one of the major challenges in the cloud environment. With the increasing data centers and their size around the world, the focus of the current research is to save the consumption of energy inside data centers. Thus, this article presents an energy-efficient VM placement algorithm for the mapping of virtual machines over physical machines. The idea of the mapping of virtual machines over physical machines is to lessen the count of physical machines used inside the data center. In the proposed algorithm, the problem of VM placement is formulated using a non-dominated sorting genetic algorithm based multi-objective optimization. The objectives are: optimization of the energy consumption, reduction of the level of SLA violation and the minimization of the migration count.


2020 ◽  
Vol 39 (1) ◽  
pp. 1-14 ◽  
Author(s):  
A.M. Hambali ◽  
Y.A. Olasupo ◽  
M. Dalhatu

There are different approaches used in automating course timetabling problem in tertiary institution. This paper present a combination of genetic algorithm (GA) and simulated annealing (SA) to have a heuristic approach (HA) for solving course timetabling problem in Federal University Wukari (FUW). The heuristic approach was implemented considering the soft and hard constraints and the survival for the fittest. The period and space complexity was observed. This helps in matching the number of rooms with the number of courses. Keywords: Heuristic approach (HA), Genetic algorithm (GA), Course Timetabling, Space Complexity.


Sign in / Sign up

Export Citation Format

Share Document