Search results

Generator maintenance scheduling (GMS) is an essential task for electric power utilities as the periodical maintenance activity enhances the lifetime and also ensures the reliable and continuous operation of generating units. Though numerous meta-heuristic algorithms have been reported for the GMS solution, enhancing the existing techniques or developing new optimization procedure is still an interesting research task. The meta-heuristic algorithms are population based and the selection of their algorithmic parameters influences the quality of the solution. This paper aims to propose statistical tests guided meta-heuristic algorithm for solving the GMS problems.

The intricacy characteristics of the GMS problem in power systems necessitate an efficient and robust optimization tool. Though several meta-heuristic algorithms have been applied to solve the chosen power system operational problem, tuning of their control parameters is a protracting process. To prevail over the previously mentioned drawback, the modern meta-heuristic algorithm, namely, ant lion optimizer (ALO), is chosen as the optimization tool for solving the GMS problem.

The meta-heuristic algorithms are population based and require proper selection of algorithmic parameters. In this work, the ANOVA (analysis of variance) tool is proposed for selecting the most feasible decisive parameters in algorithm domain, and the statistical tests-based validation of solution quality is described. The parametric and non-parametric statistical tests are also performed to validate the selection of ALO against the various competing algorithms. The numerical and statistical results confirm that ALO is a promising tool for solving the GMS problems.

As a first attempt, ALO is applied to solve the GMS problem. Moreover, the ANOVA-based parameter selection is proposed and the statistical tests such as Wilcoxon signed rank and one-way ANOVA are conducted to validate the applicability of the intended optimization tool. The contribution of the paper can be summarized in two folds: the ANOVA-based ALO for GMS applications and statistical tests-based performance evaluation of intended algorithm.

This study, a conceptual paper, analyses the growth of curation in tourism and hospitality and the curator role in selecting and framing products and experiences. It considers the growth of expert, algorithmic, social and co-creative curation modes and their effects.

Narrative and integrative reviews of literature on curation and tourism and hospitality are used to develop a typology of curation and identify different curation modes.

Curational techniques are increasingly used to organise experience supply and distribution in mainstream fields, including media, retailing and fashion. In tourism and hospitality, curated tourism, curated hospitality brands and food offerings and place curation by destination marketing organisations are growing. Curation is undertaken by experts, algorithms and social groups and involves many of destination-related actors, producing a trend towards “hybrid curation” of places.

Research is needed on different forms of curation, their differential effects and the power roles of different curational modes.

Curation is a widespread intermediary function in tourism and hospitality, supporting better consumer choice. New curators influence experience supply and the distribution of consumer attention, shaping markets and co-creative activities. Increased curatorial activity should stimulate aesthetic and stylistic innovation and provide the basis for storytelling and narrative in tourism and hospitality.

This is the first study of curational strategies in tourism and hospitality, providing a definition and typology of curation, and linking micro and macro levels of analysis. It suggests the growth of choice-based logic alongside service-dominant logic in tourism and hospitality.

The purpose of this paper is twofold. First, the authors provide a survey of operations management (OM) research applications of traditional hierarchical and nonhierarchical clustering methods with respect to key decisions that are central to a valid analysis. Second, the authors offer recommendations for practice with respect to these decisions.

A coding study was conducted for 97 cluster analyses reported in six OM journals during the period spanning 1994-2015. Data were collected with respect to: variable selection, variable standardization, method, selection of the number of clusters, consistency/stability of the clustering solution, and profiling of the clusters based on exogenous variables. Recommended practices for validation of clustering solutions are provided within the context of this framework.

There is considerable variability across clustering applications with respect to the components of validation, as well as a mix of productive and undesirable practices. This justifies the importance of the authors’ provision of a schema for conducting a cluster analysis.

Certain aspects of the coding study required some degree of subjectivity with respect to interpretation or classification. However, in light of the sheer magnitude of the coding study (97 articles), the authors are confident that an accurate picture of empirical OM clustering applications has been presented.

