# Hyperheuristic Based Migrating Birds Optimization Algorithm for a Fairness Oriented Shift Scheduling Problem

Authors: Gözde Alp; Ali Fuat Alkaya
Journal: Mathematical Problems in Engineering
 (2021)

---

## Abstract

The purpose of this paper is twofold. First, it introduces a new hybrid computational intelligence algorithm to the optimization community. This novel hybrid algorithm has hyperheuristic (HH) neighborhood search movements embedded into a recently introduced migrating birds optimization (MBO) algorithm. Therefore, it is called HHMBO. Second, it gives the necessary mathematical model for a shift scheduling problem of a manufacturing company defined by including the fairness perspective, which is typically ignored especially in manufacturing industry. Therefore, we call this complex optimization problem fairness oriented integrated shift scheduling problem (FOSSP). HHMBO is applied on FOSSP and is compared with the well-known simulated annealing, hyperheuristics, and classical MBO algorithms through extended computational experiments on several synthetic datasets. Experiments demonstrate that the new hybrid computational intelligence algorithm is promising especially for large sized instances of the specific problem defined here. HHMBO has a high exploration capability and is a promising technique for all optimization problems. To justify this assertion, we applied HHMBO to the well-known quadratic assignment problem (QAP) instances from the QAPLIB. HHMBO was up to 14.6% better than MBO on converging to the best known solutions for QAP benchmark instances with different densities. We believe that the novel hybrid method and the fairness oriented model presented in this study will give new insights to the decision-makers in the industry as well as to the researchers from several disciplines.


---

## Body

## 1. Introduction

Workforce scheduling has been a subject of continued research and commercial interest in several disciplines due to its important practical applications within the context of intelligent systems. Workforce scheduling is a concept that embraces a variety of scheduling problems, also referred to as manpower scheduling and personnel scheduling in the literature. Constructing efficient and equitable schedules is a challenging issue requiring time and labor cost for the companies with high number of employees.The real world problem we tackled aims to provide fair personnel work schedules for a large-scale manufacturing company that works 24 hours and seven days a week. Personnel requirements for each day and shift differ and are updated periodically. Employee requirement changes every four weeks, regularly. On the other hand, there is a high rate of employee circulation. Large numbers of new employees are recruited and large numbers of employees leave at the end of each period. Therefore, possible maximum level of fairness within each planning period is sought. There are also some essential legal regulations for employee schedules which make the problem much more complicated. The problem is described in detail in Section3.The presented problem has a sophisticated solution space. We have envisioned that exploring the solution space by more than one neighborhood search method could contribute to finding promising results. Hyperheuristics is a widely known way of applying multiple heuristic techniques. On the other hand, recently proposed migrating birds optimization algorithm is receiving growing attention from the researchers, due to the ability of providing good quality solutions over a wide range of instances of a problem. As a result, we wanted to integrate the exploitation capability of MBO with HH’s exploration capability for solving the problem. Consequently, we introduce a novel technique that has hyperheuristic movements embedded in the migrating birds optimization algorithm (HHMBO). To the best of our knowledge, there has been no investigation about hybridizing hyperheuristics with MBO in the literature. HHMBO is compared with the well-known algorithms, and it is shown that the proposed hybrid algorithm is promising especially for large sized instances of FOSSP.HHMBO obtains very successful results on the FOSSP model. Hence, we believe HHMBO is also promising for the other combinatorial optimization problems. Therefore, we aimed to measure its performance on a widely tackled problem’s benchmark instances. Based on this idea, we have implemented HHMBO on the quadratic assignment problem (QAP). As a result, HHMBO is again found to be very successful on converging to the best known solutions for QAP instances with different densities. We should note that the data as well as the source codes of the programming framework can be found athttp://mimoza.marmara.edu.tr/falkaya/research.htm.The contribution of this study is threefold: (i) defining and validating the mathematical model of the fairness oriented shift scheduling problem (FOSSP), (ii) proposing a new hybrid metaheuristic algorithm that is composed of hyperheuristic movements embedded in migrating birds optimization (HHMBO), and (iii) showing the superiority of HHMBO through computational experiments conducted on both FOSSP dataset and well-known QAP benchmark instances.The remainder of the manuscript is organized as follows: Literature review is presented in Section2, and problem description details are presented in Section 3. Proposed solution techniques are described in detail in Section 4. Experimental setup is demonstrated in Section 5. Results are presented and investigated in Section 6. Section 7 concludes the paper and comprises suggestions for further research.


## 2. Literature Review

Many scientific studies have been examined in order to locate the problem that we have dealt with. Ernst et al. [1] offered a guide study that consisted of an annotated bibliography of personnel scheduling. There are also many review studies that extensively examine the workforce scheduling literature [2–6]. Brucker et al. [7] categorized the shift scheduling problems. Baker classified workforce scheduling problems into three types [8]: shift scheduling problem, days-off scheduling problem, and tour scheduling problem. Shift scheduling involves selecting a set of the most suitable shifts from a (large) pool of candidate shifts on a single day by satisfying employee requirement in each time slot. On the other hand, the main concern in days-off scheduling is to determine the off-work days for each worker over the rostering horizon rather than to assign the worker particular shifts on working days. In contrast to days-off scheduling, tour scheduling chooses off days for the workers and decides shift types for each of their working days over the planning horizon. Mathematical model of tour scheduling problem is summarized and problem classification is presented by Alfares [9]. Erhard et al. [4] presented the first review study that focuses on quantitative methods for physician scheduling literature. They indicated in their study that it is more common to include fairness aspects for physician scheduling domain than to ignore them.Many different workforce scheduling problem models are presented up to now. A new mathematical formulation for mine shift scheduling is presented by Seifi et al. [10]. Brunner and Stolletz [11] prepared a schedule for the employees in check-in counters at airport. Atlason et al. [12] presented a shift assignment study in which planning horizon is divided into short periods. Morris and Showalter [13] presented a rewarding study that clarifies the usage of set covering formulation for shift scheduling, days-off scheduling, and tour scheduling problems ([14–16]). Alfares [17] proposed a specific type of days-off scheduling, solved by proposed solution technique. Altner et al. [18] presented a days-off scheduling formulation. Lau [19] introduced a special tour scheduling problem.The model we offer in this study associates tour scheduling problem and employee assignment problem and incarnates them as a single problem by overseeing the fairness issue. We call this integrated problem fairness oriented shift scheduling problem (FOSSP), in which schedules are constructed for employees during the planning period where the objective is providing fairness among all workers. The problem we are tackling is undertaken by solving the tour scheduling and employee assignment problems consecutively in [20]. However, obtaining solutions to subproblems gives suboptimal results. Therefore, an integrated solution approach is necessary. The mathematical model of FOSSP is built from scratch and then the model is implemented with a solver. However, the solver finds the optimum result but with an exponential growth in run time, due to the NP-Hard nature of the problems. Therefore, heuristics and/or metaheuristic approaches that provide reasonable solutions for the problem are needed.Many metaheuristic based solution techniques have been applied for solving the workforce scheduling problems so far. They include artificial bee colony algorithm [21], particle swarm optimization [22], migrating birds optimization [23], genetic algorithm (GA) [24], an adaptive multiple crossover GA [25], and a modified differential evolution (DE) algorithm ( [26–29]). A tabu-search hyperheuristics solution for nurse scheduling problem is presented in Burke et al.’s work [30]. Pan et al. [31] proposed a hybrid heuristic, combining tabu search and large neighborhood search techniques. Hernández-Leandro et al. [32] presented a Lagrangian relaxation and a metaheuristic for the multiactivity shift scheduling problem. A hybrid discrete water wave optimization algorithm is presented for scheduling problems [33].Combinatorial optimization problems have a sophisticated solution space and a single improvement technique is insufficient to obtain promising results. More than one neighborhood search method with different characteristics may be promising to obtain more efficient exploration in the solution space. One widely known way of applying multiple heuristic techniques is hyperheuristics. Hyperheuristics (HH) is a metaheuristic technique formally defined as a heuristic to select and manage a set of low level heuristics. Many HH variations for optimization and scheduling problems have been defined up to now, such as tensor based hyperheuristic for nurse scheduling [34], column based hyperheuristic for bus driver scheduling problem [35], tabu-search hyperheuristics [30], and a simulated annealing hyperheuristic [36]. Hyperheuristics are also integrated with swarm based computational intelligence techniques such as hybrid particle swarm optimization [37], ant colony optimization based hyperheuristic [38], and hyperheuristic based artificial bee colony algorithm [39]. On the other hand, Duman et al. [40] recently proposed a new metaheuristic algorithm named migrating birds optimization (MBO). They applied their algorithm to quadratic assignment problems (QAP) and proved its efficiency.


## 3. Problem Description

In this section, we try to define and clarify the proposed and tackled problem. Firstly, the properties and limitations of the problem are explained. Then, cost measurement method is described. Lastly, the mathematical model of FOSSP is presented. The terms time period, time slot, and working slot are used interchangeably throughout this manuscript.


### 3.1. Properties and Limitations of the Problem

The main motivation behind defining this new problem is obtaining a fair distribution of working slots (time periods) among fixed number of employees during the specified planning period. Production factory operates incessantly 24 hours a day, seven days a week. There are totally three shifts in each day; those are day shift, evening shift, and night shift. Employee requirement list contains weekly employee demand for each day of the week and each shift of a day. The planning horizon which is specified as four weeks in our case may consist of several weeks. Employee requirement list is updated by management department at the end of each period, and same the requirement list is valid for all weeks in planning horizon. Multiweek employee schedules are prepared supplying personnel demand. That is, the output schedule must satisfy the number of workers needed for each day and shift, besides ensuring a fair distribution between employees along the given weeks.Additionally, there are some essential legal regulations for employee schedules. Some of those rules may be listed as follows; if an employee has night shift on Sunday, (s)he cannot be assigned to day shift on the following Monday; if an employee has weekend off, he/she cannot be off on adjacent Monday and an employee cannot work more than six consecutive days. These additional legal constraints increase the complexity of the problem. Under these constraints, the aim is to provide a fair schedule distribution among employees throughout the planning period. Employees are assigned to a specific stationary shift type during one week and each employee has two off days. However, for each worker, shift types and off days may change from one week to another.


### 3.2. Determination of Schema Costs

