Optimisation of Mobile Communication Networks - OMCO NET

The mini conference “Optimisation of Mobile Communication Networks” focuses on advanced methods for search and optimisation applied to wireless communication networks. It is sponsored by Research & Enterprise Fund Southampton Solent University. The conference strives to widen knowledge on advanced search methods capable of optimisation of wireless communications networks. The aim is to provide a forum for exchange of recent knowledge, new ideas and trends in this progressive and challenging area. The conference will popularise new successful approaches on resolving hard tasks such as minimisation of transmit power, cooperative and optimal routing

Missile system support locations optimization

Issued as Final summary report, Project no. E-24-64

Stochastic on-time arrival problem in transit networks

This article considers the stochastic on-time arrival problem in transit networks where both the travel time and the waiting time for transit services are stochastic. A specific challenge of this problem is the combinatorial solution space due to the unknown ordering of transit line arrivals. We propose a network structure appropriate to the online decision-making of a passenger, including boarding, waiting and transferring. In this framework, we design a dynamic programming algorithm that is pseudo-polynomial in the number of transit stations and travel time budget, and exponential in the number of transit lines at a station, which is a small number in practice. To reduce the search space, we propose a definition of transit line dominance, and techniques to identify dominance, which decrease the computation time by up to 90% in numerical experiments. Extensive numerical experiments are conducted on both a synthetic network and the Chicago transit network.Comment: 29 pages; 12 figures. This manuscript version is made available under the CC-BY-NC-ND 4.0 license https://creativecommons.org/licenses/by-nc-nd/4.0

Modeling and Robust Design of Networks under Risk: The Case of Information Infrastructure

Study of network risks allows to develop insights into the methods of building robust networks, which are also critical elements of infrastructures that are of a paramount importance for the modern society. In this paper we show how the modern quantitative modeling methodologies can be employed for analysis of network risks and for design of robust networks under uncertainty. This is done on the example of important problem arising in the process of building of the information infrastructure: provision of advanced mobile data services. We show how portfolio theory developed in the modern finance can be used for design of robust provision network comprising of independent agents. After this the modeling frameworks of Bayesian nets andMarkov fields are used for the study of several problems fundamental for the process of service adoption such as the sensitivity of networks, the direction of improvements, and the propagation of user attitudes on social networks

Models, Theoretical Properties, and Solution Approaches for Stochastic Programming with Endogenous Uncertainty

In a typical optimization problem, uncertainty does not depend on the decisions being made in the optimization routine. But, in many application areas, decisions affect underlying uncertainty (endogenous uncertainty), either altering the probability distributions or the timing at which the uncertainty is resolved. Stochastic programming is a widely used method in optimization under uncertainty. Though plenty of research exists on stochastic programming where decisions affect the timing at which uncertainty is resolved, much less work has been done on stochastic programming where decisions alter probability distributions of uncertain parameters. Therefore, we propose methodologies for the latter category of optimization under endogenous uncertainty and demonstrate their benefits in some application areas. First, we develop a data-driven stochastic program (integrates a supervised machine learning algorithm to estimate probability distributions of uncertain parameters) for a wildfire risk reduction problem, where resource allocation decisions probabilistically affect uncertain human behavior. The nonconvex model is linearized using a reformulation approach. To solve a realistic-sized problem, we introduce a simulation program to efficiently compute the recourse objective value for a large number of scenarios. We present managerial insights derived from the results obtained based on Santa Fe National Forest data. Second, we develop a data-driven stochastic program with both endogenous and exogenous uncertainties with an application to combined infrastructure protection and network design problem. In the proposed model, some first-stage decision variables affect probability distributions, whereas others do not. We propose an exact reformulation for linearizing the nonconvex model and provide a theoretical justification of it. We designed an accelerated L-shaped decomposition algorithm to solve the linearized model. Results obtained using transportation networks created based on the southeastern U.S. provide several key insights for practitioners in using this proposed methodology. Finally, we study submodular optimization under endogenous uncertainty with an application to complex system reliability. Specifically, we prove that our stochastic program\u27s reliability maximization objective function is submodular under some probability distributions commonly used in reliability literature. Utilizing the submodularity, we implement a continuous approximation algorithm capable of solving large-scale problems. We conduct a case study demonstrating the computational efficiency of the algorithm and providing insights

Doctor of Philosophy

