Forthcoming and Online First Articles

International Journal of Artificial Intelligence and Soft Computing

International Journal of Artificial Intelligence and Soft Computing (IJAISC)

Forthcoming articles have been peer-reviewed and accepted for publication but are pending final changes, are not yet published and may not appear here in their final order of publication until they are assigned to issues. Therefore, the content conforms to our standards but the presentation (e.g. typesetting and proof-reading) is not necessarily up to the Inderscience standard. Additionally, titles, authors, abstracts and keywords may change before publication. Articles will not be published until the final proofs are validated by their authors.

Forthcoming articles must be purchased for the purposes of research, teaching and private study only. These articles can be cited using the expression "in press". For example: Smith, J. (in press). Article Title. Journal Title.

Articles marked with this shopping trolley icon are available for purchase - click on the icon to send an email request to purchase.

Online First articles are published online here, before they appear in a journal issue. Online First articles are fully citeable, complete with a DOI. They can be cited, read, and downloaded. Online First articles are published as Open Access (OA) articles to make the latest research available as early as possible.

Open AccessArticles marked with this Open Access icon are Online First articles. They are freely available and openly accessible to all without any restriction except the ones stated in their respective CC licenses.

Register for our alerting service, which notifies you by email when new issues are published online.

We also offer which provide timely updates of tables of contents, newly published articles and calls for papers.

International Journal of Artificial Intelligence and Soft Computing (1 paper in press)

Regular Issues

  • Combining Combinatorial Optimization and Planning to solve the Non-Recurrent Traffic Jam Problem   Order a copy of this article
    by Yacine LAALAOUI 
    Abstract: In this paper, we solve the non-recurrent traffic jam problem. This problem includes $n$ stopped vehicles where all of them share the same destination. We divided the problem into three subproblems namely: pathfinding, min-max, and planning. Pathfinding consists of determining the list of roads and paths that will be used to solve the jam situation. Min-max is an optimization problem, and it consists of assigning the overall vehicles in the jam situation to the list of roads leading to the final destination. Planning consists of finding the list of moves by each vehicle that will lead to the clearance of the jam situation. The proposed approach can be used to solve arisen jam situations at any time in the road network, and it has potential use in handling emergency situations. Experimental results on randomly-generated problem instances provide computational evidence of the applicability of the described approach.rn
    Keywords: Non-recurrent traffic jam; pathfinding; min-max; vehicles assignment; planning.