Search results

Hyper-heuristics are a class of high-level search techniques which operate on a search space of heuristics rather than directly on a search space of solutions. The purpose of this paper is to investigate the suitability of using genetic programming as a hyper-heuristic methodology to generate constructive heuristics to solve the multidimensional 0-1 knapsack problem

Early hyper-heuristics focused on selecting and applying a low-level heuristic at each stage of a search. Recent trends in hyper-heuristic research have led to a number of approaches being developed to automatically generate new heuristics from a set of heuristic components. A population of heuristics to rank knapsack items are trained on a subset of test problems and then applied to unseen instances.

The results over a set of standard benchmarks show that genetic programming can be used to generate constructive heuristics which yield human-competitive results.

In this work the authors show that genetic programming is suitable as a method to generate reusable constructive heuristics for the multidimensional 0-1 knapsack problem. This is classified as a hyper-heuristic approach as it operates on a search space of heuristics rather than a search space of solutions. To our knowledge, this is the first time in the literature a GP hyper-heuristic has been used to solve the multidimensional 0-1 knapsack problem. The results suggest that using GP to evolve ranking mechanisms merits further future research effort.

The examination timetabling problem is an NP-hard problem. A large number of approaches for this problem are developed to find more appropriate search strategies. Hyper-heuristic is a kind of representative methods. In hyper-heuristic, the high-level search is executed to construct heuristic lists by traditional methods (such as Tabu search, variable neighborhoods and so on). The purpose of this paper is to apply the evolutionary strategy instead of traditional methods for high-level search to improve the capability of global search.

This paper combines hyper-heuristic with evolutionary strategy to solve examination timetabling problems. First, four graph coloring heuristics are employed to construct heuristic lists. Within the evolutionary algorithm framework, the iterative initialization is utilized to improve the number of feasible solutions in the population; meanwhile, the crossover and mutation operators are applied to find potential heuristic lists in the heuristic space (high-level search). At last, two local search methods are combined to optimize the feasible solutions in the solution space (low-level search).

Experimental results demonstrate that the proposed approach obtains competitive results and outperforms the compared approaches on some benchmark instances.

The contribution of this paper is the development of a framework which combines evolutionary algorithm and hyper-heuristic for examination timetabling problems.

Assembly lines are widely employed in manufacturing processes to produce final products in a flow efficiently. The simple assembly line balancing problem is a basic version of the general problem and has still attracted the attention of researchers. The type-I simple assembly line balancing problems (SALBP-I) aim to minimise the number of workstations on an assembly line by keeping the cycle time constant.

This paper focuses on solving multi-objective SALBP-I problems by utilising an artificial bee colony based-hyper heuristic (ABC-HH) algorithm. The algorithm optimises the efficiency and idleness percentage of the assembly line and concurrently minimises the number of workstations. The proposed ABC-HH algorithm is improved by adding new modifications to each phase of the artificial bee colony framework. Parameter control and calibration are also achieved using the irace method. The proposed model has undergone testing on benchmark problems, and the results obtained have been compared with state-of-the-art algorithms.

The experimental results of the computational study on the benchmark dataset unequivocally establish the superior performance of the ABC-HH algorithm across 61 problem instances, outperforming the state-of-the-art approach.

This research proposes the ABC-HH algorithm with local search to solve the SALBP-I problems more efficiently.

This paper aims to develop an algorithm to study the impact of dynamic resource disruption on project makespan and provide a suitable resource disruption ratio for various complex industrial and emergency projects.

This paper addresses the RCPSP in dynamic environments, which assumes resources will be disrupted randomly, that is, the information about resource disruption is not known in advance. To this end, a reactive scheduling model is proposed for the case of random dynamic disruptions of resources. To solve the reactive scheduling model, a hybrid genetic algorithm with a variable neighborhood search is proposed.

The results obtained on the PSLIB instances prove the performance advantage of the algorithm; through sensitivity analysis, it can be obtained, the project makespan increases exponentially as the number of disruptions increase. Furthermore, if more than 50% of the project's resources are randomly disrupted, the project makespan will be significantly impacted.

The paper focuses on the impact of dynamic resource disruptions on project makespan. Few studies have considered stochastic, dynamic resource uncertainty. In addition, this research proposes a reasonable scheduling algorithm for the research problem, and the conclusions drawn from the research provide decision support for project managers.

Work crew productivity and the application of limited resources are necessary elements in construction duration delay analysis. This study thus proposes a method to analyze construction delays and resource reallocation based on work crew productivity and resource constraints. The study also presents an economic feasibility analysis that maximizes economic effect by reducing construction duration, the cost of resource reallocation, delay liquidated damages (DLDs) and incentives for reducing contractual duration.

The proposed method involved three steps. First, work crew characteristics such as productivity, unit price and workload helped analyze delay information, including delay duration, reducible duration and daily reduced cost. Next, a goal programming method assessed resource reallocation based on the priority (as determined by decision-makers) of each constraint condition, such as the available number of workers, cost, goal workload and statutory working hours. Lastly, the level of reallocation was analyzed based on the results of the economic feasibility analysis and decision-makers’ delay attitudes.

A case study was performed to test the proposed method's applicability. Its involved sensitivity analysis indicated proposing to decision-makers a scenario based on the prioritization of economic feasibility. The proposed method's applicability proved high for decision-makers, as they can determine whether to reduce construction duration per the proposed data.

