{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T15:43:55Z","timestamp":1781106235839,"version":"3.54.1"},"reference-count":50,"publisher":"IGI Global Scientific Publishing","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,4,1]]},"abstract":"<p>Trim loss minimization is the most common problem that arises during the cutting process, when products with variable width or length are to be produced in bulk to satisfy customer demands from limited available\/stocked materials. The aim is to minimize inevitable waste material. Under various environmental and physical constraints, the trim loss problem is highly constrained, non convex, nonlinear, and with integer restriction on all variables. Due to the highly complex nature of trim loss problem, it is not easy for manufacturers to select an appropriate method that provides a global optimal solution, satisfying all restrictions. This paper proposes a discrete variant of PSO, which embeds a mutation operator, namely power mutation during the position update stage. The proposed variant is named as Hybrid Discrete PSO (HDPSO). Binary variables in HDPSO are generated using sigmoid function with its domain derived from position update equation. Four examples with different levels of complexity are solved and results are compared with two recently developed GA and PSO variants. The computational studies indicate the competitiveness of proposed variant over other considered methods.<\/p>","DOI":"10.4018\/jaec.2012040102","type":"journal-article","created":{"date-parts":[[2012,5,16]],"date-time":"2012-05-16T10:07:27Z","timestamp":1337162847000},"page":"19-41","source":"Crossref","is-referenced-by-count":3,"title":["New Hybrid Discrete PSO for Solving Non Convex Trim Loss Problem"],"prefix":"10.4018","volume":"3","author":[{"given":"Kusum","family":"Deep","sequence":"first","affiliation":[{"name":"Indian Institute of Technology Roorkee, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pinkey","family":"Chauhan","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology Roorkee, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Millie","family":"Pant","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology Roorkee, India"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"jaec.2012040102-0","doi-asserted-by":"publisher","DOI":"10.1002\/aic.690460908"},{"key":"jaec.2012040102-1","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-008-0454-7"},{"key":"jaec.2012040102-2","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(00)00095-2"},{"key":"jaec.2012040102-3","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601829"},{"key":"jaec.2012040102-4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2007.10.044"},{"key":"jaec.2012040102-5","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.08.036"},{"key":"jaec.2012040102-6","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2008.04.042"},{"key":"jaec.2012040102-7","doi-asserted-by":"publisher","DOI":"10.1016\/j.jksus.2010.06.009"},{"key":"jaec.2012040102-8","doi-asserted-by":"publisher","DOI":"10.1111\/j.1475-3995.1998.tb00100.x"},{"key":"jaec.2012040102-9","doi-asserted-by":"crossref","unstructured":"Chauhan, P., Deep, K., & Pant, M. (2010). Power mutation embedded modified PSO for global optimization problems. In B. K. Panigrahi, S. Das, P. N. Suganthan, & S. S. Dash (Eds.), Proceedings of the First International Conference on Swarm, Evolutionary, and Memetic Computing (LNCS 6466, pp. 139-146).","DOI":"10.1007\/978-3-642-17563-3_17"},{"key":"jaec.2012040102-10","doi-asserted-by":"publisher","DOI":"10.1631\/jzus.2006.A0607"},{"key":"jaec.2012040102-11","doi-asserted-by":"publisher","DOI":"10.1016\/0925-5273(94)00045-X"},{"key":"jaec.2012040102-12","doi-asserted-by":"crossref","unstructured":"Correa, E. S., Freitas, A. A., & Johnson, C. G. (2006, July). A new discrete particle swarm algorithm applied to attribute selection in a bioinformatics data set. In Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computing, Seattle, WA (pp. 35-42).","DOI":"10.1145\/1143997.1144003"},{"key":"jaec.2012040102-13","doi-asserted-by":"crossref","unstructured":"Deep, K., Chauhan, P., & Bansal, J. (2009). Solving nonconvex trim loss problem using an efficient hybrid particle swarm optimization. Nature & Biologically Inspired Computing, 1608-1611.","DOI":"10.1109\/NABIC.2009.5393658"},{"key":"jaec.2012040102-14","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2009.02.044"},{"key":"jaec.2012040102-15","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2007.03.046"},{"key":"jaec.2012040102-16","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(90)90350-K"},{"key":"jaec.2012040102-17","doi-asserted-by":"publisher","DOI":"10.1287\/opre.9.6.849"},{"key":"jaec.2012040102-18","doi-asserted-by":"publisher","DOI":"10.1287\/opre.23.3.483"},{"key":"jaec.2012040102-19","doi-asserted-by":"publisher","DOI":"10.1287\/opre.28.4.1001"},{"key":"jaec.2012040102-20","doi-asserted-by":"publisher","DOI":"10.1016\/0098-1354(96)00031-2"},{"key":"jaec.2012040102-21","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(97)00066-0"},{"key":"jaec.2012040102-22","doi-asserted-by":"publisher","DOI":"10.1016\/S0098-1354(99)00310-5"},{"key":"jaec.2012040102-23","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(80)90068-5"},{"key":"jaec.2012040102-24","doi-asserted-by":"publisher","DOI":"10.1016\/j.epsr.2006.02.016"},{"key":"jaec.2012040102-25","doi-asserted-by":"publisher","DOI":"10.1016\/j.micpro.2010.11.001"},{"key":"jaec.2012040102-26","doi-asserted-by":"crossref","unstructured":"Kennedy, J., & Eberhart, R. (1995). Particle swarm optimization. In Proceedings of the IEEE International Conference on Neural Networks, Perth, Australia (pp. 1942-1948).","DOI":"10.1109\/ICNN.1995.488968"},{"key":"jaec.2012040102-27","doi-asserted-by":"crossref","unstructured":"Kennedy, J., & Eberhart, R. (1997). A discrete binary version of the particle swarm algorithm. In Proceedings of the IEEE International Conference on systems, Man, and Cybernetics (pp. 4104-4108).","DOI":"10.1109\/ICSMC.1997.637339"},{"key":"jaec.2012040102-28","doi-asserted-by":"publisher","DOI":"10.1287\/opre.46.5.690"},{"key":"jaec.2012040102-29","doi-asserted-by":"publisher","DOI":"10.1016\/S0360-8352(96)00205-7"},{"key":"jaec.2012040102-30","doi-asserted-by":"publisher","DOI":"10.1016\/j.pnsc.2008.03.018"},{"key":"jaec.2012040102-31","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.11.017"},{"key":"jaec.2012040102-32","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2009.08.005"},{"key":"jaec.2012040102-33","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(98)00035-5"},{"key":"jaec.2012040102-34","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2006.12.030"},{"key":"jaec.2012040102-35","unstructured":"Pang, W., Wang, K. P., Zhou, C. G., & Dong, L. J. (2004). Fuzzy discrete particle swarm optimization for solving traveling salesman problem. In Proceedings of the 4th International Conference on Computer and Information Technology."},{"key":"jaec.2012040102-36","doi-asserted-by":"publisher","DOI":"10.1080\/00207548708919848"},{"key":"jaec.2012040102-37","doi-asserted-by":"crossref","unstructured":"Rameshkumar, K., Suresh, R. K., & Mohanasundaram, K. M. (2005). Discrete particle swarm optimization (DPSO) algorithm for permutation flowshop scheduling to minimize makespan. In L. Wang, K. Chen, & Y. S. Ong (Eds.), Proceedings of the First International Conference on Advances in Natural Computation (LNCS 3612, pp. 572-581).","DOI":"10.1007\/11539902_70"},{"key":"jaec.2012040102-38","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601242"},{"key":"jaec.2012040102-39","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(00)00102-7"},{"key":"jaec.2012040102-40","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.27.8.946"},{"key":"jaec.2012040102-41","doi-asserted-by":"crossref","unstructured":"Shen, X., Li, Y., Dai, Z., & Zheng, B. (2007). General particle swarm optimization based on simulated annealing for multi-specification one-dimensional cutting stock problem. In Proceedings of the International Conference on Computational Intelligence and Security (pp. 461-464).","DOI":"10.1109\/ICCIAS.2006.294177"},{"issue":"7","key":"jaec.2012040102-42","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1057\/jors.1992.101","article-title":"Cutting and packing problems: a categorized application oriented research bibliography.","volume":"43","author":"P. E.Sweeny","year":"1992","journal-title":"The Journal of the Operational Research Society"},{"key":"jaec.2012040102-43","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2007.08.030"},{"key":"jaec.2012040102-44","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2010.02.032"},{"key":"jaec.2012040102-45","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018346107246"},{"key":"jaec.2012040102-46","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(98)00244-6"},{"key":"jaec.2012040102-47","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(90)90353-D"},{"key":"jaec.2012040102-48","doi-asserted-by":"publisher","DOI":"10.1016\/j.jvcir.2003.12.001"},{"key":"jaec.2012040102-49","unstructured":"Zhong, W., & Zhang, J. (2007). A novel discrete particle swarm optimization to solve travelling salesman problem. In Proceedings of the IEEE Congress on Evolutionary Computation, Singapore (pp. 3283-3287)."}],"container-title":["International Journal of Applied Evolutionary Computation"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=66866","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T11:30:37Z","timestamp":1654083037000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jaec.2012040102"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2012,4,1]]},"references-count":50,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,4]]}},"URL":"https:\/\/doi.org\/10.4018\/jaec.2012040102","relation":{},"ISSN":["1942-3594","1942-3608"],"issn-type":[{"value":"1942-3594","type":"print"},{"value":"1942-3608","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4,1]]}}}