{
  "abstract": "Distribution logistics with capacity constraints and service priorities can be modeled as a variant of the \\emph{TSP with Profits} (TSPP), in which not all customers need to be visited and the selection of which customers to serve is part of the problem. This paper proposes an applied variant with two adaptations: (i) a 0/1 Knapsack objective function weighted by client priority squared ($v_i \\cdot p_i^2$), and (ii) a priority bias in the Nearest Neighbor heuristic for the TSP, parameterized by $α$. The approach is evaluated on a scenario with 14 customers and a 1,100~kg capacity, complemented by a comparative experimental protocol against the classical greedy heuristic ($v_i/w_i$ ordering) and an integer programming solver. Results on the base scenario show 9 customers served, 96.4\\% capacity utilization, and R\\$~18,392.60 revenue, with all 5 excluded customers being low-priority. A sensitivity analysis of the priority exponent justifies the quadratic choice. The limitations of the hierarchical decomposition are explicitly discussed.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2610.36526",
  "author_total": 2,
  "authors": [
    {
      "name": "Aron da Silva Bezerra"
    },
    {
      "name": "Francisco Márcio Barboza"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/6nrf9havgpzag.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2610.36526",
  "fulltext_url": null,
  "id": "6nrf9havgpzag",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2610.36526",
  "language": null,
  "licence": "CC-BY-4.0",
  "licence_label": "CC BY 4.0",
  "licence_source": "article",
  "licence_url": "http://creativecommons.org/licenses/by/4.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "math.OC"
    ],
    [
      "openalex",
      "2209|Vehicle Routing Optimization Methods"
    ]
  ],
  "openalex": "W7224100753",
  "pdf_url": "https://arxiv.org/pdf/2610.36526",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-27",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/6nrf9havgpzag.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:35:53Z",
      "native_id": "2610.36526",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2610.36526"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "arxiv:math.OC",
      "subfield": "optimisation-control"
    }
  ],
  "title": "Hybridizing 0/1 Knapsack and Priority-Aware TSP for Vehicle Routing: an Applied Variant of the TSP with Profits",
  "title_text": "Hybridizing 0/1 Knapsack and Priority-Aware TSP for Vehicle Routing: an Applied Variant of the TSP with Profits",
  "type": "preprint",
  "updated_at": "2026-10-30T12:35:53Z",
  "url": "https://research.draconitic.com/paper/6nrf9havgpzag",
  "venue": "arXiv",
  "versions": []
}