A Multi-Objective ACO to Solve the Daily Carpool Problem

Abdelatif Sahraoui, Makhlouf Derdour and Bouchra Marzak
Additional contact information
Abdelatif Sahraoui: LAMIS Laboratory, University of Larbi Tebessi, Tebessa, Algeria
Makhlouf Derdour: LRS laboratory, University of Larbi Tebessi, Tebessa, Algeria
Bouchra Marzak: Laboratory of Information Processing, Faculty of Sciences Ben M'Sik, Hassan II University, Casablanca, Morocco

International Journal of Strategic Information Technology and Applications (IJSITA), 2018, vol. 9, issue 2, 50-60

Abstract: In urban areas, the cost of road congestion has paid great attention to the sociological, technological and environmental aspects, such as the optimal route and fuel consumption. This step is towards a smarter vehicle mobility where the travel time will be planned and dynamically adapted to changes with actual status of the traffic flow. In this article a multi-objective ACO algorithm is proposed to solve the daily carpooling problem. In particular, a set of decision variables are proposed in order to minimize three objective functions subject to a set of constraints on these objectives.

Date: 2018
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://services.igi-global.com/resolvedoi/resolve. ... 18/IJSITA.2018040104 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:igg:jsita0:v:9:y:2018:i:2:p:50-60

Access Statistics for this article

International Journal of Strategic Information Technology and Applications (IJSITA) is currently edited by Mehdi Khosrow-Pour

More articles in International Journal of Strategic Information Technology and Applications (IJSITA) from IGI Global
Bibliographic data for series maintained by Journal Editor ().