Design of personalized location areas for future Pcs networks

In Global Systems for Mobile Communications (GSM), always-update location strategy is used to keep track of mobile terminals within the network. However future Personal Communication Networks (PCS) will require to serve a wide range of services (digital voice, video, data, and email) and also will have to support a large population of users. Under such demands, determining the exact location of a user by traditional strategies would be difficult and would result in increasing the signaling load imposed by location-update and paging procedures. The problem is not only in increasing cost, but also in non-efficient utilization of a precious resource, i.e., radio bandwidth; In this thesis, personalized Location Areas (PLAs) are formed considering the mobility patterns of individual users in the system such that the signaling due to location update and paging is minimized. We prove that the problem in this formulation is of NP complexity. Therefore we study efficient optimization techniques able to avoid combinatorial search. Three known classes of optimization techniques are studied. They are Simulated Annealing, Tabu Search and Genetic Search. Three algorithms are designed for solving the problem. Modeling does not assume any specific cell structure or network topology that makes the proposal widely applicable. The behavior of mobile terminals in the network is modeled as Random Walk with an absorbing state and the Markov chain is used for cost analysis; Numeric simulation carried out for 25 and 100 hexagonal cell networks have shown that Simulated Annealing based algorithm outperforms other two by indicators of the runtime complexity and signaling cost of location management. The ID\u27s of cells populating the calculated area are provided to the mobile terminal and saved in its local memory every time the mobile subscriber moves out its current location area. Otherwise, no location update is performed, but only paging. Thus, at the expense of small local memory, the location management is carried more efficiently

Analysis of manufacturing operations using knowledge- Enriched aggregate process planning

Knowledge-Enriched Aggregate Process Planning is concerned with the problem of supporting agile design and manufacture by making process planning feedback integral to the design function. A novel Digital Enterprise Technology framework (Maropoulos 2003) provides the technical context and is the basis for the integration of the methods with existing technologies for enterprise-wide product development. The work is based upon the assertion that, to assure success when developing new products, the technical and qualitative evaluation of process plans must be carried out as early as possible. An intelligent exploration methodology is presented for the technical evaluation of the many alternative manufacturing options which are feasible during the conceptual and embodiment design phases. 'Data resistant' aggregate product, process and resource models are the foundation of these planning methods. From the low-level attributes of these models, aggregate methods to generate suitable alternative process plans and estimate Quality, Cost and Delivery (QCD) have been created. The reliance on QCD metrics in process planning neglects the importance of tacit knowledge that people use to make everyday decisions and express their professional judgement in design. Hence, the research also advances the core aggregate planning theories by developing knowledge-enrichment methods for measuring and analysing qualitative factors as an additional indicator of manufacturing performance, which can be used to compute the potential of a process plan. The application of these methods allows the designer to make a comparative estimation of manufacturability for design alternatives. Ultimately, this research should translate into significant reductions in both design costs and product development time and create synergy between the product design and the manufacturing system that will be used to make it. The efficacy of the methodology was proved through the development of an experimental computer system (called CAPABLE Space) which used real industrial data, from a leading UK satellite manufacturer to validate the industrial benefits and promote the commercial exploitation of the research

Location and resource management for quality of service provisioning in wireless/mobile networks

Wireless communication has been seen unprecedented growth in recent years. As the wireless network migrates from 2G to 2.5G and 3G, more and more high-bandwidth services have to be provided to wireless users. However, existing radio resources are limited, thus quality-of-service (QoS) provisioning is extremely important for high performance networKing In this dissertation, we focus on two problems crucial for QoS provisioning in wireless networks. They are location and resource management. Our research is aimed to develop efficient location management and resource allocation techniques to provide qualitative services in the future generations of wireless/mobile networks. First, the hybrid location update method (HLU) is proposed based on both the moving distance and the moving direction of mobile terminals. The signaling cost for location management is analyzed using a 2D Markov walk model. The results of numerical studies for different mobility patterns show that the HLU scheme outperforms the methods employing either moving distance or moving direction. Next, a new dynamic location management scheme with personalized location areas is developed. It takes into account terminal\u27s mobility characteristics in different locations of the service area. The location area is designed for each individual mobile user such that the location management cost is minimized. The cost is calculated based on a continuous-time Markov chain. Simulation results acknowledge a lower cost of the proposed scheme compared to that of some known techniques. Our research on the resource management considers the dynamic allocation strategy in the integrated voice/data wireless networks. We propose two new channel de-allocation schemes, i.e., de-allocation for data packet (DASP) and de-allocation for both voice call and data packet (DASVP). We then combine the proposed de-allocation methods with channel re-allocation, and evaluate the performance of the schemes using an analytic model. The results indicate the necessity of adapting to QoS requirements on both voice call and data packet. Finally, a new QoS-based dynamic resource allocation scheme is proposed which differentiates the new and handoff voice calls. The scheme combines channel reservation, channel de-allocation/re-allocation for voice call and packet queue to adapt to QoS requirements by adjusting the number of reserved channels and packet queue size. The superiority of the propose scheme in meeting the QoS requirements over existing techniques is proved by the experimental studies

