Combining combinatorial optimisation and planning to solve the non-recurrent traffic jam problem Online publication date: Thu, 27-Apr-2023
by Yacine Laalaoui
International Journal of Artificial Intelligence and Soft Computing (IJAISC), Vol. 7, No. 4, 2022
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 optimisation 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 using CPLEX and Metric-FF solvers on randomly-generated problem instances provide computational evidence of the applicability of the described approach.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Artificial Intelligence and Soft Computing (IJAISC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook