{"id":"W4389829004","doi":"10.5267/j.jpm.2023.8.003","title":"A constraint programming approach for multi-objective tourist trip design problem with mandatory visits: A case study for İzmir Turkey","year":2023,"lang":"en","type":"article","venue":"Journal of Project Management","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Orienteering; Operations research; Mathematical optimization; Profit (economics); Integer programming; Vehicle routing problem; Computer science; Interval (graph theory); Profit maximization; Constraint programming; Linear programming; Tourism; Programming paradigm; Routing (electronic design automation); Stochastic programming; Mathematics; Geography; Economics; Computer network","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003719654,0.0002580411,0.0004016594,0.0006163719,0.0001713874,0.0001456831,0.0001929879,0.00005604526,0.000001292484],"category_scores_gemma":[0.00006590721,0.0002092243,0.0001319177,0.0006912992,0.00002700832,0.0001886762,0.00004833954,0.0001992816,5.165415e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002338248,"about_ca_system_score_gemma":0.00007716709,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009858226,"about_ca_topic_score_gemma":0.000004497043,"domain_scores_codex":[0.9982067,0.0002048065,0.0006263173,0.0002646548,0.0002906194,0.000406844],"domain_scores_gemma":[0.9989796,0.0001758303,0.000297062,0.0001825566,0.00028646,0.00007847668],"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.0004557655,0.0007963995,0.0002220512,0.001745744,0.001988173,0.00150938,0.009717672,0.8975744,0.00004055414,0.00004647097,0.001876153,0.08402727],"study_design_scores_gemma":[0.008932811,0.002261868,0.00007760787,0.0001680134,0.0005709113,0.0008587826,0.05096042,0.9344407,0.0001478622,0.00001868537,0.001153592,0.0004087938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006026661,0.00004551599,0.9847994,0.00001226343,0.000112566,0.008613649,0.00001041976,0.0002415073,0.0001380042],"genre_scores_gemma":[0.09785769,0.00000986324,0.9004278,0.000008746631,0.00009957956,0.00132859,0.000005160732,0.00008072648,0.0001818277],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.09183103,"threshold_uncertainty_score":0.8531919,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0754302478022522,"score_gpt":0.3396753721924213,"score_spread":0.2642451243901691,"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."}}