Logo - springer
Slogan - springer

Mathematics - Applications | Journal of Heuristics – incl. option to publish open access

Journal of Heuristics

Journal of Heuristics

Editor-in-Chief: Manuel Laguna

ISSN: 1381-1231 (print version)
ISSN: 1572-9397 (electronic version)

Journal no. 10732

Springer Open Access
  • Provides a forum for advancing the state-of-the-art in the theory and practical application of techniques for solving problems approximately that cannot be solved exactly.
  • Fosters the development, understanding, and practical use of heuristic solution techniques for solving business, engineering, and societal problems.
  • Considers the importance of theoretical, empirical, and experimental work related to the development of heuristics.

The Journal of Heuristics provides a forum for advancing the state-of-the-art in the theory and practical application of techniques for solving problems approximately that cannot be solved exactly. It fosters the development, understanding, and practical use of heuristic solution techniques for solving business, engineering, and societal problems. It considers the importance of theoretical, empirical, and experimental work related to the development of heuristics.

The journal presents practical applications, theoretical developments, decision analysis models that consider issues of rational decision making with limited information, artificial intelligence-based heuristics applied to a wide variety of problems, learning paradigms, and computational experimentation.


Officially cited as: J Heuristics

Related subjects » Applications - Artificial Intelligence - Mathematics - Operations Research & Decision Theory

Impact Factor: 1.359 (2013) * 

Journal Citation Reports®, Thomson Reuters

Abstracted/Indexed in 

Science Citation Index Expanded (SciSearch), Journal Citation Reports/Science Edition, SCOPUS, INSPEC, Zentralblatt Math, Google Scholar, EBSCO, ProQuest, Academic OneFile, ACM Digital Library, Computer Abstracts International Database, Computer Science Index, CSA Environmental Sciences, Current Contents/Engineering, Computing and Technology, DBLP, ECONIS, EI-Compendex, Gale, International Abstracts in Operations Research, io-port.net, OCLC, SCImago, STMA-Z, Summon by ProQuest

Popular Content within this publication 

 

Articles

