On the performance of metaheuristics for the blood platelet production and inventory problem.

Master of Science in Computer Science. University of KwaZulu-Natal, Durban, 2016.Abstract available in PDF file

Traveling Salesman Problem

This book is a collection of current research in the application of evolutionary algorithms and other optimal algorithms to solving the TSP problem. It brings together researchers with applications in Artificial Immune Systems, Genetic Algorithms, Neural Networks and Differential Evolution Algorithm. Hybrid systems, like Fuzzy Maps, Chaotic Maps and Parallelized TSP are also presented. Most importantly, this book presents both theoretical as well as practical applications of TSP, which will be a vital tool for researchers and graduate entry students in the field of applied Mathematics, Computing Science and Engineering

Dynamic temporary blood facility location-allocation during and post-disaster periods

The key objective of this study is to develop a tool (hybridization or integration of different techniques) for locating the temporary blood banks during and post-disaster conditions that could serve the hospitals with minimum response time. We have used temporary blood centers, which must be located in such a way that it is able to serve the demand of hospitals in nearby region within a shorter duration. We are locating the temporary blood centres for which we are minimizing the maximum distance with hospitals. We have used Tabu search heuristic method to calculate the optimal number of temporary blood centres considering cost components. In addition, we employ Bayesian belief network to prioritize the factors for locating the temporary blood facilities. Workability of our model and methodology is illustrated using a case study including blood centres and hospitals surrounding Jamshedpur city. Our results shows that at-least 6 temporary blood facilities are required to satisfy the demand of blood during and post-disaster periods in Jamshedpur. The results also show that that past disaster conditions, response time and convenience for access are the most important factors for locating the temporary blood facilities during and post-disaster periods

Scaffolding learning by modelling: The effects of partially worked-out models

Creating executable computer models is a potentially powerful approach to science learning. Learning by modelling is also challenging because students can easily get overwhelmed by the inherent complexities of the task. This study investigated whether offering partially worked-out models can facilitate students’ modelling practices and promote learning. Partially worked-out models were expected to aid model construction by revealing the overall structure of the model, and thus enabling student to create better models and learn from the experience. This assumption was tested in high school biology classes where students modelled the human glucose-insulin regulatory system. Students either received support in the form of a partial model that outlined the basic structure of the glucose-insulin system (PM condition; n = 26), an extended partial model that also contained a set of variables students could use to complete the model (PM+ condition; n = 21), or no support (control condition; n = 23). Results showed a significant knowledge increase from pretest to posttest in all conditions. Consistent with expectations, knowledge gains were higher in the two partial model conditions than in the control condition. Students in both partial model conditions also ran their model more often to check its accuracy, and eventually built better models than students from the control condition. Comparison between the PM and PM+ conditions showed that more extensive support further increased knowledge acquisition, model quality, and model testing activities. Based on these findings, it was concluded that partial solutions can support learning by modelling, and that offering both a structure of a model and a list of variables yields the best result

An Adaptive Large Neighborhood Search Heuristic for the Inventory Routing Problem with Time Windows

This research addresses an integrated distribution and inventory control problem which is faced by a large retail chain in the United States. In their current distribution network, a direct shipping policy is used to keep stores stocked with products. The shipping policy specifies that a dedicated trailer should be sent from the warehouse to a store when the trailer is full or after five business days, whichever comes first. Stores can only receive deliveries during a window of time (6 am to 6 pm). The retail chain is seeking more efficient alternatives to this policy, as measured by total transportation, inventory holding and lost sales costs. More specifically, the goal of this research is to determine the optimal timing and magnitudes of deliveries to stores across a planning horizon. While dedicated shipments to stores will be allowed under the optimal policy, options that combine deliveries for multiple stores into a single route should also be considered. This problem is modeled as an Inventory Routing Problem with time window constraints. Due to the complexity and size of this NP-hard combinatorial optimization problem, an adaptive large neighborhood search heuristic is developed to obtain solutions. Results are provided for a realistic set of test instances

An Ontology And Constraint-based Approach For Dynamic Personalised Planning In Healthcare

Para doktor atau pakar kesihatan semestinya mengambil berat berkenaan pengemaskinian rekod atau profil pesakit mereka Healthcare service providers are undoubtedly concerned about updating their patients’ health records or profile