{"id":"W4407194486","doi":"10.1007/s10479-025-06477-z","title":"Sustainable ridesharing routing and scheduling problem: an efficient multi-objective adaptive large neighborhood search","year":2025,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec à Montréal","funders":"Hebei Province Outstanding Youth Fund; Humanities and Social Sciences Youth Foundation, Ministry of Education of the People's Republic of China","keywords":"Computer science; Theory of computation; Scheduling (production processes); Vehicle routing problem; Mathematical optimization; Job shop scheduling; Routing (electronic design automation); Distributed computing; Computer network; Mathematics; Algorithm","routes":{"ca_aff":true,"ca_fund":false,"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.001226877,0.0007406104,0.001846928,0.000989591,0.0005578035,0.0009825502,0.001817562,0.001709051,0.002483037],"category_scores_gemma":[0.002220812,0.0005634704,0.0007979334,0.001088937,0.0006294526,0.001233651,0.001105209,0.0007758811,0.0002009905],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008710494,"about_ca_system_score_gemma":0.001545851,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007707183,"about_ca_topic_score_gemma":0.006023893,"domain_scores_codex":[0.9994684,0.0002419443,0.00001957281,0.00010892,0.00009238238,0.00006885792],"domain_scores_gemma":[0.9993098,0.0004684597,0.0000708174,0.00002820946,0.00007428427,0.00004846015],"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.00006372675,0.00006264292,0.000235734,0.0000613244,0.00003353881,0.00004806738,0.0000191403,0.982534,0.0004324203,0.004145094,0.0008525793,0.01151173],"study_design_scores_gemma":[0.00001040186,0.00002423477,0.00004006578,0.000002395925,0.00000612491,0.000007925407,0.000007725153,0.9987198,0.00005130897,0.0009666827,0.0001612106,0.000002130203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.113618,0.001000855,0.8733248,0.0007879473,0.0001377157,0.0002213819,0.0002699126,0.0002501199,0.01038929],"genre_scores_gemma":[0.7809259,0.0005102326,0.2091953,0.0001705272,0.00008609917,0.0003321795,0.0003249065,0.00009283598,0.008361947],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007707183,"threshold_uncertainty_score":0.01532465,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1030187118988642,"score_gpt":0.4063941595414879,"score_spread":0.3033754476426237,"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."}}