The proposed method's main contribution is the reallocation of resources to reduce construction duration based on work crew productivity and the prioritization of limited resources. The proposed method can analyze the differences in productivity between the plan and actual progress, as well as calculate the necessary number of workers. Decision-makers can then reduce the appropriate level of contractual duration based on their own delay attitude, constraint condition prioritization and results from daily economic feasibility analyses.

This paper aims to consider the exam timetabling of the re‐sit session in the Faculty of Economics and Management Sciences of Sfax. The objective is to find a timetable which minimizes the number of timeslots for exams required by the enrolled students.

Two heuristic procedures based on graph colouring are developed and tested on real data to solve the exam timetabling problem at the faculty.

These heuristics were tested on a simple example which shows the out‐performance of the second heuristic compared with the first one. When tested with the real data of the faculty, exam size heuristic provides a timetable with a shorter timeframe; however, the timetable obtained from the second heuristic is of better quality.

The main contribution of this paper is to create an automated exam timetabling that helps the faculty to manage its own enterprise system.

The purpose of this research is to study the Multi-Skill Resource-Constrained Multi-Project Scheduling Problem (MSRCMPSP), where (1) durations of activities depend on the familiarity levels of assigned workers, (2) more efficient workers demand higher per-day salaries, (3) projects have different due dates and (4) the budget of each period varies over time. The proposed model is bi-objective, and its objectives are minimization of completion times and costs of all projects, simultaneously.

This paper proposes a two-phase approach based on the Statistical Process Control (SPC) to solve this problem. This approach aims to develop a control chart so as to monitor the performance of an optimizer during the optimization process. In the first phase, a multi-objective statistical model has been used to obtain control limits of this chart. To solve this model, a Multi-Objective Greedy Randomized Adaptive Search Procedure (MOGRASP) has been hired. In the second phase, the MSRCMPSP is solved via a New Version of the Multi-Objective Variable Neighborhood Search Algorithm (NV-MOVNS). In each iteration, the developed control chart monitors the performance of the NV-MOVNS to obtain proper solutions. When the control chart warns about an out-of control state, a new procedure based on the Conway’s Game of Life, which is a cellular automaton, is used to bring the algorithm back to the in-control state.

The proposed two-phase approach has been used in solving several standard test problems available in the literature. The results are compared with the outputs of some other methods to assess the efficiency of this approach. Comparisons imply the high efficiency of the proposed approach in solving test problems with different sizes.

The proposed model and approach have been used to schedule multiple projects of a construction company in Iran. The outputs show that both the model and the NV-MOVNS can be used in real-world multi-project scheduling problems.

Due to the numerous numbers of studies reviewed in this research, the authors discovered that there are few researches on the multi-skill resource-constrained multi-project scheduling problem (MSRCMPSP) with the aforementioned characteristics. Moreover, none of the previous researches proposed an SPC-based solution approach for meta-heuristics in order to solve the MSRCMPSP.

Statistics in the construction industry show that lack of timely injection of funds to projects by clients is one of the common problems confronted by contractors. This problem is intensified when contractors construct multiple projects simultaneously. In these situations, it is rational that contractors share their financial resources among projects according to project conditions and the firm’s vision. This study aims to propose a fuzzy multi-criteria decision making (MCDM) model for financial management in multiple project environments.

First, the project evaluation criteria are defined using exploratory study and interviews with experts. Second, the weights of criteria are determined based on company strategies. Then, each of the projects are evaluated in each criterion. Finally, the fuzzy weighted average approach is used to determine the proportion of each project from the financial resources.

The proposed model is prepared as an applicable model for general contractors to assign financial recourses among the multiple projects optimally.

As a lack of applicable model assigning the financial resources among the multiple projects, this study is one of the first research studies that proposed a fuzzy MCDM model to assign financial resources to multiple projects optimally.

This paper aims to address a distributed assembly permutation flow-shop scheduling problem (DAPFSP) considering budget constraints and factory eligibility. The first stage of the considered production system is composed of several non-identical factories with different technology levels and so the factories' performance is different in terms of processing time and cost. The second stage is an assembly stage wherein there are some parallel work stations to assemble the ready parts into the products. The objective function is to minimize the maximum completion time of products (makespan).

First, the problem is formulated as mixed-integer linear programing (MIP) model. In view of the nondeterministic polynomial (NP)-hard nature, three approximate algorithms are adopted based on variable neighborhood search (VNS) and the Johnsons' rule to solve the problem on the practical scales. The proposed algorithms are applied to solve some test instances in different sizes.

Comparison result to mathematical model validates the performance accuracy and efficiency of three proposed methods. In addition, the result demonstrated that the proposed two-level self-adaptive variable neighborhood search (TLSAVNS) algorithm outperforms the other two proposed methods. Moreover, the proposed model highlighted the effects of budget constraints and factory eligibility on the makespan. Supplementary analysis was presented by adjusting different amounts of the budget for controlling the makespan and total expected costs. The proposed solution approach can provide proper alternatives for managers to make a trade-off in different various situations.

The problem of distributed assembly permutation flow-shop scheduling is traditionally studied considering identical factories. However, processing factories as an important element in the supply chain use different technology levels in the real world. The current paper is the first study that investigates that problem under non-identical factories condition. In addition, the impact of different technology levels is investigated in terms of operational costs, quality levels and processing times.