Find multi-objective paths in stochastic networks via chaotic immune PSO
Y Zhang, Y Jun, G Wei, L Wu - Expert Systems with Applications, 2010 - Elsevier
Path finding is a fundamental research topic in transportation planning, intelligent
transportation system, routine selection, etc. It is usually simplified as the shortest path (SP) …
transportation system, routine selection, etc. It is usually simplified as the shortest path (SP) …
A new artificial immune system algorithm for multiobjective fuzzy flow shop problems
In this paper a new artificial immune system (AIS) algorithm is proposed to solve multi
objective fuzzy flow shop scheduling problems. A new mutation operator is also described …
objective fuzzy flow shop scheduling problems. A new mutation operator is also described …
Distributed no-wait flow shop with fuzzy environment
In the no-wait flow shop scheduling problem, n-job should be proceeded on m-machine with
the same order and do not permit the jobs to wait during the scheduling periods. Also, at the …
the same order and do not permit the jobs to wait during the scheduling periods. Also, at the …
Basic concept of implementing artificial bee colony (ABC) system in flow shop scheduling
HY Chow, S Hasan, SA Bareduan - Applied Mechanics and …, 2013 - Trans Tech Publ
Flow shop scheduling is a common operational problem in a production system. Effective
flow shop scheduling can help the company to improve the management system, hence …
flow shop scheduling can help the company to improve the management system, hence …
[PDF][PDF] A multicriteria permutation flowshop scheduling problem with setup times
M Saravanan, SJD Vijayakumar, R Srinivasan - Int. J. of Eng. and Tech, 2014 - Citeseer
The permutation flow shop scheduling problem has been completely concentrated on in late
decades, both from single objective and additionally from multi-objective points of view. To …
decades, both from single objective and additionally from multi-objective points of view. To …
[PDF][PDF] An Artificial Immune System Approach for Flexible Job Shop Scheduling Problem
A Sipahioglu, A Aladag - … of the 2012 International Conference on …, 2012 - ieomsociety.org
Abstract Job Shop Scheduling Problem (JSP) is one of the hardest NP-hard class
combinatorial optimization problems. Flexible Job Scheduling Problem (FJSP) occurs with …
combinatorial optimization problems. Flexible Job Scheduling Problem (FJSP) occurs with …
An Optimisation Algorithm Inspired by Dendritic Cells
NMY Lee, HYK Lau - Research and Development in Intelligent Systems …, 2015 - Springer
Abstract Clonal Selection Algorithm (CSA) has been widely adopted for solving different
types of optimization problems in the field of Artificial Immune Systems (AIS). Apart from the …
types of optimization problems in the field of Artificial Immune Systems (AIS). Apart from the …