nitrazepam01

nitrazepam01 / 2EVRPD-BCP-JAVA-Gurobi

Public

Java/Gurobi reproduction of a branch-cut-and-price algorithm for the two-echelon vehicle routing problem with drones.

10
0
100% credibility
Found May 12, 2026 at 10 stars -- GitGems finds repos before they trend. Get early access to the next one.
Sign Up Free
AI Analysis
Java
AI Summary

An open-source solver for optimizing truck and drone delivery routes in two-echelon problems, reproducing a research paper's algorithm with verified benchmark results.

How It Works

1
🔍 Discover the delivery optimizer

You find a tool that finds the best ways for trucks and drones to deliver packages together, matching top research results.

2
🛠️ Prepare your setup

Install free Java software and a math solver like Gurobi on your computer.

3
🔗 Connect the solver

Tell the tool where your math solver is located so it can use its power.

4
📁 Pick a delivery challenge

Choose one of the included example problems with customers, trucks, and drones.

5
🚀 Launch the optimizer

Click to run it with your preferred time limit, and watch it crunch numbers to plan perfect routes.

6
📊 Review the results

See the exact total delivery cost and route details, close to the research paper's benchmarks.

✅ Perfect routes achieved

Celebrate having solved your delivery puzzle exactly, ready for research or learning.

Sign up to see the full architecture

5 more

Sign Up Free

Star Growth

See how this repo grew from 10 to 10 stars Sign Up Free
Repurpose This Repo

Repurpose is a Pro feature

Generate ready-to-use prompts for X threads, LinkedIn posts, blog posts, YouTube scripts, and more -- with full repo context baked in.

Unlock Repurpose
AI-Generated Review

What is 2EVRPD-BCP-JAVA-Gurobi?

This Java project implements a branch-cut-and-price algorithm to exactly solve the two-echelon vehicle routing problem with drones (2EVRPD), optimizing truck-drone fleets for logistics where trucks handle satellite hubs and drones do last-mile delivery. Using Gurobi as the MIP solver, it tackles hard routing instances from the Cardiff benchmarks, delivering proven optimal solutions up to 25 customers. Run it via simple batch scripts on your instances with tunable time limits and parameters like column counts or pricing labels.

Why is it gaining traction?

It stands out as a clean, independent reproduction of a recent research paper's BCP algorithm, matching audited results like 1223.62 for Cardiff10_01 exactly—rare for exact drone routing solvers. Developers get configurable heuristics, stabilization, and proof-oriented pricing without black-box services, plus batch benchmarking for quick validation. The focus on educational reproducibility hooks ops research folks tired of unverified claims.

Who should use this?

Operations research students or academics reproducing 2EVRPD paper results on standard benchmarks. Logistics engineers prototyping exact truck-drone optimization for small-to-medium fleets (10-25 stops). Java devs in supply chain needing a Gurobi-based baseline before scaling to heuristics.

Verdict

Grab it if you're deep into exact vehicle routing with drones—verified benchmarks and solid docs outweigh the 10 stars and 1.0% credibility score. Still early maturity, so expect tweaks for larger instances.

(198 words)

Sign up to read the full AI review Sign Up Free

Similar repos coming soon.