A Multi-Objective ACO to Solve the Daily Carpool Problem

Int. J. Strateg. Inf. Technol. Appl. Pub Date : 2018-04-01 DOI:10.4018/IJSITA.2018040104

Sahraoui Abdelatif, Derdour Makhlouf, Bouchra Marzak

引用次数: 5

Abstract

Inurbanareas,thecostofroadcongestionhaspaidgreatattentiontothesociological, technological and environmental aspects, such as the optimal route and fuel consumption.Thisstepistowardsasmartervehiclemobilitywherethetraveltime willbeplannedanddynamicallyadaptedtochangeswithactualstatusofthetraffic flow.Inthisarticleamulti-objectiveACOalgorithmisproposedtosolvethedaily carpoolingproblem.Inparticular,asetofdecisionvariablesareproposedinorderto minimizethreeobjectivefunctionssubjecttoasetofconstraintsontheseobjectives. KeywORDS Daily Carpool Problem, Heuristic Function, Multi-Objective ACO, Solution Space

查看原文本刊更多论文

一种求解日常拼车问题的多目标蚁群算法

Inurbanareas，thecostofroadcongestionhaspaidgreatattentiontothesociological，技术和环境方面，如最佳路线和燃料消耗。Thisstepistowardsasmartervehiclemobilitywherethetraveltime willbeplannedanddynamicallyadaptedtochangeswithactualstatusofthetraffic流量。Inthisarticleamulti-objectiveACOalgorithmisproposedtosolvethedaily carpoolingproblem。Inparticular，asetofdecisionvariablesareproposedinorderto minimizethreeobjectivefunctionssubjecttoasetofconstraintsontheseobjectives。关键词日常拼车问题，启发式函数，多目标蚁群算法，解空间

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Int. J. Strateg. Inf. Technol. Appl.

自引率

0.00%

发文量