| Document Date: 2014-09-12 00:58:22
Open Document File Size: 476,37 KBShare Result on Facebook
City Udine / Vienna / / Country Austria / Italy / / / Facility University of Udine / station S Ve / DTS Mobility Department Austrian Institute of Technology Giefinggasse / / IndustryTerm online-learning branching heuristic / travel time matrix ttu / search process / tree-search procedure / time chain / transportation / variable neighbourhood search / depth-first tree-search / possible solution / overall search / lower cost solutions / partial solution / travel distance / helper algorithms / bike sharing systems / search strategy / travel time / tabu search / travel times / tree-search / search paths / search tree / helper algorithm / branch-and-bound algorithm / search engine / feasible solutions / approximation algorithms / at finding quickly feasible solutions / / Organization DTS Mobility Department Austrian Institute of Technology Giefinggasse / US Federal Reserve / University of Udine / / Person Ai / Raviv / / Position CP model for the BBSS problem / / Technology helper algorithm / hybridization / helper algorithms / set 8 Algorithm / approximation algorithms / search engine / dom / branch-and-bound algorithm / pheromones / /
SocialTag |
A Hybrid ACO+CP for Balancing Bicycle Sharing Systems Luca Di Gaspero1 , Andrea Rendl2 , and Tommaso Urli1 1 Department of Electrical, Management and Mechanical Engineering,