Learning-based tracking area list management in 4G and 5G networks

© 2020 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other worksMobility management in 5G networks is a very challenging issue. It requires novel ideas and improved management so that signaling is kept minimized and far from congesting the network. Mobile networks have become massive generators of data and in the forthcoming years this data is expected to increase drastically. The use of intelligence and analytics based on big data is a good ally for operators to enhance operational efficiency and provide individualized services. This work proposes to exploit User Equipment (UE) patterns and hidden relationships from geo-spatial time series to minimize signaling due to idle mode mobility. We propose a holistic methodology to generate optimized Tracking Area Lists (TALs) in a per UE manner, considering its learned individual behavior. The k -means algorithm is proposed to find the allocation of cells into tracking areas. This is used as a basis for the TALs optimization itself, which follows a combined multi-objective and single-objective approach depending on the UE behavior. The last stage identifies UE profiles and performs the allocation of the TAL by using a neural network. The goodness of each technique has been evaluated individually and jointly under very realistic conditions and different situations. Results demonstrate important signaling reductions and good sensitivity to changing conditions.This work was supported by the Spanish National Science Council and ERFD funds under projects TEC2014-60258-C2-2-R and RTI2018-099880-B-C32.Peer ReviewedPostprint (author's final draft

Advances in Grid Computing

This book approaches the grid computing with a perspective on the latest achievements in the field, providing an insight into the current research trends and advances, and presenting a large range of innovative research papers. The topics covered in this book include resource and data management, grid architectures and development, and grid-enabled applications. New ideas employing heuristic methods from swarm intelligence or genetic algorithm and quantum encryption are considered in order to explain two main aspects of grid computing: resource management and data management. The book addresses also some aspects of grid computing that regard architecture and development, and includes a diverse range of applications for grid computing, including possible human grid computing system, simulation of the fusion reaction, ubiquitous healthcare service provisioning and complex water systems

Planning and Scheduling Optimization

Although planning and scheduling optimization have been explored in the literature for many years now, it still remains a hot topic in the current scientific research. The changing market trends, globalization, technical and technological progress, and sustainability considerations make it necessary to deal with new optimization challenges in modern manufacturing, engineering, and healthcare systems. This book provides an overview of the recent advances in different areas connected with operations research models and other applications of intelligent computing techniques used for planning and scheduling optimization. The wide range of theoretical and practical research findings reported in this book confirms that the planning and scheduling problem is a complex issue that is present in different industrial sectors and organizations and opens promising and dynamic perspectives of research and development

A novel combination of Cased-Based Reasoning and Multi Criteria Decision Making approach to radiotherapy dose planning

In this thesis, a set of novel approaches has been developed by integration of Cased-Based Reasoning (CBR) and Multi-Criteria Decision Making (MCDM) techniques. Its purpose is to design a support system to assist oncologists with decision making about the dose planning for radiotherapy treatment with a focus on radiotherapy for prostate cancer. CBR, an artificial intelligence approach, is a general paradigm to reasoning from past experiences. It retrieves previous cases similar to a new case and exploits the successful past solutions to provide a suggested solution for the new case. The case pool used in this research is a dataset consisting of features and details related to successfully treated patients in Nottingham University Hospital. In a typical run of prostate cancer radiotherapy simple CBR, a new case is selected and thereafter based on the features available at our data set the most similar case to the new case is obtained and its solution is prescribed to the new case. However, there are a number of deficiencies associated with this approach. Firstly, in a real-life scenario, the medical team considers multiple factors rather than just the similarity between two cases and not always the most similar case provides with the most appropriate solution. Thus, in this thesis, the cases with high similarity to a new case have been evaluated with the application of the Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS). This approach takes into account multiple criteria besides similarity to prescribe a final solution. Moreover, the obtained dose plans were optimised through a Goal Programming mathematical model to improve the results. By incorporating oncologists’ experiences about violating the conventionally available dose limits a system was devised to manage the trade-off between treatment risk for sensitive organs and necessary actions to effectively eradicate cancer cells. Additionally, the success rate of the treatment, the 2-years cancer free possibility, has a vital role in the efficiency of the prescribed solutions. To consider the success rate, as well as uncertainty involved in human judgment about the values of different features of radiotherapy Data Envelopment Analysis (DEA) based on grey numbers, was used to assess the efficiency of different treatment plans on an input and output based approach. In order to deal with limitations involved in DEA regarding the number of inputs and outputs, we presented an approach for Factor Analysis based on Principal Components to utilize the grey numbers. Finally, to improve the CBR base of the system, we applied Grey Relational Analysis and Gaussian distant based CBR along with features weight selection through Genetic Algorithm to better handle the non-linearity exists within the problem features and the high number of features. Finally, the efficiency of each system has been validated through leave-one-out strategy and the real dataset. The results demonstrated the efficiency of the proposed approaches and capability of the system to assist the medical planning team. Furthermore, the integrated approaches developed within this thesis can be also applied to solve other real-life problems in various domains other than healthcare such as supply chain management, manufacturing, business success prediction and performance evaluation

