{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008834802,0.001118804,0.0007817482,0.000842436,0.001061203,0.001430864,0.001320476,0.00189435,0.00326012],"category_scores_gemma":[0.0009801736,0.0004425272,0.001327233,0.002172696,0.0005511837,0.0007838685,0.0008398556,0.001202321,0.0001844981],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002133658,"about_ca_system_score_gemma":0.002499043,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.03043426,"about_ca_topic_score_gemma":0.04010778,"domain_scores_codex":[0.9993673,0.0002874909,0.00002867446,0.00007961846,0.0001001627,0.0001366778],"domain_scores_gemma":[0.9992662,0.0004258108,0.00008169121,0.00003361966,0.0001041898,0.00008843623],"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.0001572568,0.0002525241,0.002039315,0.0004196444,0.00007320973,0.002962232,0.0001651697,0.9589379,0.00186338,0.01202705,0.002406319,0.01869598],"study_design_scores_gemma":[0.00004958183,0.0002069136,0.001635177,0.00004307896,0.00006029308,0.000462758,0.000485774,0.9889534,0.0007904728,0.002341332,0.00493763,0.00003368732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6965844,0.003326885,0.2375635,0.001518933,0.0001702765,0.0008264045,0.001345683,0.0003312504,0.05833263],"genre_scores_gemma":[0.8898273,0.001041468,0.102888,0.00007865933,0.00002538572,0.0002815561,0.000420127,0.00004747084,0.005390159],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03043426,"threshold_uncertainty_score":0.06051421,"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."}}