A tour or a schema may be defined by a seven-lettered string containing D, E, N, or X which mean day shift, evening shift, night shift, and off day, respectively, and each letter corresponds to the days of the week starting from Monday up to Sunday. An example schema string is “XXEEEEE” which means Monday and Tuesday are off and the week continues with five successive evening shifts. Thus, there occur exactly 63 different schemata with three shift types and two days off rules.Three shifts in a day (namely, day, evening, and night) and seven days of the week make a total of 21 time slots, starting from Monday day shift and ending with Sunday night shift. In the factory, day shift is between 07:00 and 15:00, evening shift is between 15:00 and 23:00, and night shift is between 23:00 and 07:00. Each employee is assigned to one of those shifts each week; additionally each employee has two off days during a week.Taking individual employee preferences into account while modeling the problem was not appropriate, as it would make the already complex problem unsolvable. Hereby, the preferability of time zones has been determined by a survey conducted with the employees. We had classified the off days according to their desirability. We have identified five off day types: (i) weekend off, (ii) Friday-Saturday off, (iii) Sunday-weekday off, (iv) consecutive weekday off, and (v) separate weekday off. For determining the quality of a schema, we assigned numerical values to off day types and shift types. Based on the survey results obtained, enumerations for shift types are determined as one, two, and three for day, evening, and night shifts, respectively. Similarly, off day types, weekend off, Friday-Saturday off, Sunday-weekday off, consecutive weekday off, and separate weekday off, are enumerated from one to five, respectively (Table1).Table 1
Shift type and off day type enumeration.
TypeCostDay shift1Evening shift2Night shift3Weekend off1Friday-Saturday off2Sunday-weekday off3Consecutive weekday off4Separate weekday off5Each schema (out of 63 schemata) has a predetermined cost, obtained by the multiplication of its off day type enumeration and shift type enumeration. An illustrative cost calculation example for some of the schemata is given in Table2. One can easily recognize that more preferable schemata have lower cost when the schema cost calculation is examined. So, the objective of the problem turns out to be minimizing the cost. As an example, “DDDDDXX” is the most preferred and lowest cost tour.Table 2
Some examples regarding schema cost computation.
SchemaStringc (s)21DDDDDXX1 (1 ∗ 1)42EEEEEXX2 (1 ∗ 2)63NNNNNXX3 (1 ∗ 3)8DXDXDDD5 (5 ∗ 1)29EXEXEEE10 (5 ∗ 2)50NXNXNNN15 (5 ∗ 3)A small sample requirement input for four employees is illustrated in Table3. Schema ID is schema identifier; a schema may be identified by a number between one and 63. FOSSP scheduling decides schema usage quantities by caring for the employee requirements in each time period. The requirements for Monday day shift and evening shift are zero and no employees are assigned to day shift on Monday. The requirement for Monday night shift is one and one employee will be assigned to night shift on Monday with schema ID 63. FOSSP output satisfies employee requirements by selecting the most suitable schema with the required usage quantity.Table 3
Sample requirement input.
Time slot IDDefinitionRequirement1Monday day shift02Monday evening shift03Monday night shift14Tuesday day shift15Tuesday evening shift16Tuesday night shift17Wednesday day shift18Wednesday evening shift19Wednesday night shift110Thursday day shift211Thursday evening shift112Thursday night shift113Friday day shift214Friday evening shift015Friday night shift116Saturday day shift217Saturday evening shift118Saturday night shift019Sunday day shift220Sunday evening shift121Sunday night shift0Since the requirements are the same for all weeks during the planning period (four weeks in our case), the same usage quantity of each schema must be used for each week. The sample output of FOSSP is given in Table4; schema ID 1 is assigned to employee one and employee three in week one, two other employees in week two, and so on. Schema ID 2 is not assigned to anyone. Schema ID 25 is assigned to one employee and schema ID 63 is assigned to one employee in each week. The problem assigns the same schemas with same quantities to different employees for given number of weeks.Table 4
Schema and employee assignments for four weeks.
Employee IDWeek 1Week 2Week 3Week 41112563263251131631254251631


### 3.3. Fairness Oriented Shift Scheduling Problem Model

The scheduling problem we handled in this study was modeled as two consecutive problems in previous studies. Tour scheduling problem and employee assignment problem [20] are jointly sufficient to define this particular scheduling issue. Note that tour scheduling problem reduces to set covering problem [13] which is NP-Hard. Similarly employee assignment problem reduces to the generalized assignment problem [14] which is also shown to be NP-Hard. Since FOSSP corresponds to the combination of both problems, it is also NP-Hard. Solving the problem as two subproblems offers suboptimal solutions; however, whole parts of the issue are significant and we need to find a solution for an integrated single problem. FOSSP is the first sample that put those problems together and solves them as a unique problem in literature, to the best of our knowledge. In the following, we provide the necessary notation and then the mathematical formulation of FOSSP.xws is the number of times schema s is used for each week w,S is the set of schemas (remember that a schema is a seven-lettered string denoting the shift types and off days; each schema is denoted by a number from 1 to 63),T represents the time slots of week (there are totally 21 time slots in a week; each day contains three shifts (planning time slot), and seven days comprise 21 time slots similarly; each time slot is denoted by a number from 1 to 21),E is the set of employees,W is the set of weeks,cs is the cost of schema s,rt is the requirement (number of required workers) at time slot t,(1)Aews=1,if employeeeassigned to schemasin weekw,0,otherwise,Aews is the assignment variable and shows the assignments of each employee e for each week w and for each schema s. A is equal to one if an employee e is assigned to schema s in week w, and it is equal to zero otherwise,(2)bst=1,if schemascovers times lott,0,otherwise,bst indicates the time slot coverage of each schema. If schema s comprises time slot t then b is equal to one and it is equal to zero otherwise. M=∑s∑w∑eAews∗cs/E is the average cost value for all employees, calculated by total of schema assignment number and schema cost multiplication, divided by the number of employees,Ne=∑w∑sAews∗c∗cs is the all weeks’ total cost value. This value is calculated separately for each employee. If employee e is assigned to schema s during week w, Aews variable is equal to one and schema cost is added to the total. The sum of all weeks’ schema costs is calculated and divided by total number of planning week number W. So average cost value is calculated for each employee,De=M−Ne2 is the sum of squared distances of each employee individual total Ne and the general mean total M. The sum of square deviations which measures the pairwise differences is one of the inequality indices widely applied in the literature [41, 42],(3)minimize∑eDe,(4)∑sAews=1,for∀e,w,(5)∑eAews=xws,for∀w,s,(6)∑sxwsbst≥rt,for∀w,t.The objective is minimizing the squared distances of each employee so that maximum fairness is sought. Constraint (4) means that each employee is assigned to only one schema in each week. Constraint (5) ensures that the total number of employees assigned to schema s for each week is equal to xws (number of total employee assignments in each week and for each schema). Constraint (6) ensures that requirement in each time slot t (i.e., the required number of employees) is satisfied.(7)Aews∗bs21+Aew+1s1∗bs11≤1,for∀e,w,s,s1,(8)∑k=1621Aews∗bsk+∑k=13Aew+1s1∗bs1k≥1,for∀e,w,s,s1,(9)∑k=3q+121Aews∗bsk+∑k=13qAew+1s1∗bs1k≤6,forq=0…6for∀e,w,s,s1,(10)s,s1∈S,t,k∈T,e∈E,w,w+1∈W.Variablesw+1 and s1 are used in constraints five to seven. w+1 demonstrates the following week and s1 corresponds to the schema assignment of the following week.Additional constraints (equations (7)–(9)) may be explained as follows: Constraint five carries out the rule; if employee has night shift on Sunday, (s)he cannot be assigned to day shift on adjacent Monday. Time slot 21 corresponds to Sunday night shift and time slot 1 corresponds to Monday day shift (Table 3). This constraint prevents assigning any two employees to adjacent shifts for consecutive weeks w and w+1. Another legal regulation is that if an employee has weekend off, he/she cannot be off on Monday (the first day of the next week), implemented by constraint six. Time slot numbers from 16 to 21 embrace weekend period, while time slots 1 to 3 correspond to three shifts of Monday. Total assignment for those three days must be greater than or equal to one. Hence, if someone had weekend off, that person will work on Monday of the next week (w+1), or in other words an employee cannot be off for three consecutive days. Constraint seven enforces the rule; an employee cannot work for more than six days consecutively. If q is equal to zero, it checks only the first week; if q is equal to one, it calculates the total for six days of first week starting from Tuesday and one day (Monday) from second week and so on.The proposed model is implemented using GAMS software. Tests are done in GAMS for small dataset and the results are demonstrated in Section6. However, for the large-scale real-world requirements, we have implemented heuristic based solution techniques and developed a novel hybrid technique described in detail in the next section.


## 3.1. Properties and Limitations of the Problem

The main motivation behind defining this new problem is obtaining a fair distribution of working slots (time periods) among fixed number of employees during the specified planning period. Production factory operates incessantly 24 hours a day, seven days a week. There are totally three shifts in each day; those are day shift, evening shift, and night shift. Employee requirement list contains weekly employee demand for each day of the week and each shift of a day. The planning horizon which is specified as four weeks in our case may consist of several weeks. Employee requirement list is updated by management department at the end of each period, and same the requirement list is valid for all weeks in planning horizon. Multiweek employee schedules are prepared supplying personnel demand. That is, the output schedule must satisfy the number of workers needed for each day and shift, besides ensuring a fair distribution between employees along the given weeks.Additionally, there are some essential legal regulations for employee schedules. Some of those rules may be listed as follows; if an employee has night shift on Sunday, (s)he cannot be assigned to day shift on the following Monday; if an employee has weekend off, he/she cannot be off on adjacent Monday and an employee cannot work more than six consecutive days. These additional legal constraints increase the complexity of the problem. Under these constraints, the aim is to provide a fair schedule distribution among employees throughout the planning period. Employees are assigned to a specific stationary shift type during one week and each employee has two off days. However, for each worker, shift types and off days may change from one week to another.


## 3.2. Determination of Schema Costs

A tour or a schema may be defined by a seven-lettered string containing D, E, N, or X which mean day shift, evening shift, night shift, and off day, respectively, and each letter corresponds to the days of the week starting from Monday up to Sunday. An example schema string is “XXEEEEE” which means Monday and Tuesday are off and the week continues with five successive evening shifts. Thus, there occur exactly 63 different schemata with three shift types and two days off rules.Three shifts in a day (namely, day, evening, and night) and seven days of the week make a total of 21 time slots, starting from Monday day shift and ending with Sunday night shift. In the factory, day shift is between 07:00 and 15:00, evening shift is between 15:00 and 23:00, and night shift is between 23:00 and 07:00. Each employee is assigned to one of those shifts each week; additionally each employee has two off days during a week.Taking individual employee preferences into account while modeling the problem was not appropriate, as it would make the already complex problem unsolvable. Hereby, the preferability of time zones has been determined by a survey conducted with the employees. We had classified the off days according to their desirability. We have identified five off day types: (i) weekend off, (ii) Friday-Saturday off, (iii) Sunday-weekday off, (iv) consecutive weekday off, and (v) separate weekday off. For determining the quality of a schema, we assigned numerical values to off day types and shift types. Based on the survey results obtained, enumerations for shift types are determined as one, two, and three for day, evening, and night shifts, respectively. Similarly, off day types, weekend off, Friday-Saturday off, Sunday-weekday off, consecutive weekday off, and separate weekday off, are enumerated from one to five, respectively (Table1).Table 1
Shift type and off day type enumeration.
TypeCostDay shift1Evening shift2Night shift3Weekend off1Friday-Saturday off2Sunday-weekday off3Consecutive weekday off4Separate weekday off5Each schema (out of 63 schemata) has a predetermined cost, obtained by the multiplication of its off day type enumeration and shift type enumeration. An illustrative cost calculation example for some of the schemata is given in Table2. One can easily recognize that more preferable schemata have lower cost when the schema cost calculation is examined. So, the objective of the problem turns out to be minimizing the cost. As an example, “DDDDDXX” is the most preferred and lowest cost tour.Table 2
Some examples regarding schema cost computation.
SchemaStringc (s)21DDDDDXX1 (1 ∗ 1)42EEEEEXX2 (1 ∗ 2)63NNNNNXX3 (1 ∗ 3)8DXDXDDD5 (5 ∗ 1)29EXEXEEE10 (5 ∗ 2)50NXNXNNN15 (5 ∗ 3)A small sample requirement input for four employees is illustrated in Table3. Schema ID is schema identifier; a schema may be identified by a number between one and 63. FOSSP scheduling decides schema usage quantities by caring for the employee requirements in each time period. The requirements for Monday day shift and evening shift are zero and no employees are assigned to day shift on Monday. The requirement for Monday night shift is one and one employee will be assigned to night shift on Monday with schema ID 63. FOSSP output satisfies employee requirements by selecting the most suitable schema with the required usage quantity.Table 3
Sample requirement input.
Time slot IDDefinitionRequirement1Monday day shift02Monday evening shift03Monday night shift14Tuesday day shift15Tuesday evening shift16Tuesday night shift17Wednesday day shift18Wednesday evening shift19Wednesday night shift110Thursday day shift211Thursday evening shift112Thursday night shift113Friday day shift214Friday evening shift015Friday night shift116Saturday day shift217Saturday evening shift118Saturday night shift019Sunday day shift220Sunday evening shift121Sunday night shift0Since the requirements are the same for all weeks during the planning period (four weeks in our case), the same usage quantity of each schema must be used for each week. The sample output of FOSSP is given in Table4; schema ID 1 is assigned to employee one and employee three in week one, two other employees in week two, and so on. Schema ID 2 is not assigned to anyone. Schema ID 25 is assigned to one employee and schema ID 63 is assigned to one employee in each week. The problem assigns the same schemas with same quantities to different employees for given number of weeks.Table 4
Schema and employee assignments for four weeks.
Employee IDWeek 1Week 2Week 3Week 41112563263251131631254251631