dissertationThis dissertation aims to develop an innovative and improved paradigm for real-time large-scale traffic system estimation and mobility optimization. To fully utilize heterogeneous data sources in a complex spatial environment, this dissertation proposes an integrated and unified estimation-optimization framework capable of interpreting different types of traffic measurements into various decision-making processes. With a particular emphasis on the end-to-end travel time prediction problem, this dissertation proposes an information-theoretic sensor location model that aims to maximize information gains from a set of point, point-to-point and probe sensors in a traffic network. After thoroughly examining a number of possible measures of information gain, this dissertation selects a path travel time prediction uncertainty criterion to construct a joint sensor location and travel time estimation/prediction framework. To better measure the quality of service for ransportation systems, this dissertation investigates the path travel time reliability from two perspectives: variability and robustness. Based on calibrated travel disutility functions, the path travel time variability in this research is represented by its standard deviation in addition to the mean travel time. To handle the nonlinear and nonadditive cost functions introduced by the quadratic forms of the standard deviation term, a novel Lagrangian substitution approach is introduced to estimate the lower bound of the most reliable path solution through solving a sequence of standard shortest path problems. To recognize the asymmetrical and heavy-tailed travel time distributions, this dissertation proposes Lagrangian relaxation based iterative search algorithms for finding the absolute and percentile robust shortest paths. Moreover, this research develops a sampling-based method to dynamically construct a proxy objective function in terms of travel time observations from multiple days. Comprehensive numerical experiment results with real-world travel time measurements show that 10-20 iterations of standard shortest path algorithms for the reformulated models can offer a very small relative duality gap of about 2-6%, for both reliability measure models. This broadly-defined research has successfully addressed a number of theoretically challenging and practically important issues for building the next-generation Advanced Traveler Information Systems, and is expected to offer a rich foundation beneficial to the model and algorithmic development of sensor network design, traffic forecasting and personalized navigation

Development of voyage optimization algorithms for sustainable shipping and their impact to ship design

The environmental impacts from shipping and the societal challenges of human and property losses caused by ship accidents are pressuring the shipping industry to improve its energy efficiency and enhance ship safety. Voyage optimization is such an effective measure that has been widely adopted in today’s shipping market. The voyage optimization algorithm is the dominant part of any voyage optimization methods. The main objective of this thesis is to develop sophisticated voyage optimization algorithms, explore their applications to sustainable ship operations, and study its impact on ship fatigue design.In this thesis, five commonly used voyage optimization algorithms are first implemented and compared to provide a foundation for understanding optimization algorithms. A three-dimensional Dijkstra’s algorithm is then developed with further improvement based on the comparison. It can provide globally optimal solutions and conducting multi-objective voyage optimization. An engine-power based multi-objective optimization algorithm is proposed for the aid of ship operations with power-setting in their navigation system. Furthermore, the influence of the uncertainties from voyage optimization inputs, e.g., metocean forecast, implemented ship performance models and voyage optimization algorithms, on the optimization results is investigated. Moreover, the capabilities of the proposed voyage optimization algorithms to handle other optimization objectives, i.e., less fatigue damage accumulation and lower fatigue crack propagation rate, is also investigated. Meanwhile, two statistical wave models are compared to study the variation of a ship’s encountered wave environment for ship fatigue design. The impact of voyage optimization aided operations on a ship’s encountered wave environments and fatigue life assessment is also researched in this thesis. The three-dimensional Dijkstra’s algorithm addresses the limitations of conventional voyage optimization algorithms and allows for voluntary speed variation. It has a great potential of saving fuel up to about 12% in comparison with the case study ship’s actual sailing routes. The ship engine setting-based optimization algorithm provides a scheme based on a genetic algorithm and dynamic programming concept. It has the potential to save fuel up to approximately 14.5% compared to the actual sailing routes. This study also shows that metocean uncertainties in the voyage optimization process have great influence on the optimization results, i.e., 3-10% difference in fuel consumption for the same voyage optimization method. In addition, statistical wave models have been proven to capture ship-encountered wave statistics. It is also shown that the actual wave environments encountered by ships differ significantly from the wave scatter diagram provided by class guidelines. A good voyage optimization method can help to extend a ship’s fatigue life by at least 50%.Keywords: Dijkstra’s algorithm; Energy efficiency; Expected time of arrival (ETA); Genetic algorithm; Metocean forecast; Ship safety; Sustainable shipping; Voyage optimization algorithms