From metaheuristics to learnheuristics: Applications to logistics, finance, and computing

Un gran nombre de processos de presa de decisions en sectors estratègics com el transport i la producció representen problemes NP-difícils. Sovint, aquests processos es caracteritzen per alts nivells d'incertesa i dinamisme. Les metaheurístiques són mètodes populars per a resoldre problemes d'optimització difícils en temps de càlcul raonables. No obstant això, sovint assumeixen que els inputs, les funcions objectiu, i les restriccions són deterministes i conegudes. Aquests constitueixen supòsits forts que obliguen a treballar amb problemes simplificats. Com a conseqüència, les solucions poden conduir a resultats pobres. Les simheurístiques integren la simulació a les metaheurístiques per resoldre problemes estocàstics d'una manera natural. Anàlogament, les learnheurístiques combinen l'estadística amb les metaheurístiques per fer front a problemes en entorns dinàmics, en què els inputs poden dependre de l'estructura de la solució. En aquest context, les principals contribucions d'aquesta tesi són: el disseny de les learnheurístiques, una classificació dels treballs que combinen l'estadística / l'aprenentatge automàtic i les metaheurístiques, i diverses aplicacions en transport, producció, finances i computació.Un gran número de procesos de toma de decisiones en sectores estratégicos como el transporte y la producción representan problemas NP-difíciles. Frecuentemente, estos problemas se caracterizan por altos niveles de incertidumbre y dinamismo. Las metaheurísticas son métodos populares para resolver problemas difíciles de optimización de manera rápida. Sin embargo, suelen asumir que los inputs, las funciones objetivo y las restricciones son deterministas y se conocen de antemano. Estas fuertes suposiciones conducen a trabajar con problemas simplificados. Como consecuencia, las soluciones obtenidas pueden tener un pobre rendimiento. Las simheurísticas integran simulación en metaheurísticas para resolver problemas estocásticos de una manera natural. De manera similar, las learnheurísticas combinan aprendizaje estadístico y metaheurísticas para abordar problemas en entornos dinámicos, donde los inputs pueden depender de la estructura de la solución. En este contexto, las principales aportaciones de esta tesis son: el diseño de las learnheurísticas, una clasificación de trabajos que combinan estadística / aprendizaje automático y metaheurísticas, y varias aplicaciones en transporte, producción, finanzas y computación.A large number of decision-making processes in strategic sectors such as transport and production involve NP-hard problems, which are frequently characterized by high levels of uncertainty and dynamism. Metaheuristics have become the predominant method for solving challenging optimization problems in reasonable computing times. However, they frequently assume that inputs, objective functions and constraints are deterministic and known in advance. These strong assumptions lead to work on oversimplified problems, and the solutions may demonstrate poor performance when implemented. Simheuristics, in turn, integrate simulation into metaheuristics as a way to naturally solve stochastic problems, and, in a similar fashion, learnheuristics combine statistical learning and metaheuristics to tackle problems in dynamic environments, where inputs may depend on the structure of the solution. The main contributions of this thesis include (i) a design for learnheuristics; (ii) a classification of works that hybridize statistical and machine learning and metaheuristics; and (iii) several applications for the fields of transport, production, finance and computing