## 3.3. Fairness Oriented Shift Scheduling Problem Model

The scheduling problem we handled in this study was modeled as two consecutive problems in previous studies. Tour scheduling problem and employee assignment problem [20] are jointly sufficient to define this particular scheduling issue. Note that tour scheduling problem reduces to set covering problem [13] which is NP-Hard. Similarly employee assignment problem reduces to the generalized assignment problem [14] which is also shown to be NP-Hard. Since FOSSP corresponds to the combination of both problems, it is also NP-Hard. Solving the problem as two subproblems offers suboptimal solutions; however, whole parts of the issue are significant and we need to find a solution for an integrated single problem. FOSSP is the first sample that put those problems together and solves them as a unique problem in literature, to the best of our knowledge. In the following, we provide the necessary notation and then the mathematical formulation of FOSSP.xws is the number of times schema s is used for each week w,S is the set of schemas (remember that a schema is a seven-lettered string denoting the shift types and off days; each schema is denoted by a number from 1 to 63),T represents the time slots of week (there are totally 21 time slots in a week; each day contains three shifts (planning time slot), and seven days comprise 21 time slots similarly; each time slot is denoted by a number from 1 to 21),E is the set of employees,W is the set of weeks,cs is the cost of schema s,rt is the requirement (number of required workers) at time slot t,(1)Aews=1,if employeeeassigned to schemasin weekw,0,otherwise,Aews is the assignment variable and shows the assignments of each employee e for each week w and for each schema s. A is equal to one if an employee e is assigned to schema s in week w, and it is equal to zero otherwise,(2)bst=1,if schemascovers times lott,0,otherwise,bst indicates the time slot coverage of each schema. If schema s comprises time slot t then b is equal to one and it is equal to zero otherwise. M=∑s∑w∑eAews∗cs/E is the average cost value for all employees, calculated by total of schema assignment number and schema cost multiplication, divided by the number of employees,Ne=∑w∑sAews∗c∗cs is the all weeks’ total cost value. This value is calculated separately for each employee. If employee e is assigned to schema s during week w, Aews variable is equal to one and schema cost is added to the total. The sum of all weeks’ schema costs is calculated and divided by total number of planning week number W. So average cost value is calculated for each employee,De=M−Ne2 is the sum of squared distances of each employee individual total Ne and the general mean total M. The sum of square deviations which measures the pairwise differences is one of the inequality indices widely applied in the literature [41, 42],(3)minimize∑eDe,(4)∑sAews=1,for∀e,w,(5)∑eAews=xws,for∀w,s,(6)∑sxwsbst≥rt,for∀w,t.The objective is minimizing the squared distances of each employee so that maximum fairness is sought. Constraint (4) means that each employee is assigned to only one schema in each week. Constraint (5) ensures that the total number of employees assigned to schema s for each week is equal to xws (number of total employee assignments in each week and for each schema). Constraint (6) ensures that requirement in each time slot t (i.e., the required number of employees) is satisfied.(7)Aews∗bs21+Aew+1s1∗bs11≤1,for∀e,w,s,s1,(8)∑k=1621Aews∗bsk+∑k=13Aew+1s1∗bs1k≥1,for∀e,w,s,s1,(9)∑k=3q+121Aews∗bsk+∑k=13qAew+1s1∗bs1k≤6,forq=0…6for∀e,w,s,s1,(10)s,s1∈S,t,k∈T,e∈E,w,w+1∈W.Variablesw+1 and s1 are used in constraints five to seven. w+1 demonstrates the following week and s1 corresponds to the schema assignment of the following week.Additional constraints (equations (7)–(9)) may be explained as follows: Constraint five carries out the rule; if employee has night shift on Sunday, (s)he cannot be assigned to day shift on adjacent Monday. Time slot 21 corresponds to Sunday night shift and time slot 1 corresponds to Monday day shift (Table 3). This constraint prevents assigning any two employees to adjacent shifts for consecutive weeks w and w+1. Another legal regulation is that if an employee has weekend off, he/she cannot be off on Monday (the first day of the next week), implemented by constraint six. Time slot numbers from 16 to 21 embrace weekend period, while time slots 1 to 3 correspond to three shifts of Monday. Total assignment for those three days must be greater than or equal to one. Hence, if someone had weekend off, that person will work on Monday of the next week (w+1), or in other words an employee cannot be off for three consecutive days. Constraint seven enforces the rule; an employee cannot work for more than six days consecutively. If q is equal to zero, it checks only the first week; if q is equal to one, it calculates the total for six days of first week starting from Tuesday and one day (Monday) from second week and so on.The proposed model is implemented using GAMS software. Tests are done in GAMS for small dataset and the results are demonstrated in Section6. However, for the large-scale real-world requirements, we have implemented heuristic based solution techniques and developed a novel hybrid technique described in detail in the next section.


## 4. Proposed Solution Methods

In this section, the solution methods are clarified. Initial individual generation process for FOSSP, hyperheuristics, simulated annealing, migrating birds optimization algorithms, and a novel hybrid algorithm, which is one of the most important contributions of this study, are explained, respectively.


### 4.1. Initial Individual Generation for FOSSP

Recall from the small example that the ultimate output of FOSSP is a matrix containing schema numbers assigned to employees for each week. Therefore, a solution (also called an individual) to a problem instance will refer to a feasible output in the remainder of the manuscript. Again, recall that, due to the nature of the problem, same set of schema numbers are used in each week with different permutations. A sample FOSSP individual is illustrated in Table5 for ten employees and four weeks. Employee number one is assigned to schema number five in week one, employee number two is assigned to schema twenty in week one, and so on.Table 5
Sample four-week, ten-employee FOSSP individual.
Weeke1e2e3e4e5e6e7e8e9e101520303540535881827281827303540535852038182753584030355204405327303581858520We want to remind that requirement list is updated periodically before preparing the schedules and the requirements are the same for all weeks in planning horizon. Initial individual creation progress of FOSSP is as follows: Schemas are assigned to employees for the first week satisfying the requirements in each time interval. The schedules of subsequent weeks (week two, week three, etc.) are constructed by shuffling assigned schema values in week one. Additional controls for meeting the requirements and controlling official rules are also taken into account.


### 4.2. Hyperheuristics

Hyperheuristics (HH) is a neighborhood search technique used for selecting, applying, and managing low-level heuristics and it is widely used in solving combinatorial optimization problems [43]. Pseudocode of the HH is presented in Algorithm 1. HH has two important functionalities, one of which is heuristic selection mechanism and the other is the move acceptance mechanism. Heuristic selection mechanism is responsible for selecting a low-level heuristic within the pool. Move acceptance mechanism decides whether to accept new solutions or not. In our implementation, simple random heuristic selection, random permutation heuristic selection, and adaptive searching heuristic selection strategies are used. Only Improvement and Monte Carlo acceptance strategies are exploited as acceptance strategies. Now let us explain the low-level heuristics applied for tackled problems, respectively.


#### 4.2.1. Low-Level Heuristics for FOSSP

There are totally four low-level heuristics for FOSSP in this study. Each heuristic checks the additional constraints specified in the model.Heuristic 1 (H1): H1 selects a random schema among the ones that are already assigned to an employee. Another random schema is selected with tournament selection with size five. Five schemas are selected randomly among 63 schemas, and one of those five schemas is chosen as second schema. Tournament selection increases the possibility of choosing a lower cost schema.Heuristic 2 (H2): H2 randomly selects two employees for each week and swaps their schema assignment values.Heuristic 3 (H3): H3 selects two employees randomly for each week and inserts the schema value in subsequent location to the next place in prior employee location.Heuristic 4 (H4): H4 selects two employees randomly for each week and inverts schema assignment values between these employee locations.


#### 4.2.2. Low-Level Heuristics for QAP

Four low-level heuristics are implemented on QAP. Those may be explained basically as follows:Swap: Swap heuristic simply selects two points in a QAP individual and relocates their places.Insert: Two random points are selected within an individual and the subsequent one is placed right after the first random point. All points between selected points move one step to the right.Inverse: Two random points are selected within an individual. All assignments between the selected points are reversed.Scramble: Two random points are selected on an individual. Assignments between the selected points are scrambled.


#### 4.2.3. Heuristic Selection Strategies

Selecting the low-level heuristics requires a strategy. We applied three different heuristic selection strategies. These are simple random (SR), random permutation (RP), and adaptive searching (AS).(i)
SR randomly selects one of the low-level heuristics and applies it only once.(ii)
RP firstly constructs a permutation of low-level heuristics and applies each one once according to the permutation.(iii)
AS is a smart selection mechanism that we designed in this study. Each low-level heuristic has an equal initial score (Ri) and those scores are updated during the run. If heuristic improves the solution, its score is increased as much as the change quantity (Cq); if it worsens the solution, its score is decreased as much as Cq. A successful heuristic’s score may not exceed predefined upper boundary (Ub); analogously an abortive heuristic’s score may not be less than the predefined lower boundary (Lb). The heuristic with greater score has more probability to be selected. It is applied once and the scores are updated according to its performance.


#### 4.2.4. Acceptance Strategies

Once a low-level heuristic is selected and applied, the acceptance of new solution also requires a strategy. We applied two strategies; these are Only Improvement (OI) and Monte Carlo (MC).(i)
OI acceptance strategy only accepts better solutions.(ii)
MC acceptance strategy accepts better solutions certainly. Additionally, it accepts worse solutions with a small probability (Monte Carlo constant) in order not to get stuck at the local optima.Algorithm 1:Pseudocode of HH.
Initializationi = 0Initial candidate solutionS0Final solutionSfsNew =S0, Sf=S0while (i < maxIterations) Select heuristic according to heuristic selection strategysNew = applySelectedHeuristicSfif (sNew is accepted according to move acceptance strategy)Sf = Snewend ifi++end whilereturnSf


### 4.3. Simulated Annealing

