Journal Information
Journal of Heuristics
Impact Factor:
Call For Papers
The following areas are of interest to the journal:

Adaptive Memory Programming

Rafael Martí
Universitat de València, Spain  

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   

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

Alain Hertz
GERAD, Canada

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

Luigi Barone
SolveIT Software, Australia

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

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

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  

Marc Sevaux
University of South-Brittany, France

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  

Robert Doverspike
AT&T Labs (Research), USA

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.


Steve Chiu
Verizon Communications, USA  

This area invites papers that apply modern heuristic methodologies in original and insightful ways to solve problems arising in the telecommunications industry.  Both theoretical and applied contributions that present new techniques, analyses, or computational results are welcome.  The topics of interest to this area include but are not limited to teletraffic analysis and engineering, network architecture and design, network performance analysis and optimization, communications protocols, economic analysis of new technologies, network reliability and survivability, and network services and applications.  We are especially interested in papers that address important issues related to new telecommunications technologies, networks, or services such as high speed optical networks, next generation wireless systems, multimedia services, internet routing, switching or performance, and management of integrated broadband networks.
Last updated by Dou Sun in 2022-01-30
Related Journals
CCFFull NameImpact FactorPublisherISSN
IEEE Transactions on Haptics2.757IEEE1939-1412
cIET Intelligent Transport Systems0.512IET1751-956X
IEEE Security & Privacy2.04IEEE1540-7993
cJournal of Electronic Testing: Theory and Applications0.554Springer0923-8174
Scalable Computing Springer2194-6876
Journal of Semantics1.773Oxford University Press0167-5133
International Journal of Pattern Recognition & Artificial Intelligence World Scientific0218-0014
Journal of CheminformaticsChemistry Central1758-2946
Full NameImpact FactorPublisher
IEEE Transactions on Haptics2.757IEEE
IET Intelligent Transport Systems0.512IET
IEEE Security & Privacy2.04IEEE
Journal of Electronic Testing: Theory and Applications0.554Springer
Scalable Computing Springer
Journal of Semantics1.773Oxford University Press
International Journal of Pattern Recognition & Artificial Intelligence World Scientific
Journal of CheminformaticsChemistry Central
Related Conferences
CCFCOREQUALISShortFull NameSubmissionNotificationConference
PACBBInternational Conference on Practical Applications of Computational Biology & Bioinformatics2019-02-042019-03-112019-06-26
bIWSECInternational Workshop on Security2019-04-022019-05-272019-08-28
CCTCMAsia-Pacific Conference on Control Theory and Computer Modelling2020-01-252020-01-312021-02-23
cb3PacificVisIEEE Pacific Visualization Symposium2023-11-162023-12-222024-04-23
ICMInternational Conference on Mechatronics2012-09-212012-11-102013-02-27
CNIoT'International Conference on Green Communication, Network and Internet of Things2024-08-252024-08-262024-08-30
Iranian-RadarIranian Conference on Radar and Surveillance Systems2019-07-222019-09-222019-11-20
b4IHIInternational Health Informatics Symposium2011-06-232011-09-012012-01-28
PDADSInternational Workshop on Parallel and Distributed Algorithms for Decision Sciences2022-06-102022-07-012022-08-29
CRESDAsia Conference on Renewable Energy and Sustainable Development2023-04-302023-05-072023-05-19