{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:14:54Z","timestamp":1753884894435,"version":"3.41.2"},"reference-count":0,"publisher":"Inderscience Publishers","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IJAISC"],"published-print":{"date-parts":[[2022]]},"DOI":"10.1504\/ijaisc.2022.10055755","type":"journal-article","created":{"date-parts":[[2023,4,24]],"date-time":"2023-04-24T13:01:17Z","timestamp":1682341277000},"page":"267","source":"Crossref","is-referenced-by-count":1,"title":["Combining combinatorial optimisation and planning to solve the non-recurrent traffic jam problem"],"prefix":"10.1504","volume":"7","author":[{"given":"Yacine","family":"Laalaoui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"378","container-title":["International Journal of Artificial Intelligence and Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.inderscienceonline.com\/doi\/full\/10.1504\/IJAISC.2022.10055755","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,24]],"date-time":"2023-04-24T13:01:18Z","timestamp":1682341278000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.inderscience.com\/link.php?id=10055755"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":0,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022]]}},"URL":"https:\/\/doi.org\/10.1504\/ijaisc.2022.10055755","relation":{},"ISSN":["1755-4950","1755-4969"],"issn-type":[{"type":"print","value":"1755-4950"},{"type":"electronic","value":"1755-4969"}],"subject":[],"published":{"date-parts":[[2022]]},"article-number":"10055755"}}