Researchers have developed a novel hybrid solver for the Integrated Passenger and Parcel Transportation problem, a complex routing challenge involving selective pickups and deliveries with time windows and heterogeneous vehicles. This solver, submitted to the SOICT 2026 contest, combines several optimization techniques including greedy insertion, local search, and an Adaptive Large Neighborhood Search (ALNS) with simulated annealing. It also incorporates an exact route-selection engine that utilizes branch-and-bound, Lagrangian bounds, and reduced-cost fixing to solve the set-packing problem, demonstrating strong performance on scored instances within strict time and memory limits. AI
IMPACT This research presents a sophisticated algorithmic approach that could inform future optimization solutions in logistics and transportation, potentially improving efficiency in real-world applications.
RANK_REASON The cluster contains a research paper detailing a new algorithm for a specific optimization problem. [lever_c_demoted from research: ic=1 ai=0.7]
- Adaptive large neighborhood search for integrated planning in railroad classification yards
- arXiv
- Hugging Face
- Integrated Passenger and Parcel Transportation problem
- Lagrange function
- Python
- simulated annealing
- SOICT 2026
AI-generated summary · Google Gemini · from 1 sources. How we write summaries →