The paper provides a critique and synthesis of the practice of cluster analysis in OM research. The coding study provides a thorough foundation for how the key decisions of a cluster analysis have been previously handled in the literature. Both researchers and practitioners are provided with guidelines for performing a valid cluster analysis.

To the best of the authors’ knowledge, no study of this type has been reported in the OM literature. The authors’ recommendations for cluster validation draw from recent studies in other disciplines that are apt to be unfamiliar to many OM researchers.

The purposes of this paper are to implement a spaced repetition algorithm into a learning game, analyze the pros and cons of this implementation and make different considerations about designing the game to make the algorithm work in an optimal way. While games offer a promising way of engaging and motivating learners to deal with a certain topic, repetitions foster immersing this topic sustainably. Those repetitions should be done at sophistically determined intervals to maximize learning outcomes.

The work is implemented as two prototype learning games which use the SM2 algorithm for content selection and repetition scheduling. Based on our findings about user behavior, this study developed an auxiliary algorithm to aid SM2 in the special setting of a learning game. To design the game in a way which supports the spaced repetition approach, this study have analyzed best-practices in this domain and made some considerations for adapting them accordingly.

An auxiliary algorithm is needed to support the usage of common spaced repetition algorithms in mobile learning games. Best-practices in designing those games need to be to suit the spaced repetitions approach.

This paper shows the benefits of combining learning games with the spaced repetition approach and points out specifics in designing spaced repetition based mobile learning games.

While spaced repetitions are already commonly used with other types of learning, it has yet to be implemented in learning games. This study’s approach shows ways to do this and which considerations have to be made.

The ever-stringent environmental regulations force power producers to produce electricity at the cheapest price and with minimum pollutant emission levels. The electrical power generation from fossil fuel releases several contaminants into the air, and this becomes excrescent if the generating unit is fed by multiple fuel sources (MFSs). Inclusion of this issue in operational tasks is a welcome perspective. This paper aims to develop a multi-objective model comprising total fuel cost and pollutant emission.

The cost-effective and environmentally responsive power system operations in the presence of MFSs can be recognised as a multi-objective constrained optimisation problem with conflicting operational objectives. The complexity of the problem requires a suitable optimisation tool. Ant lion algorithm (ALA), the most recent nature-inspired algorithm, was used as the main optimisation tool because of its salient characteristics. The fuzzy decision-making mechanism has been integrated to determine the best compromised solution in the multi-objective framework.

This paper is the first to propose a more precise and practical operational model for studying a multi-fuel power dispatch scenario considering valve-point effects and CO₂ emission. The modern meta-heuristic algorithm ALA is applied for the first time to address the economic operation of thermal power systems with multiple fuel options.

Power companies aim to make profit by abiding by the norms of the regulatory board. To achieve economic benefits, the power system must be analysed using an accurate operational model. The proposed model integrates total fuel cost, valve-point loadings and CO₂ emission, which are prevailing power system operational objectives. The economic advantages of the operational model can be observed through economic deviation indices, and the performed analysis validates that the developed model corresponds to the actual power operation.

The realistic operational model is proposed by considering total fuel and pollutant emission, and the ALA is applied for the first time to address the proposed multi-objective problem. To validate the effectiveness of ALA, it is implemented in standard test systems with varying generating units (10-100) and the IEEE 30 bus system, and various kinds of power system operations are performed. Moreover, the comparison and performance analysis confirm that the current proposal is found enhanced in terms of solution quality.

The purpose of this paper is to contribute to a better understanding of governance choice in the area of algorithmic selection. Algorithms on the Internet shape our daily lives and realities. They select information, automatically assign relevance to them and keep people from drowning in an information flood. The benefits of algorithms are accompanied by risks and governance challenges.

Based on empirical case analyses and a review of the literature, the paper chooses a risk-based governance approach. It identifies and categorizes applications of algorithmic selection and attendant risks. Then, it explores the range of institutional governance options and discusses applied and proposed governance measures for algorithmic selection and the limitations of governance options.

