Hybrid exact-heuristic Python solver released for SOICT 2026 passenger and parcel routing contest
Researchers describe the solver they entered in the second round of the SOICT 2026 contest, combining greedy heuristics with an exact route-selection engine in one Python file.
In plain words
A team built a program that plans routes for taxis carrying both passengers and parcels, where each ride must fit time limits and only some requests can be served. The program mixes fast rule-of-thumb search with a slower method that proves the best route choice for a given set of requests. It picks which method to use based on problem size.
What was announced
The solver, described in an arXiv abstract, targets the Integrated Passenger and Parcel Transportation problem, a selective pickup-and-delivery routing task with time windows, open routes and heterogeneous taxis. It is a single-file Python program using only the standard library. Its components include a constant-time insertion test based on latest-arrival slack, greedy insertion, local search, and an Adaptive Large Neighborhood Search with simulated-annealing acceptance, the authors write.
For exact selection, the solver enumerates the best feasible route for each request set per taxi, then solves the resulting set-packing problem with branch-and-bound strengthened by route-based large neighborhood search, Lagrangian bounds and reduced-cost fixing. The engine is chosen automatically from instance size, and a verifier and watchdog ensure a valid answer is always printed. On the official evaluation of 38 scored instances with a 5-minute limit, the solver reported a total benefit of 487,237, finished every run within 277 seconds and used at most 279 MB, with 28 instances ending well before the limit.
What it does not show
- The source is the paper abstract only; the full paper's methods and results were not reviewed.
- Results come from the authors' own report on the contest evaluation and are not independently confirmed.
- The abstract does not state the solver's final contest ranking or how it compared with other entries.
For security and IT teams
- Scope
- The solver is a single-file Python program relying only on the standard library, per the authors' abstract.
Sources
Source-support review completed 19 Nov 2026. This story was drafted with AI assistance and checked against retained source passages. Automated checking is not independent verification.
Coverage: arXiv: abstract.
Updates and corrections
No corrections so far.
First published 19 Nov 2026
New to the subject? AI from the Ground Up starts from the beginning.