A constraint programming approach for multi-objective tourist trip design problem with mandatory visits: A case study for İzmir Turkey
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
The Orienteering Problem (OP) is an optimization problem that finds the locations and routes that will return the highest profit/benefit, starting from the initial location of the traveler/vehicle, visiting these locations, and ending with the starting location of the tour within a given time or distance limit. There is no obligation to visit all locations in the problem structure. OP has many real-life applications, such as staff routing and disaster relief routing. In this study, OP with Time Windows (OPTW), an extension of OP, is discussed with hotel selection and mandatory visits. Although the main objective of OPTW is profit maximization, it is also essential to minimize the total travel time to complete the tour efficiently. For this reason, we consider the OPTW as a multi-objective problem. In the problem considered here, it is assumed that the profit/benefit, travel time between locations, service period, and time interval that each location can be visited are determined to be known. Within the scope of the study, first, a Mixed Integer Programming (MIP) model is prepared for the problem. Since the proposed mathematical model does not provide solutions in a reasonable time for large networks, the problem is solved by a Constraint Programming (CP) approach. Attractive tourist points of interest for Izmir, one of Turkey's major tourist cities, are determined, and the proposed method is applied to the real-life problem. The problem is modeled as Multi-Objective OPTW with MIP and CP and solved. Also, sensitivity analysis is performed by considering two different scenarios.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.004 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it