A tool for solving stochastic dynamic facility layout problems with stochastic demand using either a Genetic Algorithm or modified Backtracking Search Algorithm
Facility layout problems (FLP) involve determining the optimal placement of machines within
a fixed space. An effective layout minimises costs. The total material travel distance is a key …
a fixed space. An effective layout minimises costs. The total material travel distance is a key …
An ant colony based timetabling tool
The timetabling of lecturers, seminars, practical sessions and examinations is a core
business process for academic institutions. A feasible timetable must satisfy hard …
business process for academic institutions. A feasible timetable must satisfy hard …
Particle swarm optimisation variants and its hybridisation ratios for generating cost-effective educational course timetables
Due to the COVID-19 pandemic, many universities across the globe are unexpectedly
accelerated to face another major financial crisis. An effective university course timetabling …
accelerated to face another major financial crisis. An effective university course timetabling …
Development of a stochastic optimisation tool for solving the multiple container packing problems
Marine logistics has become increasingly important as the amount of global trade has
increased. Products are usually packed in various sizes of boxes, which are then arranged …
increased. Products are usually packed in various sizes of boxes, which are then arranged …
[PDF][PDF] Artificial immune systems: A bibliography
Important Note: The field of Artificial Immune Systems (AIS) is becoming more popular and
AIS-based works spanning from theoretical modeling and simulation to wide variety of …
AIS-based works spanning from theoretical modeling and simulation to wide variety of …
Best-worst ant colony system parameter investigation by using experimental design and analysis for course timetabling problem
T Lutuksin, P Pongcharoen - 2010 Second International …, 2010 - ieeexplore.ieee.org
Course timetabling usually arises every academic year and is solved by academic staff
with/without course timetabling tool. The desirable timetable must be satisfied by hard …
with/without course timetabling tool. The desirable timetable must be satisfied by hard …
Bat algorithm, genetic algorithm and shuffled frog leaping algorithm for designing machine layout
K Dapa, P Loreungthup, S Vitayasak… - Multi-disciplinary Trends …, 2013 - Springer
Arranging non-identical machines into a limited area of manufacturing shop floor is an
essential part of plant design. Material handling distance is one of the key performance …
essential part of plant design. Material handling distance is one of the key performance …
Modifying regeneration mutation and hybridising clonal selection for evolutionary algorithms based timetabling tool
T Thepphakorn, P Pongcharoen… - … Problems in Engineering, 2015 - Wiley Online Library
This paper outlines the development of a new evolutionary algorithms based timetabling
(EAT) tool for solving course scheduling problems that include a genetic algorithm (GA) and …
(EAT) tool for solving course scheduling problems that include a genetic algorithm (GA) and …
Academic operating costs optimisation using hybrid MCPSO based course timetabling tool
T Thepphakorn, S Sooncharoen… - … Learning. Education in a …, 2020 - Springer
The course timetabling problem (CTP) is very important for educational institutes. An
effective timetable has directly affect to the utilisation of resources and its operating costs …
effective timetable has directly affect to the utilisation of resources and its operating costs …
Static and dynamic parameter settings of accelerated particle swarm optimisation for solving course scheduling problem
T Thepphakorn, S Sooncharoen… - … Design, Visualization, and …, 2020 - Springer
The university course timetabling problem (UCTP) is one of the most challenging scheduling
problems and also classified to be a Non-deterministic Polynomial (NP)-hard problem. An …
problems and also classified to be a Non-deterministic Polynomial (NP)-hard problem. An …