{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001921084,0.002250105,0.00536497,0.001692447,0.002570515,0.003856299,0.006288537,0.007183323,0.01833704],"category_scores_gemma":[0.008030022,0.002717837,0.002216668,0.00418273,0.00221659,0.006561946,0.003394008,0.00293082,0.001811382],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00192093,"about_ca_system_score_gemma":0.002002726,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01357785,"about_ca_topic_score_gemma":0.009348203,"domain_scores_codex":[0.9975346,0.0008641446,0.0001194575,0.0006180202,0.0002046398,0.0006590305],"domain_scores_gemma":[0.9954737,0.002695008,0.0005153946,0.0003008874,0.0002672494,0.0007477346],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001570105,0.0004705043,0.002675549,0.0006744492,0.0003521246,0.00192671,0.0002447366,0.9143754,0.001186817,0.04175558,0.01340069,0.02136731],"study_design_scores_gemma":[0.0002541405,0.0002807817,0.001435717,0.00007885829,0.0001608223,0.0008240935,0.0007908906,0.9328182,0.0005330049,0.05899561,0.003732489,0.0000954007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6033159,0.002830631,0.3424011,0.00631072,0.0007502556,0.0006161011,0.004117982,0.0007855464,0.03887175],"genre_scores_gemma":[0.9195183,0.001122249,0.03727364,0.0003439344,0.0003098624,0.0002550785,0.001896759,0.0002501073,0.03903008],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01833704,"threshold_uncertainty_score":0.06134349,"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."}}