Simulated annealing (SA) is a well-known local search algorithm proposed by Kirkpatrick et al. [44], inspired from the annealing process of metal work. A starting temperature T is determined. The larger this value is, the more inferior solutions are encouraged. After a predetermined number of iterations, T is set to T/a. When a is large, the temperature decrease ratio is large and the acceptance of inferior solutions become less likely at a greater rate. When temperature becomes less than a predefined value, SA stops (the stopping condition). The number of iterations at each temperature is limited by R and greater values of R correspond to slower cooling; that is, more neighbor solution trial is occurring when there is a greater likelihood of inferior exchanges being accepted. In our implementation, R value changes and increases by an initially specified b value. When a random neighbor is generated, it is compared with the previous solution. If it is better than the previous one, it is accepted. If it is worse than the previous one, it may still be accepted with a small probability. This probability is calculated based on the difference of old and new solution quality and the temperature. The pseudocode of SA is given in Algorithm 2.Algorithm 2:Pseudocode of SA.
Generate a random initial solution and indicate it as current solution, cs, initializetemperatureTBest solution(bs) = cswhile termination condition is not satisfiedforR timesObtain a neighbor solution, ns of csdelta = cost of ns–cost of csif delta < 0cs = nselse if random() < edelta/Tcs = nsif cost of ns < cost of bsbs = nsend forT = T/aR = R ∗ bend while


### 4.4. Migrating Birds Optimization

Migrating birds optimization (MBO) is a neighborhood search technique proposed by Duman et al. [40], inspired from the V formation flight of the migrating birds. It has been recently proposed but successfully applied in various research areas such as task allocation problem [45], flow shop scheduling problem [46–48], U-shaped assembly line balancing problems with workers assignment [49], and continuous functions [50].The pseudocode of MBO is given in Algorithm3. Similar to birds of a V shape migration, some initial solutions organize a V formation including one leading solution and some followers. In the flock of solutions, a limited number of neighboring solutions for each main solution are generated. The neighboring solutions of each initial solution are evaluated and if there are any improvements among them, that initial solution is replaced by the solution provided by the most improved neighbor. Then, each main solution is tried to be improved further by the help of its neighbors. This means that each solution will share some of its unused neighbors to the next (behind) main solution. Therefore, except the leading solution, the other main solutions of the flock have the chance to be improved by one of the neighbors of the main solution in front of them. The procedure is repeated a number of times. Then, the leading solution moves to the end of the flock and one of its followers becomes the new leader. The same procedure is done and repeated for the new flock. The algorithm continues until a number of iterations are reached. Finally, the best solution of the flock is introduced as the solution of the MBO algorithm.Algorithm 3:Pseudocode of MBO.
Generatenob initial solutions randomly and place them on a hypothetical V formation arbitrarilywhile termination condition is not satisfiedfornof timesTry to improve leading solution by generating and evaluatingnon neighbors of itfor each solution si in the flock (except leader)Try to improvesi by evaluating (non-olf) neighbors of it and olf unused best neighbors from the solution in the frontend forend forMove the leader solution to the end and forward one of the solutions following it to the leader positionend while


### 4.5. A New Hybrid Algorithm: HHMBO

Now, we present a novel hybrid technique by integrating various hyperheuristic techniques with the migrating birds optimization algorithm. To the best of our knowledge, this work is the first attempt of hybridizing MBO with hyperheuristics.MBO is a metaheuristic algorithm that explores new solutions by single step heuristics as illustrated in Figure1. Neighbor generation technique is fixed and does not change throughout the execution of the algorithm. Therefore the performance of classical MBO is much dependent on the neighbor generation technique. However, giving chance more than one heuristic with different characteristics to discover search space may increase its exploration capability. Based on this idea, we integrated the recently presented MBO algorithm with the hyperheuristic principles. Instead of a single discovery method, we took the advantage of exploiting a set of low-level heuristics in order to construct the neighbor solutions in the population.Figure 1
Neighborhood generation in classical MBO.Neighborhood generation process of hyperheuristics embedded migrating bird optimization (HHMBO) is presented in Figure2. The neighbor solution generation part of MBO is hybridized by HH characteristics, which is capable of managing heuristic pool. A set of heuristic selection strategies are handled for choosing the low-level heuristics. In our implementation, we have applied simple random, random permutation, and adaptive searching heuristic selection strategies. The new neighboring solution is accepted or rejected according to the current move acceptance specifications. We have implemented Only Improvement and Monte Carlo move acceptance strategies. HHMBO operates in different ways according to the adjusted heuristic selection strategy and the move acceptance strategy. As a result, the HHMBO types that emerged in the application can be listed as follows: simple random Only Improvement (SR_OI), simple random Monte Carlo (SR_MC), random permutation Only Improvement (RP_OI), random permutation Monte Carlo (RP_MC), adaptive searching Only Improvement (AS_OI), and adaptive searching Monte Carlo (AS_MC). HHMBO generates neighbor solutions by one of those hyperheuristic variations. The pseudocode of the algorithm is given in Algorithm 4.Figure 2
Neighborhood generation mechanism in HHMBO.Algorithm 4: Pseudocode of HHMBO.
Generatenob initial solutions randomly and place them V formationDetermine the heuristic selection strategy (Simple random, random permutation or adaptive searching)Determine the move acceptance strategy (Only improvement or monte carlo)while termination condition is not satisfiedfornof timesTry to improve leading solution by generating and evaluatingnon neighbors of it applying selected low level heuristicfor each solution si in the flock (except leader)Try to improvesi by evaluating (non-olf) neighbors of it and olf unused best neighbors from the solution in the frontAccept or reject the neighbor solution according to current move acceptance strategy.end forend forMove the leader solution to the end and forward one of the solutions following it to the leader positionend whileHHMBO offers a collaboration of hyperheuristics and migrating birds optimization algorithm. HH provide an extensive exploration capability due to their ability to quickly adapt according to the problem instance at hand. MBO exploits the leader solution more detailed each time and the leader is updated in each generation. HHMBO takes the advantage of exploring the solution space by the exploration talent of HH in addition to the exploitation skills of MBO. The properties of the HHMBO which distinguish it from the other metaheuristic approaches are listed as follows:(i)
A number of solutions running in parallel(ii)
The benefit mechanism among the solutions(iii)
Exploiting the leader solution more than the others in each generation(iv)
Exploring the search space by multiple operators where the best strategy is determined by HH


## 4.1. Initial Individual Generation for FOSSP

Recall from the small example that the ultimate output of FOSSP is a matrix containing schema numbers assigned to employees for each week. Therefore, a solution (also called an individual) to a problem instance will refer to a feasible output in the remainder of the manuscript. Again, recall that, due to the nature of the problem, same set of schema numbers are used in each week with different permutations. A sample FOSSP individual is illustrated in Table5 for ten employees and four weeks. Employee number one is assigned to schema number five in week one, employee number two is assigned to schema twenty in week one, and so on.Table 5
Sample four-week, ten-employee FOSSP individual.
Weeke1e2e3e4e5e6e7e8e9e101520303540535881827281827303540535852038182753584030355204405327303581858520We want to remind that requirement list is updated periodically before preparing the schedules and the requirements are the same for all weeks in planning horizon. Initial individual creation progress of FOSSP is as follows: Schemas are assigned to employees for the first week satisfying the requirements in each time interval. The schedules of subsequent weeks (week two, week three, etc.) are constructed by shuffling assigned schema values in week one. Additional controls for meeting the requirements and controlling official rules are also taken into account.


## 4.2. Hyperheuristics

Hyperheuristics (HH) is a neighborhood search technique used for selecting, applying, and managing low-level heuristics and it is widely used in solving combinatorial optimization problems [43]. Pseudocode of the HH is presented in Algorithm 1. HH has two important functionalities, one of which is heuristic selection mechanism and the other is the move acceptance mechanism. Heuristic selection mechanism is responsible for selecting a low-level heuristic within the pool. Move acceptance mechanism decides whether to accept new solutions or not. In our implementation, simple random heuristic selection, random permutation heuristic selection, and adaptive searching heuristic selection strategies are used. Only Improvement and Monte Carlo acceptance strategies are exploited as acceptance strategies. Now let us explain the low-level heuristics applied for tackled problems, respectively.


### 4.2.1. Low-Level Heuristics for FOSSP

There are totally four low-level heuristics for FOSSP in this study. Each heuristic checks the additional constraints specified in the model.Heuristic 1 (H1): H1 selects a random schema among the ones that are already assigned to an employee. Another random schema is selected with tournament selection with size five. Five schemas are selected randomly among 63 schemas, and one of those five schemas is chosen as second schema. Tournament selection increases the possibility of choosing a lower cost schema.Heuristic 2 (H2): H2 randomly selects two employees for each week and swaps their schema assignment values.Heuristic 3 (H3): H3 selects two employees randomly for each week and inserts the schema value in subsequent location to the next place in prior employee location.Heuristic 4 (H4): H4 selects two employees randomly for each week and inverts schema assignment values between these employee locations.


### 4.2.2. Low-Level Heuristics for QAP

Four low-level heuristics are implemented on QAP. Those may be explained basically as follows:Swap: Swap heuristic simply selects two points in a QAP individual and relocates their places.Insert: Two random points are selected within an individual and the subsequent one is placed right after the first random point. All points between selected points move one step to the right.Inverse: Two random points are selected within an individual. All assignments between the selected points are reversed.Scramble: Two random points are selected on an individual. Assignments between the selected points are scrambled.


### 4.2.3. Heuristic Selection Strategies

Selecting the low-level heuristics requires a strategy. We applied three different heuristic selection strategies. These are simple random (SR), random permutation (RP), and adaptive searching (AS).(i)
SR randomly selects one of the low-level heuristics and applies it only once.(ii)
RP firstly constructs a permutation of low-level heuristics and applies each one once according to the permutation.(iii)
AS is a smart selection mechanism that we designed in this study. Each low-level heuristic has an equal initial score (Ri) and those scores are updated during the run. If heuristic improves the solution, its score is increased as much as the change quantity (Cq); if it worsens the solution, its score is decreased as much as Cq. A successful heuristic’s score may not exceed predefined upper boundary (Ub); analogously an abortive heuristic’s score may not be less than the predefined lower boundary (Lb). The heuristic with greater score has more probability to be selected. It is applied once and the scores are updated according to its performance.


### 4.2.4. Acceptance Strategies

Once a low-level heuristic is selected and applied, the acceptance of new solution also requires a strategy. We applied two strategies; these are Only Improvement (OI) and Monte Carlo (MC).(i)
OI acceptance strategy only accepts better solutions.(ii)
MC acceptance strategy accepts better solutions certainly. Additionally, it accepts worse solutions with a small probability (Monte Carlo constant) in order not to get stuck at the local optima.Algorithm 1:Pseudocode of HH.
Initializationi = 0Initial candidate solutionS0Final solutionSfsNew =S0, Sf=S0while (i < maxIterations) Select heuristic according to heuristic selection strategysNew = applySelectedHeuristicSfif (sNew is accepted according to move acceptance strategy)Sf = Snewend ifi++end whilereturnSf


## 4.2.1. Low-Level Heuristics for FOSSP

There are totally four low-level heuristics for FOSSP in this study. Each heuristic checks the additional constraints specified in the model.Heuristic 1 (H1): H1 selects a random schema among the ones that are already assigned to an employee. Another random schema is selected with tournament selection with size five. Five schemas are selected randomly among 63 schemas, and one of those five schemas is chosen as second schema. Tournament selection increases the possibility of choosing a lower cost schema.Heuristic 2 (H2): H2 randomly selects two employees for each week and swaps their schema assignment values.Heuristic 3 (H3): H3 selects two employees randomly for each week and inserts the schema value in subsequent location to the next place in prior employee location.Heuristic 4 (H4): H4 selects two employees randomly for each week and inverts schema assignment values between these employee locations.


