A Multi-Objective ACO to Solve the Daily Carpool Problem
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.
Year of publication: |
2018
|
---|---|
Authors: | Sahraoui, Abdelatif ; Derdour, Makhlouf ; Marzak, Bouchra |
Published in: |
International Journal of Strategic Information Technology and Applications (IJSITA). - IGI Global, ISSN 1947-3109, ZDB-ID 2703780-0. - Vol. 9.2018, 2 (01.04.), p. 50-60
|
Publisher: |
IGI Global |
Subject: | Daily Carpool Problem | Heuristic Function | Multi-Objective ACO | Solution Space |
Saved in:
Online Resource
Saved in favorites
Similar items by subject
-
Exploiting flat subspaces in local search for p-Center problem and two fault-tolerant variants
Mousavi, Seyed R., (2023)
-
Tannahill, Carol, (2013)
-
Simulation-based scanning of a structured light system for objects without overhangs
Ham, Won K., (2016)
- More ...
Similar items by person