{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T07:07:55Z","timestamp":1649142475866},"reference-count":13,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Artif. Intell. Tools"],"published-print":{"date-parts":[[2003,12]]},"abstract":"<jats:p>A new self-adaptive mutation operator, Angular Displacement, for optimizing real-valued vectors is presented. This is designed for applications, called directional problems, where the quality of a solution vector is based exclusively on the direction of the vector and not the length of the vector. Angular Displacement maintains one control parameter that stochastically governs the amount of angular displacement, \u03b8, induced by a single mutation. After \u03b8 is chosen, a random vector is selected that forms an angle of \u03b8 radians with the input vector. This approach contrasts the standard mutation operator that maintains one extra parameter for each vector component to control the displacement of the vector's head. Experiments show Angular Displacement is superior to the standard mutation operator in a directional problem involving the optimization of a hyperplane's parameters.<\/jats:p>","DOI":"10.1142\/s0218213003001344","type":"journal-article","created":{"date-parts":[[2004,1,7]],"date-time":"2004-01-07T09:17:58Z","timestamp":1073467078000},"page":"509-526","source":"Crossref","is-referenced-by-count":0,"title":["MUTATING REAL-VALUED VECTORS USING ANGULAR DISPLACEMENT"],"prefix":"10.1142","volume":"12","author":[{"given":"MICHAEL A.","family":"ZMUDA","sequence":"first","affiliation":[{"name":"Department of Computer Science and Systems Analysis, Miami University, Oxford, OH 45056, USA"},{"name":"Department of Computer Science and Engineering, Wright State University Dayton, OH 45435, USA"},{"name":"Department of Computer Science and Engineering, Wright State University Dayton, OH 45435, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"MATEEN M.","family":"RIZKI","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Systems Analysis, Miami University, Oxford, OH 45056, USA"},{"name":"Department of Computer Science and Engineering, Wright State University Dayton, OH 45435, USA"},{"name":"Department of Computer Science and Engineering, Wright State University Dayton, OH 45435, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"LOUIS A.","family":"TAMBURINO","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Systems Analysis, Miami University, Oxford, OH 45056, USA"},{"name":"Department of Computer Science and Engineering, Wright State University Dayton, OH 45435, USA"},{"name":"Department of Computer Science and Engineering, Wright State University Dayton, OH 45435, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf1","volume-title":"Numerical Optimization of Computer Models","author":"Schwefel H. P.","year":"1982"},{"key":"rf2","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195099713.001.0001","volume-title":"Evolutionary Algorithms in Theory and Practice","author":"B\u00e4ck T.","year":"1996"},{"key":"rf3","volume-title":"System Identification Through Simulated Evolution: A Machine Learning Approach to Modeling","author":"Fogel D. B.","year":"1991"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03315-9"},{"key":"rf5","volume-title":"Pattern Classification and Scene Analysis","author":"Duda R.","year":"1973"},{"key":"rf6","volume-title":"Computer and Robot Vision","volume":"1","author":"Haralick R. M.","year":"1992"},{"key":"rf7","volume-title":"Evolutionary Computations and Intelligent Systems, Gordon and Breach","author":"Michalewicz Z.","year":"1999"},{"key":"rf8","unstructured":"G.\u00a0Mitchell, D.\u00a0O'Donoghue and A.\u00a0Trenaman, A New Operator for Efficient Evolutionary Search Solutions to the Traveling Salesman Problem (2000)\u00a0pp. 771\u2013774."},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1109\/4235.797969"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1201\/9781420034349.ch21"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1201\/9781420034349.ch22"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1201\/9781420034349.ch20"},{"key":"rf17","unstructured":"M.\u00a0Zmuda, L.\u00a0Tamburino and M.\u00a0Rizki, Automated Synthesis of Pattern Recognition Systems\u00a09 (1999)\u00a0pp. 381\u2013386."}],"container-title":["International Journal on Artificial Intelligence Tools"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218213003001344","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,13]],"date-time":"2021-06-13T20:19:55Z","timestamp":1623615595000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218213003001344"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,12]]},"references-count":13,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2003,12]]}},"alternative-id":["10.1142\/S0218213003001344"],"URL":"https:\/\/doi.org\/10.1142\/s0218213003001344","relation":{},"ISSN":["0218-2130","1793-6349"],"issn-type":[{"value":"0218-2130","type":"print"},{"value":"1793-6349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,12]]}}}