IDEAS home Printed from https://ideas.repec.org/p/ant/wpaper/2011017.html
   My bibliography  Save this paper

A variable neighbourhood search algorithm to generate first species counterpoint musical scores

Author

Listed:
  • HERREMANS, Dorien
  • SÖRENSEN, Kenneth

Abstract

In this paper a variable neighbourhood search (VNS) algorithm is developed that can generate musical fragments of arbitrary length consisting of a cantus firmus and a first species counterpoint melody. The objective function of the algorithm is based on a quantification of existing counterpoint rules. The VNS algorithm developed in this paper is a local search algorithm that starts from a randomly generated melody and improves it by changing one or two notes at a time. A thorough parametric analysis of the VNS reveals the significance of the algorithm’s parameters on the quality of the composed fragment, as well as their optimal settings. The VNS algorithm has been implemented in a user-friendly software environment for composition, called Optimuse. Optimuse allows a user to specify a number of characteristics such as length, key, and mode. Based on this information, Optimuse “composes” both a cantus firmus and a first species counterpoint melody. Alternatively, the user may specify a cantus firmus, and let Optimuse compose only an accompanying first species counterpoint melody.

Suggested Citation

  • HERREMANS, Dorien & SÖRENSEN, Kenneth, 2011. "A variable neighbourhood search algorithm to generate first species counterpoint musical scores," Working Papers 2011017, University of Antwerp, Faculty of Business and Economics.
    • Handle: RePEc:ant:wpaper:2011017
    as

    Download full text from publisher

    File URL: https://repository.uantwerpen.be/docman/irua/e0bcd9/131e809e.pdf
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    Variable Neighborhood Search (VNS); Genetic Algorithm (GA); Metaheuristics; Local search; Music; Computer Aided Composition (CAC);
    All these keywords.

    JEL classification:

    • C6 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling
    • C8 - Mathematical and Quantitative Methods - - Data Collection and Data Estimation Methodology; Computer Programs
    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ant:wpaper:2011017. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Joeri Nys (email available below). General contact details of provider: https://edirc.repec.org/data/ftufsbe.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.