For authors and editors


  • Journal Citation Reports®, Thomson Reuters
    2013 Impact Factor
  • 1.359
  • Aims and Scope

    Aims and Scope

    Close

    The following areas are of interest to the journal:

    Adaptive Memory Programming

    Rafael Martí
    Universitat de València, Spain
    rafael.marti@uv.es

    Tabu search (TS), scatter search (SS) and path reliniking (PR) have become the focus of numerous comparative studies and practical applications. Fruitful discoveries about preferred strategies for solving difficult optimization problems have surfaced as a result. Advanced TS, SS and PR methods exploit a collection of memory components that are referred to as adaptive memory programming (AMP). AMP procedures embody a framework that goes beyond simple mechanisms to incorporate intensification and diversification strategies. The AMP area welcomes submissions that describe innovative applications or the development of new methodology for the use of memory within heuristic search procedures.

    Artificial Intelligence and Constraint Programming

    Pascal Van Hentenryck
    Brown University, USA
    pvh@cs.brown.edu

    This area covers heuristic search based on artificial intelligence techniques and their application to artificial intelligence planning, scheduling, design, constraint satisfaction, and game theory. It includes heuristics and metaheuristics for both systematic and local search in artificial intelligence. Of particular interest are heuristics based on constraint programming, a field that emerges from artificial intelligence and is an orthogonal and complementary approach to mathematical programming. This includes heuristics based on hybrid methods, e.g., those that combine local search and constraint programming or integrate constraint and mathematical programming.

    Combinatorial Optimization

    Edmund Burke
    University of Nottingham, UK
    E.Burke@cs.nott.ac.uk

    Alain Hertz
    GERAD, Canada
    Alain.Hertz@gerad.ca

    This area will act as an international forum for heuristic and metaheuristic research and development for combinatorial optimization problems. We welcome papers that present high quality, innovative and original research ideas and applications from across a wide spectrum of theoretical and applied research issues. Themes that are relevant to this area include (but are not limited to) graph theoretic problems and applications, sequencing and scheduling, engineering design, routing, cutting and packing, and set covering. In particular, we welcome inter-disciplinary approaches that attempt to work at the interface of relevant disciplines (such as Operational Research, Computer Science, Artificial Intelligence, Engineering and Management).

    Evolutionary Computation

    Juergen Branke
    University of Warwick, UK
    mail@branke.net

    Carlos A. Coello
    CINVESTAV-IPN, Mexico
    ccoello@cs.cinvestav.mx

    This area welcomes manuscripts on all aspects of evolutionary computation. Submissions covering advances in the theory, practice, and application of all evolutionary techniques, either individually or collectively, are encouraged. Topics of interest include, but are not limited to evolutionary approaches to optimization and machine learning, evolution of emergent properties, characterization of problems suitable for evolutionary algorithms, implementation issues of evolutionary algorithms, parallel computation of evolutionary algorithms, and applications of evolutionary computation to various problems in science, engineering, and business. Manuscripts on hybrid procedures, combining existing heuristic techniques including methodologies from other areas of operation research and computer science, are of great interest. Also of great interest are implementations of robust artificial systems that use evolutionary computation as a key component of their architecture. In particular, manuscripts discussing methodological innovations that can by applied to a wide range of problems are strongly encouraged. Additionally, survey papers describing state-of-the-art developments in a given field (including the perspective from evolutionary techniques) are welcomed.

    Large-Scale Optimization and Decomposition Methods

    Éric Taillard
    HEIG-VD, University of Applied Sciences of Western Switzerland
    eric.taillard@heig-vd.ch

    This area seeks papers that apply heuristic search methods to large-scale optimization problems that might require different types of decomposition approaches. This includes problems found in practice that must be decomposed as a sequence of simpler problems as well as large instances that are decomposed into smaller parts that are subsequently optimized independently. Typical methodologies applied to problems in this area include Large Neighborhood Search and Matheuristics, i.e., hybrids of metaheuristics and mathematical programming techniques.

    Logistics and Supply Chain

    Teodor Gabriel Crainic
    Université du Québec à Montréal
    theo@crt.umontreal.ca

    This area seeks papers that creatively apply heuristic search methods to important decision problems in logistics and supply chain problems. This includes problems from fields such as facility location, transportation and scheduling. Many decision problems in logistics and supply chain management may be formulated as optimization problems. Typically, these problems are too difficult to be solved exactly within a reasonable amount of time and heuristics become the methodology of choice. In cases where simply obtaining a feasible solution is not satisfactory, but where the quality of solution is critical, it becomes important to investigate efficient procedures to obtain the best possible solutions within time limits that are deemed practical. We seek well-written papers that span the full spectrum from theory to practice regarding heuristics and metaheuristics applications to logistics and supply chain problems. Papers may make a methodological contribution; contribute by developing and analyzing novel models motivated by current industrial problems and case studies. Contributions must be significant, relevant, and conceptually sound and must meet the rigorous standards of the journal.

    Metaheuristic Methodologies

    Holger H. Hoos
    University of British Columbia
    hoos@cs.ubc.ca

    Marc Sevaux
    University of South-Brittany, France
    marc.sevaux@univ-ubs.fr

    The Metaheuristics Methodologies area seeks to publish papers that espouse new general-purpose metaheuristics or provide analysis and comparison of existing methods. In both cases, the papers should provide a clear exposition of the relationship between the research reported in the manuscript and the extant body of research literature. The work can be either theoretical or empirical. If the work is empirical, it is important that sound scientific methods be employed. In particular, it is important the test data sets used in the work be made available to the research community. Additionally, concise statements of hypothesis must be provided along with the evidence that supports them. Both statistical and qualitative significance should be demonstrated.

    Real-World Applications

    Anthony Cox, Jr.
    Cox and Associates, USA
    TCoxDenver@aol.com

    This area welcomes manuscripts dealing with practical applications. Papers in this area can deal with new applications for which no previous solution methods exist or for which previous methods have proved unsatisfactory. Of particular interest are those papers that show how the application of heuristic methods has resulted in measurable benefits such as cost reduction or revenue increase.

    Officially cited as: J Heuristics

  • Submit Online
  • Open Choice - Your Way to Open Access
  • Instructions for Authors

    Instructions for Authors

    Close

  • Policy Statement (pdf, 451 kB)
  • Author Academy: Training for Authors
  • Call for Papers: Reliable & Efficient Wi...
  • Copyright information

    Copyright information

    Close

    Copyright Information

    For Authors

    Submission of a manuscript implies: that the work described has not been published before (except in form of an abstract or as part of a published lecture, review or thesis); that it is not under consideration for publication elsewhere; that its publication has been approved by all co-authors, if any, as well as – tacitly or explicitly – by the responsible authorities at the institution where the work was carried out.

    Author warrants (i) that he/she is the sole owner or has been authorized by any additional copyright owner to assign the right, (ii) that the article does not infringe any third party rights and no license from or payments to a third party is required to publish the article and (iii) that the article has not been previously published or licensed. The author signs for and accepts responsibility for releasing this material on behalf of any and all co-authors. Transfer of copyright to Springer (respective to owner if other than Springer) becomes effective if and when a Copyright Transfer Statement is signed or transferred electronically by the corresponding author. After submission of the Copyright Transfer Statement signed by the corresponding author, changes of authorship or in the order of the authors listed will not be accepted by Springer.

    The copyright to this article, including any graphic elements therein (e.g. illustrations, charts, moving images), is assigned for good and valuable consideration to Springer effective if and when the article is accepted for publication and to the extent assignable if assignability is restricted for by applicable law or regulations (e.g. for U.S. government or crown employees).

    The copyright assignment includes without limitation the exclusive, assignable and sublicensable right, unlimited in time and territory, to reproduce, publish, distribute, transmit, make available and store the article, including abstracts thereof, in all forms of media of expression now known or developed in the future, including pre- and reprints, translations, photographic reproductions and microform. Springer may use the article in whole or in part in electronic form, such as use in databases or data networks for display, print or download to stationary or portable devices. This includes interactive and multimedia use and the right to alter the article to the extent necessary for such use.

    Authors may self-archive the Author's accepted manuscript of their articles on their own websites. Authors may also deposit this version of the article in any repository, provided it is only made publicly available 12 months after official publication or later. He/she may not use the publisher's version (the final article), which is posted on SpringerLink and other Springer websites, for the purpose of self-archiving or deposit. Furthermore, the Author may only post his/her version provided acknowledgement is given to the original source of publication and a link is inserted to the published article on Springer's website. The link must be accompanied by the following text: "The final publication is available at link.springer.com".

    Prior versions of the article published on non-commercial pre-print servers like arXiv.org can remain on these servers and/or can be updated with Author's accepted version. The final published version (in pdf or html/xml format) cannot be used for this purpose. Acknowledgement needs to be given to the final publication and a link must be inserted to the published article on Springer's website, accompanied by the text "The final publication is available at link.springer.com". Author retains the right to use his/her article for his/her further scientific career by including the final published journal article in other publications such as dissertations and postdoctoral qualifications provided acknowledgement is given to the original source of publication.

    Author is requested to use the appropriate DOI for the article. Articles disseminated via link.springer.com are indexed, abstracted and referenced by many abstracting and information services, bibliographic networks, subscription agencies, library networks, and consortia.

    For Readers

    While the advice and information in this journal is believed to be true and accurate at the date of its publication, neither the authors, the editors, nor the publisher can accept any legal responsibility for any errors or omissions that may have been made. The publisher makes no warranty, express or implied, with respect to the material contained herein.

    All articles published in this journal are protected by copyright, which covers the exclusive rights to reproduce and distribute the article (e.g., as offprints), as well as all translation rights. No material published in this journal may be reproduced photographically or stored on microfilm, in electronic data bases, video disks, etc., without first obtaining written permission from the publisher (respective the copyright owner if other than Springer). The use of general descriptive names, trade names, trademarks, etc., in this publication, even if not specifically identified, does not imply that these names are not protected by the relevant laws and regulations.

    Springer has partnered with Copyright Clearance Center's RightsLink service to offer a variety of options for reusing Springer content. For permission to reuse our content please locate the material that you wish to use on link.springer.com or on springerimages.com and click on the permissions link or go to copyright.com, then enter the title of the publication that you wish to use. For assistance in placing a permission request, Copyright Clearance Center can be connected directly via phone: +1-855-239-3415, fax: +1-978-646-8600, or e-mail: info@copyright.com.


    © Springer Science+Business Media New York

Alerts for this journal

 

Get the table of contents of every new issue published in Journal of Heuristics.