## 4.2.2. Low-Level Heuristics for QAP

Four low-level heuristics are implemented on QAP. Those may be explained basically as follows:Swap: Swap heuristic simply selects two points in a QAP individual and relocates their places.Insert: Two random points are selected within an individual and the subsequent one is placed right after the first random point. All points between selected points move one step to the right.Inverse: Two random points are selected within an individual. All assignments between the selected points are reversed.Scramble: Two random points are selected on an individual. Assignments between the selected points are scrambled.


## 4.2.3. Heuristic Selection Strategies

Selecting the low-level heuristics requires a strategy. We applied three different heuristic selection strategies. These are simple random (SR), random permutation (RP), and adaptive searching (AS).(i)
SR randomly selects one of the low-level heuristics and applies it only once.(ii)
RP firstly constructs a permutation of low-level heuristics and applies each one once according to the permutation.(iii)
AS is a smart selection mechanism that we designed in this study. Each low-level heuristic has an equal initial score (Ri) and those scores are updated during the run. If heuristic improves the solution, its score is increased as much as the change quantity (Cq); if it worsens the solution, its score is decreased as much as Cq. A successful heuristic’s score may not exceed predefined upper boundary (Ub); analogously an abortive heuristic’s score may not be less than the predefined lower boundary (Lb). The heuristic with greater score has more probability to be selected. It is applied once and the scores are updated according to its performance.


## 4.2.4. Acceptance Strategies

Once a low-level heuristic is selected and applied, the acceptance of new solution also requires a strategy. We applied two strategies; these are Only Improvement (OI) and Monte Carlo (MC).(i)
OI acceptance strategy only accepts better solutions.(ii)
MC acceptance strategy accepts better solutions certainly. Additionally, it accepts worse solutions with a small probability (Monte Carlo constant) in order not to get stuck at the local optima.Algorithm 1:Pseudocode of HH.
Initializationi = 0Initial candidate solutionS0Final solutionSfsNew =S0, Sf=S0while (i < maxIterations) Select heuristic according to heuristic selection strategysNew = applySelectedHeuristicSfif (sNew is accepted according to move acceptance strategy)Sf = Snewend ifi++end whilereturnSf


## 4.3. Simulated Annealing

Simulated annealing (SA) is a well-known local search algorithm proposed by Kirkpatrick et al. [44], inspired from the annealing process of metal work. A starting temperature T is determined. The larger this value is, the more inferior solutions are encouraged. After a predetermined number of iterations, T is set to T/a. When a is large, the temperature decrease ratio is large and the acceptance of inferior solutions become less likely at a greater rate. When temperature becomes less than a predefined value, SA stops (the stopping condition). The number of iterations at each temperature is limited by R and greater values of R correspond to slower cooling; that is, more neighbor solution trial is occurring when there is a greater likelihood of inferior exchanges being accepted. In our implementation, R value changes and increases by an initially specified b value. When a random neighbor is generated, it is compared with the previous solution. If it is better than the previous one, it is accepted. If it is worse than the previous one, it may still be accepted with a small probability. This probability is calculated based on the difference of old and new solution quality and the temperature. The pseudocode of SA is given in Algorithm 2.Algorithm 2:Pseudocode of SA.
Generate a random initial solution and indicate it as current solution, cs, initializetemperatureTBest solution(bs) = cswhile termination condition is not satisfiedforR timesObtain a neighbor solution, ns of csdelta = cost of ns–cost of csif delta < 0cs = nselse if random() < edelta/Tcs = nsif cost of ns < cost of bsbs = nsend forT = T/aR = R ∗ bend while


## 4.4. Migrating Birds Optimization

Migrating birds optimization (MBO) is a neighborhood search technique proposed by Duman et al. [40], inspired from the V formation flight of the migrating birds. It has been recently proposed but successfully applied in various research areas such as task allocation problem [45], flow shop scheduling problem [46–48], U-shaped assembly line balancing problems with workers assignment [49], and continuous functions [50].The pseudocode of MBO is given in Algorithm3. Similar to birds of a V shape migration, some initial solutions organize a V formation including one leading solution and some followers. In the flock of solutions, a limited number of neighboring solutions for each main solution are generated. The neighboring solutions of each initial solution are evaluated and if there are any improvements among them, that initial solution is replaced by the solution provided by the most improved neighbor. Then, each main solution is tried to be improved further by the help of its neighbors. This means that each solution will share some of its unused neighbors to the next (behind) main solution. Therefore, except the leading solution, the other main solutions of the flock have the chance to be improved by one of the neighbors of the main solution in front of them. The procedure is repeated a number of times. Then, the leading solution moves to the end of the flock and one of its followers becomes the new leader. The same procedure is done and repeated for the new flock. The algorithm continues until a number of iterations are reached. Finally, the best solution of the flock is introduced as the solution of the MBO algorithm.Algorithm 3:Pseudocode of MBO.
Generatenob initial solutions randomly and place them on a hypothetical V formation arbitrarilywhile termination condition is not satisfiedfornof timesTry to improve leading solution by generating and evaluatingnon neighbors of itfor each solution si in the flock (except leader)Try to improvesi by evaluating (non-olf) neighbors of it and olf unused best neighbors from the solution in the frontend forend forMove the leader solution to the end and forward one of the solutions following it to the leader positionend while


## 4.5. A New Hybrid Algorithm: HHMBO

Now, we present a novel hybrid technique by integrating various hyperheuristic techniques with the migrating birds optimization algorithm. To the best of our knowledge, this work is the first attempt of hybridizing MBO with hyperheuristics.MBO is a metaheuristic algorithm that explores new solutions by single step heuristics as illustrated in Figure1. Neighbor generation technique is fixed and does not change throughout the execution of the algorithm. Therefore the performance of classical MBO is much dependent on the neighbor generation technique. However, giving chance more than one heuristic with different characteristics to discover search space may increase its exploration capability. Based on this idea, we integrated the recently presented MBO algorithm with the hyperheuristic principles. Instead of a single discovery method, we took the advantage of exploiting a set of low-level heuristics in order to construct the neighbor solutions in the population.Figure 1
Neighborhood generation in classical MBO.Neighborhood generation process of hyperheuristics embedded migrating bird optimization (HHMBO) is presented in Figure2. The neighbor solution generation part of MBO is hybridized by HH characteristics, which is capable of managing heuristic pool. A set of heuristic selection strategies are handled for choosing the low-level heuristics. In our implementation, we have applied simple random, random permutation, and adaptive searching heuristic selection strategies. The new neighboring solution is accepted or rejected according to the current move acceptance specifications. We have implemented Only Improvement and Monte Carlo move acceptance strategies. HHMBO operates in different ways according to the adjusted heuristic selection strategy and the move acceptance strategy. As a result, the HHMBO types that emerged in the application can be listed as follows: simple random Only Improvement (SR_OI), simple random Monte Carlo (SR_MC), random permutation Only Improvement (RP_OI), random permutation Monte Carlo (RP_MC), adaptive searching Only Improvement (AS_OI), and adaptive searching Monte Carlo (AS_MC). HHMBO generates neighbor solutions by one of those hyperheuristic variations. The pseudocode of the algorithm is given in Algorithm 4.Figure 2
Neighborhood generation mechanism in HHMBO.Algorithm 4: Pseudocode of HHMBO.
Generatenob initial solutions randomly and place them V formationDetermine the heuristic selection strategy (Simple random, random permutation or adaptive searching)Determine the move acceptance strategy (Only improvement or monte carlo)while termination condition is not satisfiedfornof timesTry to improve leading solution by generating and evaluatingnon neighbors of it applying selected low level heuristicfor each solution si in the flock (except leader)Try to improvesi by evaluating (non-olf) neighbors of it and olf unused best neighbors from the solution in the frontAccept or reject the neighbor solution according to current move acceptance strategy.end forend forMove the leader solution to the end and forward one of the solutions following it to the leader positionend whileHHMBO offers a collaboration of hyperheuristics and migrating birds optimization algorithm. HH provide an extensive exploration capability due to their ability to quickly adapt according to the problem instance at hand. MBO exploits the leader solution more detailed each time and the leader is updated in each generation. HHMBO takes the advantage of exploring the solution space by the exploration talent of HH in addition to the exploitation skills of MBO. The properties of the HHMBO which distinguish it from the other metaheuristic approaches are listed as follows:(i)
A number of solutions running in parallel(ii)
The benefit mechanism among the solutions(iii)
Exploiting the leader solution more than the others in each generation(iv)
Exploring the search space by multiple operators where the best strategy is determined by HH


## 5. Experimental Setup

In this section, we provide the details of computational experiment settings. Firstly the dataset used in experiments is described. Then the parameter settings of MBO, HH, SA, and HHMBO are explained. Lastly, the benchmark dataset is clarified.GAMS is used to verify and test the mathematical model. All algorithm implementations are done using Java programming language on Eclipse IDE running on Intel i7-5500U CPU and 16 GB memory computer operated by Windows 10 operating system. Besides the basic constraints on the formulation presented, additional legal regulation constraints have also been applied while implementing each solution technique.


### 5.1. Data Preparation

We had a limited amount of real data provided by our collaborator company. However, we needed a great amount of experimental data to achieve a fair comparison among solution techniques we had implemented. Therefore, a simple application is prepared, which generates synthetic data, which have the general characteristics of the real data. Requirements are selected randomly among a certain range, where lower and upper boundaries are calculated based on employee number. A real input dataset for 200 employees and sample synthetic requirement data values are illustrated in Table6. The employee numbers are shown in the top row and they vary from 30 to 500. This illustration comprises a sample requirement input for varied number of employees. First column of the table contains the time slot IDs; each one corresponds to a day and a shift type. The requirements in each time slot for a company with 200 (real), 30, 50, 100, 150, 200, and 500 employees are given in the subsequent columns.Table 6
Sample real and synthetic inputs.
Real dataSyntheticDataIDTime slot meaning20030501001502005001Monday day shift58312153312362Monday evening shift3681121612303Monday night shift508723942764Tuesday day shift585620281025Tuesday evening shift369104177606Tuesday night shift50971134417Wednesday day shift5869132529948Wednesday evening shift365116264409Wednesday night shift534141540310Thursday day shift5868628408811Thursday evening shift363111625273112Thursday night shift50751930127813Friday day shift5887533210314Friday evening shift36141416178915Friday night shift5086176264816Saturday day shift2610214248017Saturday evening shift531112419618Saturday night shift522515107919Sunday day shift511311395520Sunday evening shift491112326355621Sunday night shift3651022144340


### 5.2. Parameter Settings

