{"@context":{"@vocab":"https://cir.nii.ac.jp/schema/1.0/","rdfs":"http://www.w3.org/2000/01/rdf-schema#","dc":"http://purl.org/dc/elements/1.1/","dcterms":"http://purl.org/dc/terms/","foaf":"http://xmlns.com/foaf/0.1/","prism":"http://prismstandard.org/namespaces/basic/2.0/","cinii":"http://ci.nii.ac.jp/ns/1.0/","datacite":"https://schema.datacite.org/meta/kernel-4/","ndl":"http://ndl.go.jp/dcndl/terms/","jpcoar":"https://github.com/JPCOAR/schema/blob/master/2.0/"},"@id":"https://cir.nii.ac.jp/crid/1362544420278548864.json","@type":"Article","productIdentifier":[{"identifier":{"@type":"DOI","@value":"10.1177/003754970107600201"}},{"identifier":{"@type":"URI","@value":"https://journals.sagepub.com/doi/pdf/10.1177/003754970107600201"}}],"dc:title":[{"@value":"A New Heuristic Optimization Algorithm: Harmony Search"}],"description":[{"type":"abstract","notation":[{"@value":"<jats:p> Many optimization problems in various fields have been solved using diverse optimization al gorithms. Traditional optimization techniques such as linear programming (LP), non-linear programming (NLP), and dynamic program ming (DP) have had major roles in solving these problems. However, their drawbacks generate demand for other types of algorithms, such as heuristic optimization approaches (simulated annealing, tabu search, and evolutionary algo rithms). However, there are still some possibili ties of devising new heuristic algorithms based on analogies with natural or artificial phenom ena. A new heuristic algorithm, mimicking the improvisation of music players, has been devel oped and named Harmony Search (HS). The performance of the algorithm is illustrated with a traveling salesman problem (TSP), a specific academic optimization problem, and a least-cost pipe network design problem. </jats:p>"}]}],"creator":[{"@id":"https://cir.nii.ac.jp/crid/1382544420278548992","@type":"Researcher","foaf:name":[{"@value":"Zong Woo Geem"}],"jpcoar:affiliationName":[{"@value":"Department of Civil and Environmental Engineering Korea University, Seoul, South Korea 136-701"}]},{"@id":"https://cir.nii.ac.jp/crid/1382544420278548864","@type":"Researcher","foaf:name":[{"@value":"Joong Hoon Kim"}],"jpcoar:affiliationName":[{"@value":"Department of Civil and Environmental Engineering Korea University, Seoul, South Korea 136-701"}]},{"@id":"https://cir.nii.ac.jp/crid/1382544420278548993","@type":"Researcher","foaf:name":[{"@value":"G.V. Loganathan"}],"jpcoar:affiliationName":[{"@value":"Department of Civil and Environmental Engineering Virginia Polytechnic Institute and State University Blacksburg, Virginia 24061"}]}],"publication":{"publicationIdentifier":[{"@type":"PISSN","@value":"00375497"},{"@type":"EISSN","@value":"17413133"}],"prism:publicationName":[{"@value":"SIMULATION"}],"dc:publisher":[{"@value":"SAGE Publications"}],"prism:publicationDate":"2001-02","prism:volume":"76","prism:number":"2","prism:startingPage":"60","prism:endingPage":"68"},"reviewed":"false","dc:rights":["https://journals.sagepub.com/page/policies/text-and-data-mining-license"],"url":[{"@id":"https://journals.sagepub.com/doi/pdf/10.1177/003754970107600201"}],"createdAt":"2008-03-29","modifiedAt":"2025-03-02","relatedProduct":[{"@id":"https://cir.nii.ac.jp/crid/1050016417147916160","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"Mosaic Based Optimization of NRD Guide Devices Using Binary Evolutionary Approaches and 2D-FVFEM"}]},{"@id":"https://cir.nii.ac.jp/crid/1360004235141213312","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Self-Adaptive Gravitational Search Algorithm With a Modified Chaotic Local Search"}]},{"@id":"https://cir.nii.ac.jp/crid/1360009142523369856","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Multipopulation Ensemble Particle Swarm Optimizer for Engineering Design Problems"}]},{"@id":"https://cir.nii.ac.jp/crid/1360306906105327104","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Electrical Storm Optimization (ESO) Algorithm: Theoretical Foundations, Analysis, and Application to Engineering Problems"}]},{"@id":"https://cir.nii.ac.jp/crid/1360580229831300096","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Multiple Elite Individual Guided Piecewise Search-Based Differential Evolution"}]},{"@id":"https://cir.nii.ac.jp/crid/1360588381072093952","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Spherical search algorithm with memory-guided population stage-wise control for bound-constrained global optimization problems"}]},{"@id":"https://cir.nii.ac.jp/crid/1360848659592386176","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"K2-140b and K2-180b – Characterization of a hot Jupiter and a mini-Neptune from the<i>K2</i>mission"}]},{"@id":"https://cir.nii.ac.jp/crid/1362539019285160320","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"It Takes Two Planets in Resonance to Tango around K2-146"}]},{"@id":"https://cir.nii.ac.jp/crid/1390001204568791168","@type":"Article","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"Soft-Sensor Modeling of Polyvinyl Chloride Polymerizing Process"}]},{"@id":"https://cir.nii.ac.jp/crid/1390001205638434944","@type":"Article","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"ja","@value":"ハーモニーサーチヒューリスティックスアルゴリズムに基づいた新しい離散断面最適化手法"},{"@language":"en","@value":"A NEW DISCRETE SIZE OPTIMIZATION METHOD OF STRUCTURES BASED ON HARMONY SEARCH HEURISTIC ALGORITHM"},{"@language":"ja-Kana","@value":"new discrete size optimization method of structures based on harmony search heuristic algorithm"}]},{"@id":"https://cir.nii.ac.jp/crid/1390282680479002496","@type":"Article","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"<b>Cost-Oriented Vehicle Routing and Cargo Allocation with Minimum CO</b><b><sub>2 </sub></b><b>Emissions Based on Harmony Search Algorithm </b>"},{"@value":"Cost-Oriented Vehicle Routing and Cargo Allocation with Minimum CO₂ Emissions Based on Harmony Search Algorithm"}]},{"@id":"https://cir.nii.ac.jp/crid/1390853879745953792","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"Novel Metaheuristic: Spy Algorithm"}]}],"dataSourceIdentifier":[{"@type":"CROSSREF","@value":"10.1177/003754970107600201"},{"@type":"CROSSREF","@value":"10.1252/jcej.11we155_references_DOI_Ab4eQf2KqpF43KJ5tPk5xCtjrbk"},{"@type":"CROSSREF","@value":"10.1155/2020/1450985_references_DOI_Ab4eQf2KqpF43KJ5tPk5xCtjrbk"},{"@type":"CROSSREF","@value":"10.1109/access.2022.3180732_references_DOI_Ab4eQf2KqpF43KJ5tPk5xCtjrbk"},{"@type":"CROSSREF","@value":"10.1587/transinf.2021edp7092_references_DOI_Ab4eQf2KqpF43KJ5tPk5xCtjrbk"},{"@type":"CROSSREF","@value":"10.1109/access.2017.2748957_references_DOI_Ab4eQf2KqpF43KJ5tPk5xCtjrbk"},{"@type":"CROSSREF","@value":"10.3390/make7010024_references_DOI_Ab4eQf2KqpF43KJ5tPk5xCtjrbk"},{"@type":"CROSSREF","@value":"10.1109/jas.2023.123018_references_DOI_Ab4eQf2KqpF43KJ5tPk5xCtjrbk"},{"@type":"CROSSREF","@value":"10.1016/j.asoc.2024.111677_references_DOI_Ab4eQf2KqpF43KJ5tPk5xCtjrbk"},{"@type":"CROSSREF","@value":"10.1093/mnras/sty2760_references_DOI_Ab4eQf2KqpF43KJ5tPk5xCtjrbk"},{"@type":"CROSSREF","@value":"10.3130/aijs.69.101_3_references_DOI_Ab4eQf2KqpF43KJ5tPk5xCtjrbk"},{"@type":"CROSSREF","@value":"10.14327/iscm.8.40_references_DOI_Ab4eQf2KqpF43KJ5tPk5xCtjrbk"},{"@type":"CROSSREF","@value":"10.3847/1538-3881/ab66c9_references_DOI_Ab4eQf2KqpF43KJ5tPk5xCtjrbk"}]}