Investigating Decision Support Techniques for Automating Cloud Service Selection

The compass of Cloud infrastructure services advances steadily leaving users in the agony of choice. To be able to select the best mix of service offering from an abundance of possibilities, users must consider complex dependencies and heterogeneous sets of criteria. Therefore, we present a PhD thesis proposal on investigating an intelligent decision support system for selecting Cloud based infrastructure services (e.g. storage, network, CPU).Comment: Accepted by IEEE Cloudcom 2012 - PhD consortium trac

A pricing optimization modelling for assisted decision making in telecommunication product-service bundling

Product service bundle (PSB) is a marketing strategy that offers attractive product-service packages with competitive pricing to ensure sustained profitability. However, designing suitable pricing for PSB is a non-trivial task that involves complex decision-making. This paper explores the significance of pricing optimization in the telecommunication industry, focusing on product-service bundling (PSB). It delves into the challenges associated with pricing PSB and highlights the transformative impact of big data analytics on decision-making for PSB strategies. The study presents a data-driven pricing optimization model tailored for designing appropriate pricing structures for product-service bundles within the telecommunication services domain. This model integrates customer preference knowledge and involves intricate decision-making processes. To demonstrate the feasibility of the proposed approach, the paper conducts a case study encompassing two design scenarios, wherein the results reveal that the model offers competitive pricing compared to existing telecommunication service providers, facilitating PSB design and decision-making. The findings from the case study indicate that the data-driven pricing optimization model can significantly aid PSB design and decision-making, leading to competitive pricing strategies that open avenues for new market exploration and ensure business sustainability. By considering both product and service features concurrently, the proposed model provides a pricing reference for optimal decision-making. The case study validates the feasibility and effectiveness of the approach within the telecommunication industry and highlights its potential for broader applications. The model's capability to generate competitive pricing strategies offers opportunities for new market exploration, ensuring business growth and adaptability

A scalability analysis of grid allocation mechanisms

This article examines the broker's behavior with regard to a varying number of participating nodes and shows that incremental losses have to be accepted in central resource allocation when introducing new nodes. --Grid Computing

Visualising the Global Structure of Search Landscapes: Genetic Improvement as a Case Study

The search landscape is a common metaphor to describe the structure of computational search spaces. Different landscape metrics can be computed and used to predict search difficulty. Yet, the metaphor falls short in visualisation terms because it is hard to represent complex landscapes, both in terms of size and dimensionality. This paper combines Local Optima Networks, as a compact representation of the global structure of a search space, and dimensionality reduction, using the t-Distributed Stochastic Neighbour Embedding (t-SNE) algorithm, in order to both bring the metaphor to life and convey new insight into the search process. As a case study, two benchmark programs, under a Genetic Improvement bug-fixing scenario, are analysed and visualised using the proposed method. Local Optima Networks for both iterated local search and a hybrid genetic algorithm, across different neighbourhoods, are compared, highlighting the differences in how the landscape is explored

Fast Many-to-Many Routing for Dynamic Taxi Sharing with Meeting Points

We introduce an improved algorithm for the dynamic taxi sharing problem, i.e. a dispatcher that schedules a fleet of shared taxis as it is used by services like UberXShare and Lyft Shared. We speed up the basic online algorithm that looks for all possible insertions of a new customer into a set of existing routes, we generalize the objective function, and we efficiently support a large number of possible pick-up and drop-off locations. This lays an algorithmic foundation for taxi sharing systems with higher vehicle occupancy - enabling greatly reduced cost and ecological impact at comparable service quality. We find that our algorithm computes assignments between vehicles and riders several times faster than a previous state-of-the-art approach. Further, we observe that allowing meeting points for vehicles and riders can reduce the operating cost of vehicle fleets by up to 15% while also reducing rider wait and trip times.Comment: 26 pages, 7 figures, 4 tables. To be presented at ALENEX'24. arXiv admin note: substantial text overlap with arXiv:2305.0541