MBO and SA perform a unique heuristic technique for improving solutions. Since we have four different heuristic techniques, we have conducted an experiment to understand which of the four operators in the system is compatible with which algorithm. In order to assess a fair comparison among all applied techniques, we set the stopping criterion of the algorithms based on the number of instances (noi) created while each algorithm is running. This experiment is done on each of the datasets, while the number of instances (noi) is set to 10,000 and each case is repeated 50 times. Heuristic operators are listed from the best performing one to the least performing one in Table7. H1 through H4 correspond to heuristic one through heuristic four, respectively, which are explained in Section 4.2.1. Swap, Insert, Inverse, and Scramble are applied on QAP and explained in Section 4.2.2.Table 7
Sample real and synthetic inputs.
FOSSPLow-level heuristicsQAPLow-level heuristicsMBOH2, H4, H3, H1MBOSwap, Insert, Inverse, ScrambleSAH1, H3, H4, H1SASwap, Insert, Inverse, ScrambleIn order to get the best performance from the algorithms for FOSSP, we need to use their best performing values. These best performing values are discovered with fine-tuning experiments. The number of solutions that algorithm can generate while surfing in the solution space is limited to 50,000 for each algorithm. The experiments are repeated ten times and the results acquired from the average performances are represented in Tables8 and 9. Best parameter values are emphasized in bold font.Table 8
Parameter fine-tuning experiment results for FOSSP.
ParameterMBOHHMBOSR_OISR_MCRP_OIRP_MCAS_OIAS_MCnob5, 21,515, 21,515, 21,515, 21,515, 21,515, 21,515, 21,51non3, 5, 73, 5,73,5, 73,5, 73,5, 73,5, 73, 5, 7nof5,105, 105, 105,105, 105,105, 10olf1, 2, 31, 2, 31, 2, 31,2, 31, 2, 31, 2, 31,2, 3Monte Carlo constant0.0005,0.001, 0.0050.0005, 0.001,0.0050.0005, 0.001,0.005Table 9
Parameter fine-tuning experiment results for FOSSP.
ParameterSAParameterAdaptive SearchingT50.000, 75.000, 100.000Ri10,15, 20A1.1, 1.2, 1.3Cq0.5, 0.8,1R10,20, 30Ub40,50,60,100b1.1, 1.2, 1.3Lb0, 5, 10


### 5.3. Experimental Setup of Benchmark Data

Apart from the specific problem defined in this study, computational experiments are also conducted with QAP to measure the success of the HHMBO. Computational experiments presented have been done using QAPLIB benchmark dataset, where QAP instances are available together with their best known solutions [51]. Fine-tuning experiments are handled to find out the best performing values. The number of solutions that the algorithm can generate while navigating the solution space is limited to 50,000. The experiments were repeated ten times and the results from the average performances are shown in Table 10, with the best parameter values being in bold.Table 10
Parameter fine-tuning experiment results for QAP.
ParameterMBOHHMBOParameterAdaptive searchingSR_OISR_MCRP_OIRP_MCAS_OIAS_MCnob5, 21,515, 21,515, 21,515, 21,515, 21,515, 21,515, 21,51Ri10, 15,20non3, 5, 73, 5, 73,5, 73, 5, 73,5, 73, 5, 73, 5, 7Cq0.5,0.8, 1nof5,105,105, 105, 105,105,105, 10Ub40,50,60,100olf1, 2, 31, 2, 31, 2, 31, 2, 31, 2, 31, 2, 31, 2, 3Lb0, 5, 10Monte Carlo constant0.0005,0.001, 0.0050.0005, 0.001, 0.0050.0005, 0.001, 0.005


## 5.1. Data Preparation

We had a limited amount of real data provided by our collaborator company. However, we needed a great amount of experimental data to achieve a fair comparison among solution techniques we had implemented. Therefore, a simple application is prepared, which generates synthetic data, which have the general characteristics of the real data. Requirements are selected randomly among a certain range, where lower and upper boundaries are calculated based on employee number. A real input dataset for 200 employees and sample synthetic requirement data values are illustrated in Table6. The employee numbers are shown in the top row and they vary from 30 to 500. This illustration comprises a sample requirement input for varied number of employees. First column of the table contains the time slot IDs; each one corresponds to a day and a shift type. The requirements in each time slot for a company with 200 (real), 30, 50, 100, 150, 200, and 500 employees are given in the subsequent columns.Table 6
Sample real and synthetic inputs.
Real dataSyntheticDataIDTime slot meaning20030501001502005001Monday day shift58312153312362Monday evening shift3681121612303Monday night shift508723942764Tuesday day shift585620281025Tuesday evening shift369104177606Tuesday night shift50971134417Wednesday day shift5869132529948Wednesday evening shift365116264409Wednesday night shift534141540310Thursday day shift5868628408811Thursday evening shift363111625273112Thursday night shift50751930127813Friday day shift5887533210314Friday evening shift36141416178915Friday night shift5086176264816Saturday day shift2610214248017Saturday evening shift531112419618Saturday night shift522515107919Sunday day shift511311395520Sunday evening shift491112326355621Sunday night shift3651022144340


## 5.2. Parameter Settings

MBO and SA perform a unique heuristic technique for improving solutions. Since we have four different heuristic techniques, we have conducted an experiment to understand which of the four operators in the system is compatible with which algorithm. In order to assess a fair comparison among all applied techniques, we set the stopping criterion of the algorithms based on the number of instances (noi) created while each algorithm is running. This experiment is done on each of the datasets, while the number of instances (noi) is set to 10,000 and each case is repeated 50 times. Heuristic operators are listed from the best performing one to the least performing one in Table7. H1 through H4 correspond to heuristic one through heuristic four, respectively, which are explained in Section 4.2.1. Swap, Insert, Inverse, and Scramble are applied on QAP and explained in Section 4.2.2.Table 7
Sample real and synthetic inputs.
FOSSPLow-level heuristicsQAPLow-level heuristicsMBOH2, H4, H3, H1MBOSwap, Insert, Inverse, ScrambleSAH1, H3, H4, H1SASwap, Insert, Inverse, ScrambleIn order to get the best performance from the algorithms for FOSSP, we need to use their best performing values. These best performing values are discovered with fine-tuning experiments. The number of solutions that algorithm can generate while surfing in the solution space is limited to 50,000 for each algorithm. The experiments are repeated ten times and the results acquired from the average performances are represented in Tables8 and 9. Best parameter values are emphasized in bold font.Table 8
Parameter fine-tuning experiment results for FOSSP.
ParameterMBOHHMBOSR_OISR_MCRP_OIRP_MCAS_OIAS_MCnob5, 21,515, 21,515, 21,515, 21,515, 21,515, 21,515, 21,51non3, 5, 73, 5,73,5, 73,5, 73,5, 73,5, 73, 5, 7nof5,105, 105, 105,105, 105,105, 10olf1, 2, 31, 2, 31, 2, 31,2, 31, 2, 31, 2, 31,2, 3Monte Carlo constant0.0005,0.001, 0.0050.0005, 0.001,0.0050.0005, 0.001,0.005Table 9
Parameter fine-tuning experiment results for FOSSP.
ParameterSAParameterAdaptive SearchingT50.000, 75.000, 100.000Ri10,15, 20A1.1, 1.2, 1.3Cq0.5, 0.8,1R10,20, 30Ub40,50,60,100b1.1, 1.2, 1.3Lb0, 5, 10


## 5.3. Experimental Setup of Benchmark Data

Apart from the specific problem defined in this study, computational experiments are also conducted with QAP to measure the success of the HHMBO. Computational experiments presented have been done using QAPLIB benchmark dataset, where QAP instances are available together with their best known solutions [51]. Fine-tuning experiments are handled to find out the best performing values. The number of solutions that the algorithm can generate while navigating the solution space is limited to 50,000. The experiments were repeated ten times and the results from the average performances are shown in Table 10, with the best parameter values being in bold.Table 10
Parameter fine-tuning experiment results for QAP.
ParameterMBOHHMBOParameterAdaptive searchingSR_OISR_MCRP_OIRP_MCAS_OIAS_MCnob5, 21,515, 21,515, 21,515, 21,515, 21,515, 21,515, 21,51Ri10, 15,20non3, 5, 73, 5, 73,5, 73, 5, 73,5, 73, 5, 73, 5, 7Cq0.5,0.8, 1nof5,105,105, 105, 105,105,105, 10Ub40,50,60,100olf1, 2, 31, 2, 31, 2, 31, 2, 31, 2, 31, 2, 31, 2, 3Lb0, 5, 10Monte Carlo constant0.0005,0.001, 0.0050.0005, 0.001, 0.0050.0005, 0.001, 0.005


## 6. Results and Discussion

In this section, we present and analyze the results of computational experiments. GAMS results are presented firstly. Then, the results obtained by heuristic solution techniques on FOSSP are presented. Lastly, experimental outcomes on QAPLIB are presented.


### 6.1. GAMS Results

The GAMS utilizing CPLEX solver is used to verify and test the mathematical model of FOSSP. If the schedule is completely fair and all assignments are scrupulous for each employee, then fitness is equal to zero. The result gets away from zero, while the solution wanders away from fairness.Solver tests are done for datasets with 10, 20, 30, and 60 employees and results are illustrated in Table11 in terms of cost and execution time. FOSSP is capable of finding optimal value (zero) for employee numbers 10 to 30. FOSSP produces results closer to optimal for employee number 60. As the size of the problem gets larger, complexity increases. Obviously, execution time increases beyond linear behavior as the number of employees increases. Model attains border line of maximum iteration number in GAMS. Execution is terminated on maximum iteration number; hence, the execution time values are the total minutes required for maximum iteration in each case.Table 11
GAMS results for FOSSP datasets.
Number of employeesCost valuesExecution time (minutes)10012.824200500.334300968.884603.34988.58GAMS is capable of solving the model, but it is poor in terms of execution time, especially for large-scale problems. Therefore, we needed to implement and use heuristic based solution techniques for obtaining reasonable results within acceptable run time.


### 6.2. Results Obtained by Utilizing Synthetic FOSSP Dataset

