Back to Results
First PageMeta Content
Theoretical computer science / Local consistency / FO / Ant colony optimization algorithms / Variable / Constraint programming / Mathematics / Software engineering


Experiments with a Hybrid ACO+CP for Balancing Bicycle Sharing Systems Luca Di Gaspero∗ Andrea Rendl†
Add to Reading List

Document Date: 2013-09-20 05:21:11

Open Document

File Size: 1,00 MB

Share Result on Facebook

City

Ischia / Udine / Vienna / /

Company

Intel / /

Country

Austria / Italy / /

/

Facility

Austrian Institute of Technology / University of Udine / station S Ve / /

IndustryTerm

search strategies / travel time matrix ttu / time chain / depth-first tree-search / bicycle sharing systems / possible solution / feasible solution / overall search / lower cost solutions / partial solution / travel distance / Bike sharing systems / travel times / search paths / search tree / branch-and-bound algorithm / search engine / feasible solutions / at finding quickly feasible solutions / /

MarketIndex

Vienna / /

OperatingSystem

Linux / Ubuntu / /

Organization

Department of Electrical / Management and Mechanical Engineering / DTS Mobility Department / Institute of Technology / University of Udine / /

Person

Andrea Rendl / Luca Di Gaspero∗ Andrea / Andrea Rendl† Tommaso Urli / Luca Di Gaspero / Paola Festa / Christian Blum / Hybrid Metaheuristics / Andrea Roli / Ai / Tommaso Urli / Michael Sampels / /

Position

CP model for the BBSS problem / /

PublishedMedium

Lecture Notes in Computer Science / /

Technology

ACO+CP algorithms / Linux / hybridization / 6 Algorithm / search engine / dom / branch-and-bound algorithm / pheromones / /

SocialTag