{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T19:55:04Z","timestamp":1762026904345,"version":"build-2065373602"},"reference-count":22,"publisher":"World Scientific Pub Co Pte Ltd","issue":"01","funder":[{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["MOST 108-2221-E-366-003"],"award-info":[{"award-number":["MOST 108-2221-E-366-003"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Model. Simul. Sci. Comput."],"published-print":{"date-parts":[[2021,2]]},"abstract":"<jats:p> Engineering optimization problems can be always classified into two main categories including the linear programming (LP) and nonlinear programming (NLP) problems. Each programming problem further involves the unconstrained conditions and constrained conditions for design variables of the optimized system. This paper will focus on the issue about the design problem of NLP with the constrained conditions. The employed method for such NLP problems is a variant of particle swarm optimization (PSO), named improved particle swarm optimization (IPSO). The developed IPSO is to modify the velocity updating formula of the algorithm to enhance the search ability for given optimization problems. In this work, many different kinds of physical engineering optimization problems are examined and solved via the proposed IPSO algorithm. Simulation results compared with various optimization methods reported in the literature will show the effectiveness and feasibility for solving NLP problems with the constrained conditions. <\/jats:p>","DOI":"10.1142\/s179396232150001x","type":"journal-article","created":{"date-parts":[[2020,10,10]],"date-time":"2020-10-10T03:20:55Z","timestamp":1602300055000},"page":"2150001","source":"Crossref","is-referenced-by-count":5,"title":["An improved PSO algorithm for solving nonlinear programing problems with constrained conditions"],"prefix":"10.1142","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0133-2114","authenticated-orcid":false,"given":"Wei-Der","family":"Chang","sequence":"first","affiliation":[{"name":"Department of Computer and Communication, Shu-Te University, Kaohsiung 824, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2020,12,12]]},"reference":[{"volume-title":"Optimization of Chemical Processes","year":"1989","author":"Edgar T. F.","key":"S179396232150001XBIB001"},{"key":"S179396232150001XBIB002","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijepes.2020.106389"},{"key":"S179396232150001XBIB003","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcp.2019.01.013"},{"key":"S179396232150001XBIB004","doi-asserted-by":"publisher","DOI":"10.1177\/003754970107600201"},{"key":"S179396232150001XBIB005","doi-asserted-by":"publisher","DOI":"10.1016\/j.cnsns.2010.01.009"},{"key":"S179396232150001XBIB006","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2010.12.001"},{"key":"S179396232150001XBIB007","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2012.12.004"},{"key":"S179396232150001XBIB008","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2019.01.001"},{"key":"S179396232150001XBIB009","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2019.08.009"},{"key":"S179396232150001XBIB010","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2020.103731"},{"key":"S179396232150001XBIB011","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113698"},{"key":"S179396232150001XBIB012","doi-asserted-by":"publisher","DOI":"10.1109\/ICNN.1995.488968"},{"key":"S179396232150001XBIB013","doi-asserted-by":"publisher","DOI":"10.1016\/j.cnsns.2010.01.005"},{"key":"S179396232150001XBIB014","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2013.07.021"},{"key":"S179396232150001XBIB015","doi-asserted-by":"publisher","DOI":"10.1016\/j.egypro.2013.11.032"},{"key":"S179396232150001XBIB016","doi-asserted-by":"publisher","DOI":"10.1007\/s12530-017-9192-x"},{"key":"S179396232150001XBIB017","doi-asserted-by":"publisher","DOI":"10.1007\/s12530-017-9184-x"},{"key":"S179396232150001XBIB018","doi-asserted-by":"publisher","DOI":"10.1016\/j.isatra.2013.06.010"},{"key":"S179396232150001XBIB019","doi-asserted-by":"publisher","DOI":"10.1016\/j.compbiomed.2013.01.020"},{"key":"S179396232150001XBIB020","doi-asserted-by":"publisher","DOI":"10.1016\/j.solener.2012.08.005"},{"key":"S179396232150001XBIB021","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2018.01.011"},{"key":"S179396232150001XBIB022","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2018.06.019"}],"container-title":["International Journal of Modeling, Simulation, and Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S179396232150001X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,2]],"date-time":"2021-03-02T08:49:12Z","timestamp":1614674952000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S179396232150001X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,12]]},"references-count":22,"journal-issue":{"issue":"01","published-print":{"date-parts":[[2021,2]]}},"alternative-id":["10.1142\/S179396232150001X"],"URL":"https:\/\/doi.org\/10.1142\/s179396232150001x","relation":{},"ISSN":["1793-9623","1793-9615"],"issn-type":[{"type":"print","value":"1793-9623"},{"type":"electronic","value":"1793-9615"}],"subject":[],"published":{"date-parts":[[2020,12,12]]}}}