Analyses reveal that there are no one-size-fits-all solutions for the governance of algorithms. Attention has to shift to multi-dimensional solutions and combinations of governance measures that mutually enable and complement each other. Limited knowledge about the developments of markets, risks and the effects of governance interventions hampers the choice of an adequate governance mix. Uncertainties call for risk and technology assessment to strengthen the foundations for evidence-based governance.

The paper furthers the understanding of governance choice in the area of algorithmic selection with a structured synopsis on rationales, options and limitations for the governance of algorithms. It provides a functional typology of applications of algorithmic selection, a comprehensive overview of the risks of algorithmic selection and a systematic discussion of governance options and its limitations.

Research shows that postsecondary students are largely unaware of the impact of algorithms on their everyday lives. Also, most noncomputer science students are not being taught about algorithms as part of the regular curriculum. This exploratory, qualitative study aims to explore subject-matter experts’ insights and perceptions of the knowledge components, coping behaviors and pedagogical considerations to aid faculty in teaching algorithmic literacy to postsecondary students.

Eleven semistructured interviews and one focus group were conducted with scholars and teachers of critical algorithm studies and related fields. A content analysis was manually performed on the transcripts using a mixture of deductive and inductive coding. Data analysis was aided by the coding software program Dedoose (2021) to determine frequency totals for occurrences of a code across all participants along with how many times specific participants mentioned a code. Then, findings were organized around the three themes of knowledge components, coping behaviors and pedagogy.

The findings suggested a set of 10 knowledge components that would contribute to students’ algorithmic literacy along with seven behaviors that students could use to help them better cope with algorithmic systems. A set of five teaching strategies also surfaced to help improve students’ algorithmic literacy.

This study contributes to improved pedagogy surrounding algorithmic literacy and validates existing multi-faceted conceptualizations and measurements of algorithmic literacy.

Marine transportation has been faced with an increasing demand for containerized cargo during the past decade. Marine container terminals (MCTs), as the facilities for connecting seaborne and inland transportation, are expected to handle the increasing amount of containers, delivered by vessels. Berth scheduling plays an important role for the total throughput of MCTs as well as the overall effectiveness of the MCT operations. This study aims to propose a novel island-based metaheuristic algorithm to solve the berth scheduling problem and minimize the total cost of serving the arriving vessels at the MCT.

A universal island-based metaheuristic algorithm (UIMA) was proposed in this study, aiming to solve the spatially constrained berth scheduling problem. The UIMA population was divided into four sub-populations (i.e. islands). Unlike the canonical island-based algorithms that execute the same metaheuristic on each island, four different population-based metaheuristics are adopted within the developed algorithm to search the islands, including the following: evolutionary algorithm (EA), particle swarm optimization (PSO), estimation of distribution algorithm (EDA) and differential evolution (DE). The adopted population-based metaheuristic algorithms rely on different operators, which facilitate the search process for superior solutions on the UIMA islands.

The conducted numerical experiments demonstrated that the developed UIMA algorithm returned near-optimal solutions for the small-size problem instances. As for the large-size problem instances, UIMA was found to be superior to the EA, PSO, EDA and DE algorithms, which were executed in isolation, in terms of the obtained objective function values at termination. Furthermore, the developed UIMA algorithm outperformed various single-solution-based metaheuristic algorithms (including variable neighborhood search, tabu search and simulated annealing) in terms of the solution quality. The maximum UIMA computational time did not exceed 306 s.

Some of the previous berth scheduling studies modeled uncertain vessel arrival times and/or handling times, while this study assumed the vessel arrival and handling times to be deterministic.

The developed UIMA algorithm can be used by the MCT operators as an efficient decision support tool and assist with a cost-effective design of berth schedules within an acceptable computational time.

A novel island-based metaheuristic algorithm is designed to solve the spatially constrained berth scheduling problem. The proposed island-based algorithm adopts several types of metaheuristic algorithms to cover different areas of the search space. The considered metaheuristic algorithms rely on different operators. Such feature is expected to facilitate the search process for superior solutions.