Bird watching is one of many recreational activities popular in ecotourism. Its popularity, therefore, prompts the need for studies on energy conservation. One such environmentally friendly approach toward minimizing bird watching’s ecological impact is ensuring a reduced carbon footprint by...

This paper focuses on the flow shop sequence dependent group scheduling (FSDGS) problem with minimisation of total completion time as the criterion (Fm|f<SUB align="right"><SMALL>mls</SMALL></SUB>, prmu, S<SUB align="right"><SMALL>plk</SMALL></SUB>|ΣC<SUB align="right"><SMALL>J</SMALL></SUB>). The research problem is formulated in form of two different mixed integer linear programming (MILP) models. Comparing...</small></sub></small></sub></small></sub>

The fuzzy C-means (FCM) algorithm is a commonly used fuzzy clustering method which conducts data clustering by randomly selecting initial centroids. With larger data size or attribute dimensions, clustering results may be affected and more repetitive computations are required. To compensate the...

Well established conventional algorithms are available for solving the optimum power flow (OPF) problem. But the recent trend is to use the tools such as genetic algorithms (GAs) evolutionary programming technique, etc., because of some of their superior qualities. Simulated annealing (SA) is...

Hybridisation of algorithms to develop efficient solution methods for solving various NP-hard problems has been a practice for the last few years. It can be seen that researchers have tried different permutations and combinations of various exact, heuristic and metaheuristic algorithms to...

The job shop problem is among the class of non-deterministic polynomial time hard combinatorial problems. This research article addresses the problem of static job shop scheduling on the job-based representation and the rule-based representations. The popular search techniques, such as the...

This paper formulates the 3D containership loading planning problem (3D CLPP) and also proposes a new and compact representation to efficiently solve it. The key objective of stowage planning is to minimise the number of container movements and also the ship's instability. The binary formulation...

We develop a hybrid algorithm using Genetic Algorithms (GA) and Simulated Annealing (SA) to solve multi-objective step function maximization problems. We then apply the algorithm to a specific economic problem which is taken out of the corporate governance literature.

This paper presents a new approach to solve the short-term unit commitment problem using genetic algorithm-based simulated annealing method for utility system. The objective of this paper is to find the generation scheduling such that the total operating cost can be minimised when subjected to a...

Generalised assignment problem (GAP) is a well-known non-deterministic polynomial (NP) hard combinatorial optimisation problem to find the minimum cost during assignment of jobs to agents so that each job is assigned exactly once and agents are not overloaded. In this research, we look at the...