{"id":"https://openalex.org/W4366965184","doi":"https://doi.org/10.1504/ijaisc.2022.10055755","title":"Combining combinatorial optimisation and planning to solve the non-recurrent traffic jam problem","display_name":"Combining combinatorial optimisation and planning to solve the non-recurrent traffic jam problem","publication_year":2022,"publication_date":"2022-01-01","ids":{"openalex":"https://openalex.org/W4366965184","doi":"https://doi.org/10.1504/ijaisc.2022.10055755"},"language":"en","primary_location":{"id":"doi:10.1504/ijaisc.2022.10055755","is_oa":true,"landing_page_url":"https://doi.org/10.1504/ijaisc.2022.10055755","pdf_url":null,"source":{"id":"https://openalex.org/S16418438","display_name":"International Journal of Artificial Intelligence and Soft Computing","issn_l":"1755-4950","issn":["1755-4950","1755-4969"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Artificial Intelligence and Soft Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1504/ijaisc.2022.10055755","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5085061623","display_name":"Yacine Laalaoui","orcid":"https://orcid.org/0000-0002-4213-6403"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Yacine Laalaoui","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5085061623"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4444,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.72860609,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"7","issue":"4","first_page":"267","last_page":"267"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11344","display_name":"Traffic Prediction and Management Techniques","score":0.9840999841690063,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10524","display_name":"Traffic control and management","score":0.9837999939918518,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5665473937988281},{"id":"https://openalex.org/keywords/traffic-planning","display_name":"Traffic planning","score":0.41912150382995605},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3915945291519165},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.37231308221817017},{"id":"https://openalex.org/keywords/transport-engineering","display_name":"Transport engineering","score":0.216365784406662},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1906438171863556},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.1823069453239441}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5665473937988281},{"id":"https://openalex.org/C2986442093","wikidata":"https://www.wikidata.org/wiki/Q1034047","display_name":"Traffic planning","level":2,"score":0.41912150382995605},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3915945291519165},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.37231308221817017},{"id":"https://openalex.org/C22212356","wikidata":"https://www.wikidata.org/wiki/Q775325","display_name":"Transport engineering","level":1,"score":0.216365784406662},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1906438171863556},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.1823069453239441}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1504/ijaisc.2022.10055755","is_oa":true,"landing_page_url":"https://doi.org/10.1504/ijaisc.2022.10055755","pdf_url":null,"source":{"id":"https://openalex.org/S16418438","display_name":"International Journal of Artificial Intelligence and Soft Computing","issn_l":"1755-4950","issn":["1755-4950","1755-4969"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Artificial Intelligence and Soft Computing","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1504/ijaisc.2022.10055755","is_oa":true,"landing_page_url":"https://doi.org/10.1504/ijaisc.2022.10055755","pdf_url":null,"source":{"id":"https://openalex.org/S16418438","display_name":"International Journal of Artificial Intelligence and Soft Computing","issn_l":"1755-4950","issn":["1755-4950","1755-4969"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Artificial Intelligence and Soft Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2478288626","https://openalex.org/W2350741829","https://openalex.org/W2530322880","https://openalex.org/W1596801655"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}