In this subsection, results of heuristic based solution techniques on FOSSP are presented. IfN is the number of employees, we limited the run time with N2 iterations in order to assess a fair comparison among the applied techniques. This corresponded to 0.9 s for a problem of size 30 and to 34 s for a problem of size 100 on the specified machine. Consequently, as the complexity of the problem increases, the effort to be spent on its resolution also increases.Solution techniques are tested for numbers of employees of 30, 50, 100, 150, 200, and 500. We have generated 100 sample synthetic inputs for each case. Average numerical cost values gained from the ten runs are demonstrated in Table12. For all numbers of employees, HHMBO variants discover the best results. For numbers of employees of 30 and 50, HHMBO SR_MC variant outperforms the others by at least 5% on average. When the number of employees increases to 100, 150, 200, and 500, HHMBO RP_OI variant outperforms the other techniques.Table 12
Average results when noi isN2.
Employees numberMBOSAHHMBOHHSR_OISR_MCRP_OIRP_MCAS_OIAS_MCSR_OISR_MCRP_OIRP_MCAS_OIAS_MC3021.8133.6716.9513.1313.7920.1619.7719.6720.9121.2419.8822.4820.1719.995029.7959.8224.5915.7222.8021.7230.4836.8427.7829.9430.8330.3342.6938.2310052.13161.5444.9944.3339.9951.4863.0968.6046.0748.9654.99110.15135.29108.2415062.11292.0061.5167.1857.0063.0998.14101.9391.42178.29133.70135.24208.15244.2720070.12367.2567.9973.2067.6771.78143.12141.09241.61260.86315.59209.68248.82350.38500287.60926.11301.62254.06247.60257.94499.58460.58962.85939.88588.76765.77712.36912.62When the performances are analyzed in accordance with the increase of the number of employees, it is apparent that MBO and HHMBO variants retain their accomplishment as complexity rises. However, MBO is 66%, 90%, 30%, 9%, and 4% worse on average than the best performing HHMBO variant for numbers of employees of 30, 50, 100, 150, and 200, respectively. It is clear that both algorithms are successful in spite of increasing problem complexity. However, HHMBO variants obtain slightly better results than MBO in each condition.The best performing HHMBO variant is 156%, 281%, 304%, 412%, and 443% better than SA for numbers of employees of 30, 50, 100, 150, and 200, respectively. As the complexity of the problem increases, the performance of SA decreases and the difference between the two algorithms increases exponentially. Best performing HHMBO variant is 51%, 77%, 15%, 60%, and 210% better than the best performing HH variant for numbers of employees of 30, 50, 100, 150, and 200, respectively. The performance of HH is admissible for numbers of employees of 30 to 150, whereas when the number of employees increases to 200, HH performs exponentially worse.For the experiment in which the number of employees is 500, the total iteration number determined withN2 corresponds to 250,000. That is a reasonably big number of chances to search through the solution space. For this challenging case, the best performing HHMBO variant (RP_OI) is 274% better than SA, 138% better than HH, and 16% better than MBO.HHMBO (RP_OI) obtained significantly better results in complex FOSSP instances. RP_OI applies each of the four problem specific heuristics consecutively due to the permutation order. Each heuristic is applied to an equal number of instances. Each heuristic has a particular ability to discover search space. Accomplishment of HHMBO (RP_OI) exposes that when the algorithm is given a great search ability, using heuristics equal numbers of times helps us to find the best results. HHMBO is successful on catching values close to global optimum. HHMBO provides diversification along the search space by applying a variety of heuristics alternately; that is why it is promising for solving combinatorial optimization problems.The standard deviation results gained by FOSSP experiments are presented in Table13 to demonstrate the robustness of the algorithms. It is observed that HHMBO-RP_OI is more robust than its rivals. We can say that the HHMBO variants produce slightly better standard deviation results than their HH variants. This can be explained by the design of the algorithms as follows. The HHMBO variants wander within the solution space by exploiting some prioritized (leader) solutions more than HH do, which inherently makes them more robust.Table 13
Standard deviations of the experiment.
Employees numberMBOSAHHMBOHHSR_OISR_MCRP_OIRP_MCAS_OIAS_MCSR_OISR_MCRP_OIRP_MCAS_OIAS_MC302.582.552.052.322.072.132.032.013.673.513.653.963.962.89501.671.871.591.651.521.641.521.582.153.022.332.832.783.361001.782.001.951.801.711.881.751.773.513.163.683.443.413.281501.731.921.921.691.521.771.901.892.993.333.313.183.463.202001.961.752.092.121.482.012.092.012.962.852.713.052.632.755001.271.281.431.521.221.321.371.341.992.112.051.912.152.14The average results of each algorithm are illustrated in Figure3 for each number of employees. When the number of employees is equal to 30, all algorithms produce close results to each other. As the number of employees increases, the distinction between the algorithms involved in the experiment becomes more prominent. HHMBO-RP_OI produced the best results for the most challenging experiment, when the number of employees is equal to 500. HHMBO versions figure out lower (better) results when they are compared with their HH versions.Figure 3
The performance of each algorithm for each number of employees.We have also appliedt-test to check if the differences are statistically significant. The best performing HHMBO-RP_OI and all other algorithms in the experiment are tested and the statistical results obtained by two-tailed t-test are given in Table 14. We observed that the p value for pairwise t-tests among the best performing proposed variant HHMBO-RP_OI and the state-of-the-art algorithms is 0.004% on average. The results imply that HHMBO-RP_OI is indeed statistically different from other algorithms.Table 14
Thet-test results of HHMBO-RP_OI and the state-of-the-art algorithms on FOSSP.
Algorithm1 ↔ Algorithm 23050100150200500HHMBO-RP_OI ↔ MBO1.3E − 029.9E − 023.1E − 041.7E − 025.2E − 053.7E − 03HHMBO-RP_OI ↔ SA1.6E − 053.8E − 045.7E − 056.9E − 064.1E − 084.9E − 04HHMBO-RP_OI ↔ HH-SR_OI2.4E − 067.4E − 051.1E − 083.4E − 122.2E − 112.7E − 22HHMBO-RP_OI ↔ HH-SR_MC9.7E − 061.5E − 042.4E − 103.3E − 114.0E − 152.2E − 19HHMBO-RP_OI ↔ HH-RP_OI2.6E − 051.3E − 021.9E − 111.4E − 115.8E − 142.7E − 23HHMBO-RP_OI ↔ HH-RP_MC2.8E − 041.9E − 026.4E − 107.7E − 093.9E − 121.4E − 21HHMBO-RP_OI ↔ HH-AS_OI4.1E − 033.8E − 021.7E − 054.9E − 127.8E − 161.4E − 17HHMBO-RP_OI ↔ HH-AS_MC6.7E − 041.2E − 032.9E − 066.0E − 122.2E − 156.1E − 18


### 6.3. Results on Benchmark Problems in QAPLIB

After observing that HHMBO variants get very successful results for the FOSSP instances, we wanted to see their ability in converging optimal solutions on a widely used problem. We applied HHMBO on QAP, where MBO is firstly applied and tested. IfN is the size of a QAP instance, we limited the run time with N3 iterations. This corresponded to 0.01 s for a problem of size 12 and to 48 s for a problem of size 100 on the specified machine.We have utilized 41 QAPLIB instances with different densities. Density corresponds to the percentage of nonzero entries in the flow matrix. The instance names, densities, size of the instances, best known solutions (BKS), and the percentage deviations of heuristic results from BKS are given in Table15. Problem instances are listed from the sparse one to the dense one. Only the minimum costs obtained in 10 runs are considered, since the aim is to check the ability of HHMBO in finding BKS.Table 15
The percentage deviations of heuristic results from the best solution.
ProblemDensitySizeBKSMBOHHMBOSA_OISR_MCRP_OIRP_MCAS_OIAS_MCesc64a3.17641160.00.00.058.658.60.00.0tai64c4.13641,855,9280.00.00.011.410.10.00.1chr22a8.68226,1569.616.813.341.245.88.17.1esc16j9.381680.00.00.00.025.00.00.0chr20a9.50202,19231.355.356.6147.7132.627.920.1chr20b9.50202,29825.735.947.567.6119.417.836.3chr18a10.491811,09854.271.081.6197.2190.153.855.2esc16i11.7216140.00.00.028.614.30.00.0chr15a12.44159,89622.612.740.476.2116.935.830.1chr15b12.44157,99038.270.537.7193.3168.533.451.4chr15c12.44159,50453.839.262.995.496.639.242.0chr12c15.281211,15614.928.114.360.446.018.88.5chr12a15.28129,55220.537.519.760.258.519.85.7esc16d16.4116160.00.00.012.50.00.00.0esc16e16.4116280.00.00.014.314.30.00.0esc16g16.4116260.00.00.015.423.10.00.0esc32d17.58322000.03.04.037.035.00.00.0esc32c25.59326420.00.00.013.714.00.00.0esc32h27.54324380.02.32.326.521.00.00.0esc16a29.6916680.00.00.08.88.80.00.0scr1537.331551,1407.011.37.029.428.16.99.2esc16c39.84161600.00.00.05.08.80.00.0esc16b71.88162920.00.00.00.00.00.00.0lipa20b89.252027,07611.214.817.222.021.99.811.0esc16h89.84169960.00.00.01.60.00.00.0lipa20a90.25203,6832.23.03.04.54.52.42.7had1291.67121,6520.40.70.13.42.41.00.8rou1291.6712235,5283.04.72.89.89.05.74.9rou1593.3315354,2105.17.76.813.713.45.04.8nug16b93.75161,2403.96.93.412.913.74.54.4els1994.741917,212,5484.78.75.539.747.31.82.7lipa40b94.8140476,5815.321.019.626.026.33.56.5lipa40a95.064031,5381.32.02.02.92.81.61.6lipa50b95.88501,210,24417.921.821.725.325.58.311.2tai60b98.3360608,215,0541.12.22.740.241.00.61.1sko100a99.00100152,0020.75.95.713.913.90.72.6bur26b100.00263,817,8520.10.50.32.53.00.00.1bur26a100.00265,426,6700.10.40.42.81.80.10.2bur26c100.00265,426,7950.00.20.23.13.10.00.1bur26e100.00265,386,8790.00.30.43.43.60.00.1bur26g100.002610,117,1720.00.10.42.63.00.10.0Average8.211.811.734.935.97.57.8The results indicate that AS_IO variant of HHMBO is accomplished on catching promising solutions. HHMBO (AS_OI) is up to 14.6% better than MBO on converging to the BKS. According to the average percentage deviation gained from 41 instances, HHMBO (AS_OI) converges 7.5% to BKS, while MBO is 8.2% close to it. HHMBO (AS_OI) performs 0.7% better than MBO on average. Best performing variant of this experiment is adaptive searching Only Improvement HHMBO. Adaptive searching strategy exploits low-level heuristics depending on their performances. This adaptive feature ensures choosing the most beneficial low-level heuristic for each specific case during the run. It has been observed from the experiments conducted on QAPLIB benchmark problems that HHMBO consistently allows finding better results, albeit slightly.


## 6.1. GAMS Results

The GAMS utilizing CPLEX solver is used to verify and test the mathematical model of FOSSP. If the schedule is completely fair and all assignments are scrupulous for each employee, then fitness is equal to zero. The result gets away from zero, while the solution wanders away from fairness.Solver tests are done for datasets with 10, 20, 30, and 60 employees and results are illustrated in Table11 in terms of cost and execution time. FOSSP is capable of finding optimal value (zero) for employee numbers 10 to 30. FOSSP produces results closer to optimal for employee number 60. As the size of the problem gets larger, complexity increases. Obviously, execution time increases beyond linear behavior as the number of employees increases. Model attains border line of maximum iteration number in GAMS. Execution is terminated on maximum iteration number; hence, the execution time values are the total minutes required for maximum iteration in each case.Table 11
GAMS results for FOSSP datasets.
Number of employeesCost valuesExecution time (minutes)10012.824200500.334300968.884603.34988.58GAMS is capable of solving the model, but it is poor in terms of execution time, especially for large-scale problems. Therefore, we needed to implement and use heuristic based solution techniques for obtaining reasonable results within acceptable run time.


## 6.2. Results Obtained by Utilizing Synthetic FOSSP Dataset

