2,507 research outputs found
A hybrid CFGTSA based approach for scheduling problem: a case study of an automobile industry
In the global competitive world swift, reliable and cost effective production subject to uncertain situations, through an appropriate management of the available resources, has turned out to be the necessity for surviving in the market. This inspired the development of the more efficient and robust methods to counteract the existing complexities prevailing in the market. The present paper proposes a hybrid CFGTSA algorithm inheriting the salient features of GA, TS, SA, and chaotic theory to solve the complex scheduling problems commonly faced by most of the manufacturing industries. The proposed CFGTSA algorithm has been tested on a scheduling problem of an automobile industry, and its efficacy has been shown by comparing the results with GA, SA, TS, GTS, and hybrid TSA algorithms
A hybrid genetic algorithm and tabu search approach for post enrolment course timetabling
Copyright @ Springer Science + Business Media. All rights reserved.The post enrolment course timetabling problem (PECTP) is one type of university course timetabling problems, in which a set of events has to be scheduled in time slots and located in suitable rooms according to the student enrolment data. The PECTP is an NP-hard combinatorial optimisation problem and hence is very difficult to solve to optimality. This paper proposes a hybrid approach to solve the PECTP in two phases. In the first phase, a guided search genetic algorithm is applied to solve the PECTP. This guided search genetic algorithm, integrates a guided search strategy and some local search techniques, where the guided search strategy uses a data structure that stores useful information extracted from previous good individuals to guide the generation of offspring into the population and the local search techniques are used to improve the quality of individuals. In the second phase, a tabu search heuristic is further used on the best solution obtained by the first phase to improve the optimality of the solution if possible. The proposed hybrid approach is tested on a set of benchmark PECTPs taken from the international timetabling competition in comparison with a set of state-of-the-art methods from the literature. The experimental results show that the proposed hybrid approach is able to produce promising results for the test PECTPs.This work was supported by the Engineering and Physical Sciences Research Council (EPSRC) of UK under Grant EP/E060722/01 and Grant EP/E060722/02
A Component Based Heuristic Search Method with Evolutionary Eliminations
Nurse rostering is a complex scheduling problem that affects hospital
personnel on a daily basis all over the world. This paper presents a new
component-based approach with evolutionary eliminations, for a nurse scheduling
problem arising at a major UK hospital. The main idea behind this technique is
to decompose a schedule into its components (i.e. the allocated shift pattern
of each nurse), and then to implement two evolutionary elimination strategies
mimicking natural selection and natural mutation process on these components
respectively to iteratively deliver better schedules. The worthiness of all
components in the schedule has to be continuously demonstrated in order for
them to remain there. This demonstration employs an evaluation function which
evaluates how well each component contributes towards the final objective. Two
elimination steps are then applied: the first elimination eliminates a number
of components that are deemed not worthy to stay in the current schedule; the
second elimination may also throw out, with a low level of probability, some
worthy components. The eliminated components are replenished with new ones
using a set of constructive heuristics using local optimality criteria.
Computational results using 52 data instances demonstrate the applicability of
the proposed approach in solving real-world problems.Comment: 27 pages, 4 figure
- …