Results 161 to 170 of about 12,918 (212)
Some of the next articles are maybe not open access.
A Discrete Artificial Bee Colony Algorithm for Permutation Flow Shop Scheduling
2016 9th International Symposium on Computational Intelligence and Design (ISCID), 2016A discrete artificial bee colony algorithm (DABC) is proposed for solving the permutation flow shop scheduling problem (PFSSP) with minimum makespan criterion. Firstly, the NEH heuristic was combined the random initialization to the population for quality and diversity.
Ying Liu +3 more
openaire +1 more source
A discrete artificial bee colony algorithm for the multi-objective redistricting problem
Proceedings of the 14th annual conference companion on Genetic and evolutionary computation, 2012In this paper, the performance of two classical algorithms (simulated annealing and a discrete artificial bee colony) are compared on the redistricting problem, using a real example in Mexico and highlighting the superiority of the latter.
Eric Rincon García +5 more
openaire +1 more source
A discrete artificial bee colony algorithm for resource-constrained project scheduling problem
2013 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO), 2013In this paper, we present a new meta-heuristic based on the performance of the artificial bee colony (ABC) for solving the resource-constrained project scheduling problem (RCPSP). The proposed algorithm iteratively solves the RCPSP by utilizing different types of honey bees on three main steps: initialization, update, and termination.
Nouha Nouri +3 more
openaire +1 more source
BABC: A Binary Version of Artificial Bee Colony Algorithm for Discrete Optimization
International Journal of Advancements in Computing Technology, 2012The Artificial Bee Colony (ABC) algorithm recently gained high popularity by providing a robust and efficient approach for solving continuous optimization problems. In order to apply ABC in discrete landscape, a binary version of artificial bee colony (BABC) algorithm is proposed in this manuscript.
Liu Wei -, Chen Hanning -
openaire +1 more source
Cybersecurity and Cyberforensics Conference, 2020
The distributed permutation flowshop scheduling problem with preventive maintenance operator (PM/DPFSP) is closely related to modem industry. This paper presents an improved discrete artificial bee colony (IDABC) algorithm for solving this problem.
Jia-Yang Mao +5 more
semanticscholar +1 more source
The distributed permutation flowshop scheduling problem with preventive maintenance operator (PM/DPFSP) is closely related to modem industry. This paper presents an improved discrete artificial bee colony (IDABC) algorithm for solving this problem.
Jia-Yang Mao +5 more
semanticscholar +1 more source
A hybrid discrete artificial bee colony algorithm for permutation flowshop scheduling problem
Applied Soft Computing, 2013To minimize the makespan in permutation flowshop scheduling problems, a hybrid discrete artificial bee colony (HDABC) algorithm is presented. In the HDABC, each solution to the problem is called a food source and represented by a discrete job permutation.
Yan-Feng Liu, San-Yang Liu
openaire +1 more source
Engineering Applications of Artificial Intelligence, 2017
Abstract Disassembly sequencing has significant effects on the performance of remanufacturing and recycling of used or discarded products. Studies on disassembly sequence optimization have largely focused on sequential disassembly. However, for large or complex products sequential disassembly takes long time to complete and is rather inefficient ...
Yaping Ren +4 more
openaire +1 more source
Abstract Disassembly sequencing has significant effects on the performance of remanufacturing and recycling of used or discarded products. Studies on disassembly sequence optimization have largely focused on sequential disassembly. However, for large or complex products sequential disassembly takes long time to complete and is rather inefficient ...
Yaping Ren +4 more
openaire +1 more source
An efficient discrete artificial bee colony algorithm for total flowtime lot-streaming flowshop
2012 9th International Conference on Fuzzy Systems and Knowledge Discovery, 2012The lot-streaming flow shop scheduling problem has important applications in modern industry. This paper considers an n-job m-machine lot-streaming flow shop scheduling problem where the objective is to minimize the total flowtime. To solve this problem, a new discrete artificial bee colony (DABC) algorithm is proposed.
Hong-yan Sang, Jun-hua Duan
openaire +1 more source
A Hybrid Discrete Artificial Bee Colony Algorithm for the Multicast Routing Problem
2016In this paper, a new algorithm is proposed for the solution of the Multicast Routing Problem. The algorithm is based on the Artificial Bee Colony approach hybridized with Variable Neighborhood Search. The quality of the algorithm is evaluated with experiments conducted on suitably modified benchmark instances of the Euclidean Traveling Salesman Problem
Yannis Marinakis +2 more
openaire +1 more source
An Improved Discrete Artificial Bee Colony Algorithm for Hybrid Flow Shop Problems
2013Being a typical NP-hard combinatorial optimization problem, the hybrid flow shop (HFS) problem widely exists in manufacturing systems. In this paper, we firstly establish the model of the HFS problem by employing the vector representation. Then an improved discrete artificial bee colony (IDABC) algorithm is proposed for this problem to minimize the ...
Zhe Cui, Xingsheng Gu
openaire +1 more source