%0 Journal Article
%T Adaptive Algorithm for MRMP<br>一种求解多车辆合乘匹配问题的适应性算法
%A 宋超超
%A 王洪国
%A 邵增珍
%A 杨福萍
%J 计算机科学
%D 2013
%I 
%X Multi vehicle ride matching problem(MRMP) studies the problem of taking passengers as much as possible through optimizing vehicles' route and matching between vehicles and passengers. 13ut at present, there arc some prob- lems in the researches such as models divorce from reality and low efficiency of algorithms. For this problem,this paper presented APSO(Attractive Particle Swarm Optimization) to solve this problem. I}he MRMP is transfered to RMP through APSO to form the first matching result between vehicles and passengers. And the best sort order is looked through sorting the result, making use of priori clustering based on the result from first matching. And at last, we opti- mined the solution one times more through optimized rules. Contrast experiment shows that the method based on APSO can solve the problem on a high rate of matching and a low cost.
%K APSO
%K MRMP
%K Prior clustering
%K Demand sequence<br>吸引粒子群，车辆合乘，先验聚类，需求序列
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=D8CF0D2A1D9D3361000A03F83C526492&yid=FF7AA908D58E97FA&vid=1371F55DA51B6E64&iid=0B39A22176CE99FB&sid=8B59EA573021D671&eid=CA5852BD1A173B3A&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=0