In this subsection, results of heuristic based solution techniques on FOSSP are presented. IfN is the number of employees, we limited the run time with N2 iterations in order to assess a fair comparison among the applied techniques. This corresponded to 0.9 s for a problem of size 30 and to 34 s for a problem of size 100 on the specified machine. Consequently, as the complexity of the problem increases, the effort to be spent on its resolution also increases.Solution techniques are tested for numbers of employees of 30, 50, 100, 150, 200, and 500. We have generated 100 sample synthetic inputs for each case. Average numerical cost values gained from the ten runs are demonstrated in Table12. For all numbers of employees, HHMBO variants discover the best results. For numbers of employees of 30 and 50, HHMBO SR_MC variant outperforms the others by at least 5% on average. When the number of employees increases to 100, 150, 200, and 500, HHMBO RP_OI variant outperforms the other techniques.Table 12
Average results when noi isN2.
Employees numberMBOSAHHMBOHHSR_OISR_MCRP_OIRP_MCAS_OIAS_MCSR_OISR_MCRP_OIRP_MCAS_OIAS_MC3021.8133.6716.9513.1313.7920.1619.7719.6720.9121.2419.8822.4820.1719.995029.7959.8224.5915.7222.8021.7230.4836.8427.7829.9430.8330.3342.6938.2310052.13161.5444.9944.3339.9951.4863.0968.6046.0748.9654.99110.15135.29108.2415062.11292.0061.5167.1857.0063.0998.14101.9391.42178.29133.70135.24208.15244.2720070.12367.2567.9973.2067.6771.78143.12141.09241.61260.86315.59209.68248.82350.38500287.60926.11301.62254.06247.60257.94499.58460.58962.85939.88588.76765.77712.36912.62When the performances are analyzed in accordance with the increase of the number of employees, it is apparent that MBO and HHMBO variants retain their accomplishment as complexity rises. However, MBO is 66%, 90%, 30%, 9%, and 4% worse on average than the best performing HHMBO variant for numbers of employees of 30, 50, 100, 150, and 200, respectively. It is clear that both algorithms are successful in spite of increasing problem complexity. However, HHMBO variants obtain slightly better results than MBO in each condition.The best performing HHMBO variant is 156%, 281%, 304%, 412%, and 443% better than SA for numbers of employees of 30, 50, 100, 150, and 200, respectively. As the complexity of the problem increases, the performance of SA decreases and the difference between the two algorithms increases exponentially. Best performing HHMBO variant is 51%, 77%, 15%, 60%, and 210% better than the best performing HH variant for numbers of employees of 30, 50, 100, 150, and 200, respectively. The performance of HH is admissible for numbers of employees of 30 to 150, whereas when the number of employees increases to 200, HH performs exponentially worse.For the experiment in which the number of employees is 500, the total iteration number determined withN2 corresponds to 250,000. That is a reasonably big number of chances to search through the solution space. For this challenging case, the best performing HHMBO variant (RP_OI) is 274% better than SA, 138% better than HH, and 16% better than MBO.HHMBO (RP_OI) obtained significantly better results in complex FOSSP instances. RP_OI applies each of the four problem specific heuristics consecutively due to the permutation order. Each heuristic is applied to an equal number of instances. Each heuristic has a particular ability to discover search space. Accomplishment of HHMBO (RP_OI) exposes that when the algorithm is given a great search ability, using heuristics equal numbers of times helps us to find the best results. HHMBO is successful on catching values close to global optimum. HHMBO provides diversification along the search space by applying a variety of heuristics alternately; that is why it is promising for solving combinatorial optimization problems.The standard deviation results gained by FOSSP experiments are presented in Table13 to demonstrate the robustness of the algorithms. It is observed that HHMBO-RP_OI is more robust than its rivals. We can say that the HHMBO variants produce slightly better standard deviation results than their HH variants. This can be explained by the design of the algorithms as follows. The HHMBO variants wander within the solution space by exploiting some prioritized (leader) solutions more than HH do, which inherently makes them more robust.Table 13
Standard deviations of the experiment.
Employees numberMBOSAHHMBOHHSR_OISR_MCRP_OIRP_MCAS_OIAS_MCSR_OISR_MCRP_OIRP_MCAS_OIAS_MC302.582.552.052.322.072.132.032.013.673.513.653.963.962.89501.671.871.591.651.521.641.521.582.153.022.332.832.783.361001.782.001.951.801.711.881.751.773.513.163.683.443.413.281501.731.921.921.691.521.771.901.892.993.333.313.183.463.202001.961.752.092.121.482.012.092.012.962.852.713.052.632.755001.271.281.431.521.221.321.371.341.992.112.051.912.152.14The average results of each algorithm are illustrated in Figure3 for each number of employees. When the number of employees is equal to 30, all algorithms produce close results to each other. As the number of employees increases, the distinction between the algorithms involved in the experiment becomes more prominent. HHMBO-RP_OI produced the best results for the most challenging experiment, when the number of employees is equal to 500. HHMBO versions figure out lower (better) results when they are compared with their HH versions.Figure 3
The performance of each algorithm for each number of employees.We have also appliedt-test to check if the differences are statistically significant. The best performing HHMBO-RP_OI and all other algorithms in the experiment are tested and the statistical results obtained by two-tailed t-test are given in Table 14. We observed that the p value for pairwise t-tests among the best performing proposed variant HHMBO-RP_OI and the state-of-the-art algorithms is 0.004% on average. The results imply that HHMBO-RP_OI is indeed statistically different from other algorithms.Table 14
Thet-test results of HHMBO-RP_OI and the state-of-the-art algorithms on FOSSP.
Algorithm1 ↔ Algorithm 23050100150200500HHMBO-RP_OI ↔ MBO1.3E − 029.9E − 023.1E − 041.7E − 025.2E − 053.7E − 03HHMBO-RP_OI ↔ SA1.6E − 053.8E − 045.7E − 056.9E − 064.1E − 084.9E − 04HHMBO-RP_OI ↔ HH-SR_OI2.4E − 067.4E − 051.1E − 083.4E − 122.2E − 112.7E − 22HHMBO-RP_OI ↔ HH-SR_MC9.7E − 061.5E − 042.4E − 103.3E − 114.0E − 152.2E − 19HHMBO-RP_OI ↔ HH-RP_OI2.6E − 051.3E − 021.9E − 111.4E − 115.8E − 142.7E − 23HHMBO-RP_OI ↔ HH-RP_MC2.8E − 041.9E − 026.4E − 107.7E − 093.9E − 121.4E − 21HHMBO-RP_OI ↔ HH-AS_OI4.1E − 033.8E − 021.7E − 054.9E − 127.8E − 161.4E − 17HHMBO-RP_OI ↔ HH-AS_MC6.7E − 041.2E − 032.9E − 066.0E − 122.2E − 156.1E − 18


## 6.3. Results on Benchmark Problems in QAPLIB

After observing that HHMBO variants get very successful results for the FOSSP instances, we wanted to see their ability in converging optimal solutions on a widely used problem. We applied HHMBO on QAP, where MBO is firstly applied and tested. IfN is the size of a QAP instance, we limited the run time with N3 iterations. This corresponded to 0.01 s for a problem of size 12 and to 48 s for a problem of size 100 on the specified machine.We have utilized 41 QAPLIB instances with different densities. Density corresponds to the percentage of nonzero entries in the flow matrix. The instance names, densities, size of the instances, best known solutions (BKS), and the percentage deviations of heuristic results from BKS are given in Table15. Problem instances are listed from the sparse one to the dense one. Only the minimum costs obtained in 10 runs are considered, since the aim is to check the ability of HHMBO in finding BKS.Table 15
The percentage deviations of heuristic results from the best solution.
ProblemDensitySizeBKSMBOHHMBOSA_OISR_MCRP_OIRP_MCAS_OIAS_MCesc64a3.17641160.00.00.058.658.60.00.0tai64c4.13641,855,9280.00.00.011.410.10.00.1chr22a8.68226,1569.616.813.341.245.88.17.1esc16j9.381680.00.00.00.025.00.00.0chr20a9.50202,19231.355.356.6147.7132.627.920.1chr20b9.50202,29825.735.947.567.6119.417.836.3chr18a10.491811,09854.271.081.6197.2190.153.855.2esc16i11.7216140.00.00.028.614.30.00.0chr15a12.44159,89622.612.740.476.2116.935.830.1chr15b12.44157,99038.270.537.7193.3168.533.451.4chr15c12.44159,50453.839.262.995.496.639.242.0chr12c15.281211,15614.928.114.360.446.018.88.5chr12a15.28129,55220.537.519.760.258.519.85.7esc16d16.4116160.00.00.012.50.00.00.0esc16e16.4116280.00.00.014.314.30.00.0esc16g16.4116260.00.00.015.423.10.00.0esc32d17.58322000.03.04.037.035.00.00.0esc32c25.59326420.00.00.013.714.00.00.0esc32h27.54324380.02.32.326.521.00.00.0esc16a29.6916680.00.00.08.88.80.00.0scr1537.331551,1407.011.37.029.428.16.99.2esc16c39.84161600.00.00.05.08.80.00.0esc16b71.88162920.00.00.00.00.00.00.0lipa20b89.252027,07611.214.817.222.021.99.811.0esc16h89.84169960.00.00.01.60.00.00.0lipa20a90.25203,6832.23.03.04.54.52.42.7had1291.67121,6520.40.70.13.42.41.00.8rou1291.6712235,5283.04.72.89.89.05.74.9rou1593.3315354,2105.17.76.813.713.45.04.8nug16b93.75161,2403.96.93.412.913.74.54.4els1994.741917,212,5484.78.75.539.747.31.82.7lipa40b94.8140476,5815.321.019.626.026.33.56.5lipa40a95.064031,5381.32.02.02.92.81.61.6lipa50b95.88501,210,24417.921.821.725.325.58.311.2tai60b98.3360608,215,0541.12.22.740.241.00.61.1sko100a99.00100152,0020.75.95.713.913.90.72.6bur26b100.00263,817,8520.10.50.32.53.00.00.1bur26a100.00265,426,6700.10.40.42.81.80.10.2bur26c100.00265,426,7950.00.20.23.13.10.00.1bur26e100.00265,386,8790.00.30.43.43.60.00.1bur26g100.002610,117,1720.00.10.42.63.00.10.0Average8.211.811.734.935.97.57.8The results indicate that AS_IO variant of HHMBO is accomplished on catching promising solutions. HHMBO (AS_OI) is up to 14.6% better than MBO on converging to the BKS. According to the average percentage deviation gained from 41 instances, HHMBO (AS_OI) converges 7.5% to BKS, while MBO is 8.2% close to it. HHMBO (AS_OI) performs 0.7% better than MBO on average. Best performing variant of this experiment is adaptive searching Only Improvement HHMBO. Adaptive searching strategy exploits low-level heuristics depending on their performances. This adaptive feature ensures choosing the most beneficial low-level heuristic for each specific case during the run. It has been observed from the experiments conducted on QAPLIB benchmark problems that HHMBO consistently allows finding better results, albeit slightly.


## 7. Conclusion

In this study, we introduced a novel hybrid computational intelligence algorithm to the literature and the mathematical model of a shift scheduling problem of a manufacturing company defined by including the fairness perspective, which is typically ignored especially in manufacturing industry. The novel algorithm is designed by embedding hyperheuristic (HH) improvements in the migrating bird optimization (MBO) algorithm, called HHMBO. In this way, the exploitation capability of MBO is improved and the solution space is explored in a more diversified manner.The problem that we tackled is called fairness oriented shift scheduling problem (FOSSP). The model of FOSSP is firstly verified with a solver, where the solver is capable of catching global optima with large execution time even for small instances. Therefore, exploitation of heuristic based techniques was an apparent need. In line with this need, we applied HHMBO together with simulated annealing (SA), hyperheuristics (HH), and classical migrating bird optimization (MBO). We have conducted computational experiments in order to assess the performance of the algorithms on synthetic data. Results show the superiority of HHMBO-RP_OI and it is observed that it outperforms its rivals by 40% on average for FOSSP. Besides, it is seen that HHMBO-RP_OI definitely offers better solutions in large problem instances, which is a desired property in practice and gap in the literature. We believe that this good performance is due to integrating the exploitation capability of HH with MBO’s exploration capability.To justify the superiority of HHMBO over the other algorithms, we used QAP instances from the QAPLIB. This experiment was significant to understand whether the achievement of the algorithm is specific to the particular problem. We conducted computational experiments on 41 QAPLIB instances with assorted densities. According to the results of this experiment, AS_OI variant of the new hybrid algorithm could achieve up to 14.6% better results than MBO.There are several interesting directions for future research. The approach may be applied on different types of optimization problems to highlight its wide applicability and generality. An example may be the test suites given in [52]. Furthermore, a comparative study may be conducted on swarm based hybrid algorithms. A multiobjective variation of HHMBO may be developed and may be applied on a set of multiobjective problems. Another research direction is to help solve employee transportation issues while constructing weekly schedules.



---

*Source: 6756588-2021-11-02.xml*