Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 1

Enhancing the smart parking assignment system through constraints optimization

IAES International Journal of Artificial Intelligence · Vol. 13 No. 2 (2024) · hlm. 2374–2385

DOI
10.11591/ijai.v13.i2.pp2374-2385
ISSN
2252-8938, 2089-4872
Terbit
2024-06-01
Penerbit
Institute of Advanced Engineering and Science
Bahasa
eng
Lisensi
creativecommons.org/licenses/by-sa/4.0

Abstrak

Traffic in big cities has become a black spot for drivers. One of the major concerns is the parking problem that hinders urban mobility, particularly in big cities and other congested areas. This leads to an increase in accidents, a big consumption of fuel, and a spectacular augmentation of pollution. In this paper, we introduce a parking assignment system grounded in constraint programming to address the growing demand for efficient parking management in smart cities. Our system is designed to meet the requirements of groups of drivers seeking to reserve parking spaces simultaneously within the same period and geographical area. This entails imposing constraints on the desired parking type, including considerations such as walking and driving distances, parking costs, and availability. Within the scope of this study, we propose two formulations: constraint satisfaction programming (CSP) with an objective function and mixed-integer linear programming (MILP). Evaluation shows Choco, a CSP solver, is effective for smaller requests but slower for larger ones, while MILP excels for larger scenarios. Both solvers produce high-quality solutions meeting real-time response requirements. Our research offers innovative solutions for smart city management, considering parking type preferences, costs, and availability. We contribute significantly to parking space assignment methodologies, aiming to alleviate the time-consuming search for parking, reduce accidents, fuel consumption, and pollution.

Kata kunci

Jaringan kolaborasi para penulis

17 penulis · 33 tautan kepenulisan bersama · 4 lintas organisasi

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • University of Hassan II Casablanca
  • Chouaib Doukkali University
  • Afiliasi tidak diketahui
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama
Soukaina BouhsissinUniversity of Hassan II Casablanca3
Sara OuahabiUniversity of Hassan II Casablanca2
Hanane BoukhouimaUniversity of Hassan II Casablanca2
Nihal El KhalidiUniversity of Hassan II Casablanca2
Abdelfettah SoultanaUniversity of Hassan II Casablanca2
Imane SadgaliUniversity of Hassan II Casablanca2
Hambi El MostafaUniversity of Hassan II Casablanca1
Chaimaa BouaineUniversity of Hassan II Casablanca1
Kamal El GuemmatUniversity of Hassan II Casablanca1
Rihab AboudihajUniversity of Hassan II Casablanca1
Abdelaziz MarzakUniversity of Hassan II Casablanca1
Soukaina MerzoukChouaib Doukkali University1
Touria HamimUniversity of Hassan II Casablanca1
Ikram QarbalUniversity of Hassan II Casablanca1

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Sumber metadata: OAI-PMH (metadata jurnal) http://ijai.iaescore.com/index.php/IJAI/oai, pertama di-harvest 8 Nov 2026, terakhir terlihat 16 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Enhancing the smart parking assignment system through constraints optimization</dc:title>
	<dc:creator>Elkhalidi, Nihal</dc:creator>
	<dc:creator>Benabbou, Faouzia</dc:creator>
	<dc:creator>Sael, Nawal</dc:creator>
	<dc:subject xml:lang="en-US">Artificial intelligence ; Optimization ; Information Systems and Management</dc:subject>
	<dc:subject xml:lang="en-US">Assignment problem; Constrained optimization; Management system; Multi-agent system; Smart parking</dc:subject>
	<dc:description xml:lang="en-US">Traffic in big cities has become a black spot for drivers. One of the major concerns is the parking problem that hinders urban mobility, particularly in big cities and other congested areas. This leads to an increase in accidents, a big consumption of fuel, and a spectacular augmentation of pollution. In this paper, we introduce a parking assignment system grounded in constraint programming to address the growing demand for efficient parking management in smart cities. Our system is designed to meet the requirements of groups of drivers seeking to reserve parking spaces simultaneously within the same period and geographical area. This entails imposing constraints on the desired parking type, including considerations such as walking and driving distances, parking costs, and availability. Within the scope of this study, we propose two formulations: constraint satisfaction programming (CSP) with an objective function and mixed-integer linear programming (MILP). Evaluation shows Choco, a CSP solver, is effective for smaller requests but slower for larger ones, while MILP excels for larger scenarios. Both solvers produce high-quality solutions meeting real-time response requirements. Our research offers innovative solutions for smart city management, considering parking type preferences, costs, and availability. We contribute significantly to parking space assignment methodologies, aiming to alleviate the time-consuming search for parking, reduce accidents, fuel consumption, and pollution.</dc:description>
	<dc:publisher xml:lang="en-US">Institute of Advanced Engineering and Science</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2024-06-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US"></dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ijai.iaescore.com/index.php/IJAI/article/view/23629</dc:identifier>
	<dc:identifier>10.11591/ijai.v13.i2.pp2374-2385</dc:identifier>
	<dc:source xml:lang="en-US">IAES International Journal of Artificial Intelligence (IJ-AI); Vol 13, No 2: June 2024; 2374-2385</dc:source>
	<dc:source>2252-8938</dc:source>
	<dc:source>2089-4872</dc:source>
	<dc:source>10.11591/ijai.v13.i2</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ijai.iaescore.com/index.php/IJAI/article/view/23629/14040</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2024 Institute of Advanced Engineering and Science</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>