Skip navigation
Please use this identifier to cite or link to this item: http://repository.iitr.ac.in/handle/123456789/18990
Title: Multi task selection including part mix, tool allocation and process plans in CNC machining centers using new binary PSO
Authors: Deep, K.
Chauhan P.
Pant M.
Published in: Proceedings of 2012 IEEE Congress on Evolutionary Computation, CEC 2012
Abstract: This paper proposes a new binary PSO for solving multi-task selection problem concerning various issues such as Part mix, Tool allocation and Process plans in CNC machining centers. The mathematical formulation of considered selection problem emerges as highly constrained and 0-1, combinatorial optimization, which further belongs to the category of NP-hard problems. The proposed Binary PSO variant embeds a new sigmoid function namely "Gompertz function" as a binary number generator with an additional benefit of controlling its parameters so as to induce the combined effect of sigmoid as well as linear function. The corresponding variant is termed as "Gompertz Binary Particle Swarm Optimization (GBPSO)". Before applying GBPSO for considered selection problem, the efficacy of proposed GBPSO is tested on a set of 0-1 Multi-dimensional knapsack problems and results are compared with standard binary PSO. Thereafter two test cases for considered optimal selection problem are solved and analyzed using GBPSO. The simulation results manifest the superiority of proposed variant over standard BPSO for solving benchmark problems and practical application as well. © 2012 IEEE.
Citation: Proceedings of 2012 IEEE Congress on Evolutionary Computation, CEC 2012, (2012). Brisbane, QLD
URI: https://doi.org/10.1109/CEC.2012.6256439
http://repository.iitr.ac.in/handle/123456789/18990
Issue Date: 2012
Keywords: combinatorial optimization
gompertz binary PSO
process planning
Bench-mark problems
Binary number
Binary particle swarm optimization
Binary PSO
CNC machining centers
Combined effect
Gompertz function
Linear functions
Mathematical formulation
Multidimensional knapsack problems
Optimal selection
Process plan
Selection problems
Sigmoid function
Task selection
Test case
Tool allocation
Benchmarking
Combinatorial optimization
Computational complexity
Machining centers
Number theory
Process planning
Problem solving
ISBN: 9.78E+12
Author Scopus IDs: 8561208900
35752990300
23467551900
Author Affiliations: Deep, K., Dept. of Mathematics, Indian Institute of Technology Roorkee, Roorkee-247667, Uttarakhand, India
Chauhan, P., Dept. of Mathematics, Indian Institute of Technology Roorkee, Roorkee-247667, Uttarakhand, India
Pant, M., Dept. of Paper and Pulp Technology, Indian Institute of Technology Roorkee, Saharanpur-247001, Uttarakhand, India
Corresponding Author: Deep, K.; Dept. of Mathematics, Indian Institute of Technology Roorkee, Roorkee-247667, Uttarakhand, India; email: kusumfma@iitr.ernet.in
Appears in Collections:Conference Publications [MA]

Files in This Item:
There are no files associated with this item.
Show full item record


Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.