{"id":"W2626391197","doi":"10.1016/j.ejor.2017.06.028","title":"The static bike relocation problem with multiple vehicles and visits","year":2017,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":124,"is_retracted":false,"has_abstract":false,"ca_institutions":"HEC Montréal","funders":"Luonnontieteiden ja Tekniikan Tutkimuksen Toimikunta; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Relocation; Iterated local search; Computer science; Integer programming; Metaheuristic; Bike sharing; Scheme (mathematics); Vehicle routing problem; Service (business); Mathematical optimization; Iterated function; Operations research; Transport engineering; Routing (electronic design automation); Algorithm; Computer network; Mathematics; Engineering","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001991845,0.00004891011,0.0000523263,0.00007420191,0.0008230181,0.000385488,0.0002026685,0.00000777898,0.000008270659],"category_scores_gemma":[0.0002486382,0.00003082102,0.00001146799,0.00007287325,0.000131434,0.0003198975,0.00001244884,0.0002593167,0.00001179714],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002195189,"about_ca_system_score_gemma":0.00007782746,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003776097,"about_ca_topic_score_gemma":0.00004538155,"domain_scores_codex":[0.9990898,0.0001147844,0.0002392101,0.00005705878,0.0003880296,0.0001111087],"domain_scores_gemma":[0.9988086,0.0001793817,0.0000529515,0.000146227,0.0007553821,0.00005747387],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.001040243,0.0004207699,0.1506208,0.0004150929,0.000890796,0.0004236684,0.01361957,0.1971486,0.1055513,0.0905012,0.05357417,0.3857938],"study_design_scores_gemma":[0.0009657285,0.000239284,0.9568087,0.00009935744,0.000007202752,0.00004106424,0.0004148323,0.008918908,0.001069162,0.000185414,0.03115839,0.00009195791],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9841409,0.0001682381,0.00554845,0.004782879,0.00006596516,0.0001865317,0.00000727325,0.00001466444,0.005085085],"genre_scores_gemma":[0.9969532,0.0001517885,0.00253146,0.0000179135,0.00007047768,0.000003127119,0.000003752845,0.00001361822,0.0002546458],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8061879,"threshold_uncertainty_score":0.6330073,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0560173430681588,"score_gpt":0.3257038295633818,"score_spread":0.269686486495223,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}