Search results for "Heuristic"
showing 10 items of 476 documents
Fault-Tolerant Application-Specific Topology-Based NoC and Its Prototype on an FPGA
2021
Application-Specific Networks-on-Chips (ASNoCs) are suitable communication platforms for meeting current application requirements. Interconnection links are the primary components involved in communication between the cores of an ASNoC design. The integration density in ASNoC increases with continuous scaling down of the transistor size. Excessive integration density in ASNoC can result in the formation of thermal hotspots, which can cause a system to fail permanently. As a result, fault-tolerant techniques are required to address the permanent faults in interconnection links of an ASNoC design. By taking into account link faults in the topology, this paper introduces a fault-tolerant appli…
A hybrid bio-inspired approach to solving the routing problem in mobile ad hoc networks
2018
A mobile ad hoc network (MANET) is an autonomous system of mobile hosts (nodes) connected by a wireless link. However, the problem of designing routing protocols poses challenges to researchers due to the unpredictable and dynamic nature of ad hoc networks. Hence, bio-inspired algorithms are widely used to design adaptive routing strategies for MANETs. This paper proposes a routing protocol based on the hybridisation of ant colony optimisation (ACO) and 2-opt heuristic with the optimisation of ACO parameters. Given the vast scope of the parameters, a genetic algorithm is used to minimise the complexity of the problem. The implementation of the method is realised by MATLAB. To valid the resu…
Pre-emption in resource-constrained project scheduling
2008
Abstract The Resource-Constrained Project Scheduling Project (RCPSP), together with some of its extensions, has been widely studied. A fundamental assumption in this basic problem is that activities in progress are non-preemptable. Very little effort has been made to uncover the potential benefits of discrete activity pre-emption, and the papers dealing with this issue have reached the conclusion that it has little effect on project length when constant resource availability levels are defined. In this paper we show how three basic elements of many heuristics for the RCPSP – codification, serial SGS and double justification – can be adapted to deal with interruption. The paper is mainly foc…
An adaptive multimeme algorithm for designing HIV multidrug therapies.
2007
This paper proposes a period representation for modeling the multidrug HIV therapies and an Adaptive Multimeme Algorithm (AMmA) for designing the optimal therapy. The period representation offers benefits in terms of flexibility and reduction in dimensionality compared to the binary representation. The AMmA is a memetic algorithm which employs a list of three local searchers adaptively activated by an evolutionary framework. These local searchers, having different features according to the exploration logic and the pivot rule, have the role of exploring the decision space from different and complementary perspectives and, thus, assisting the standard evolutionary operators in the optimizati…
Justification and RCPSP: A technique that pays
2005
Abstract The objective of this paper is to show that justification is a simple technique that can be easily incorporated in diverse algorithms for the resource-constrained project scheduling problem––improving the quality of the schedules generated without generally requiring more computing time. The results of incorporating this technique in 22 different algorithms are shown. Fifteen of the new algorithms that use double justification outperform seven of the best heuristic algorithms that do not use justification. The tests have been performed on the standard test set j120 for the RCPSP generated using ProGen.
Design and implementation of a course scheduling system using Tabu Search
2002
Abstract Building a course timetable is a difficult and lengthy task which universities devote a large amount of human and material resources to every year. We have developed a computer package to solve this problem. The program runs on a PC and the user may set the objectives and parameters from among a wide range of possibilities. It has a user-friendly interface for the user to input the relevant data and obtain the corresponding results. The optimization process is based on a set of heuristic algorithms. The core is a Tabu Search procedure for which several strategies have been developed and tested in order to get a fast and powerful algorithm. The first tests of the package have produc…
A hybrid genetic algorithm for the resource-constrained project scheduling problem
2008
Abstract In this paper we propose a Hybrid Genetic Algorithm (HGA) for the Resource-Constrained Project Scheduling Problem (RCPSP). HGA introduces several changes in the GA paradigm: a crossover operator specific for the RCPSP; a local improvement operator that is applied to all generated schedules; a new way to select the parents to be combined; and a two-phase strategy by which the second phase re-starts the evolution from a neighbour’s population of the best schedule found in the first phase. The computational results show that HGA is a fast and high quality algorithm that outperforms all state-of-the-art algorithms for the RCPSP known by the authors of this paper for the instance sets j…
Preparing Teachers for Teaching Probability Through Problem Solving
2018
In this paper we introduce the idea of solving problems by simulation with didactical intention. Based on this idea, we analyse the way we prepare the teachers to teach solving probability problems by simulation, in distinguishing whether the teaching is offered to prospective elementary teachers or secondary school teachers. The process of solving probability problems is seen as an inquiry process, which uses simulation as a resolution method with heuristic content, so that the preparation of teacher is then based on this approach. Therefore, prospective teachers should have the opportunities to learn about probability problems, about the process of solving probability problems, and about …
An Overview of the Application of Deep Learning in Short Read Sequence Classification
2020
AbstractAdvances in sequencing technology have led to an ever increasing amount of available short read sequencing data. This has, consequently, exacerbated the need for efficient and precise classification tools that can be used in the analysis of this data. As it stands, recent years have shown that massive leaps in performance can be achieved when it comes to approaches that are based in heuristics, and alongside these improvements there has been an ever increasing interest in applying deep learning techniques to revolutionize this classification task. We attempt to gather up these approaches and to evaluate their performance in a reproducible fashion to get a better perspective on the c…
Vehicle routing with private and shared delivery locations
2021
Abstract The rapid growth of e-commerce has led to an increase of home delivery requests. Providing efficient distribution systems for services on the last mile has become a challenging issue for logistics companies, where a trade-off between the classical approaches, attended home delivery (AHD) and usage of shared delivery locations (SDLs) has been identified. AHD provides a higher quality of service but implies very high costs for the company, while usage of SDL requires customers to perform the very last mile by themselves. For companies, this bears the risk of a decrease in the perceived service quality. However, due to consolidation effects, transportation costs can be considerably mi…