pickup-delivery-problem

Optimize vehicle routes for paired pickup and delivery tasks with constraints.

56|16|Updated Oct 18, 2025

Search Tags:#routing #optimization #logistics #OR-Tools #pickup and delivery #VRPPD

Ready to run

npx skills add https://github.com/kishorkukreja/awesome-supply-chain --skill pickup-delivery-problem

💬 Prompt for ChatGPT / Claude Chat▼

Please help me install this Agent Skill.
Skill: pickup-delivery-problem
Source: https://github.com/kishorkukreja/awesome-supply-chain/tree/main/skills/pickup-delivery-problem
Command: npx skills add https://github.com/kishorkukreja/awesome-supply-chain --skill pickup-delivery-problem

SYSTEM DOCUMENTATION & REQUIREMENTS

💡 This Skill requires numpy, ortools, and includes scripts (resource) and references (resource) components.

What problem does it solve?

This Skill solves complex routing challenges for vehicles that need to pick up items or passengers and then deliver them, ensuring all constraints are met efficiently.

Core Features & Use Cases

Paired Routing: Handles requests where a pickup must be matched with a specific delivery.
Constraint Management: Incorporates time windows, vehicle capacity, and precedence rules.
Use Case: A courier service needs to pick up packages from multiple locations and deliver them to various destinations within specific time frames, optimizing the routes for their fleet of vans.

Quick Start

Use the pickup-delivery-problem skill to find optimal routes for a set of pickup and delivery requests with given time windows and vehicle capacities.

Frequently Asked Questions about pickup-delivery-problem

High-intent search queries and answers about installing and using this skill.

FAQPage Schema

How do I optimize pickup and delivery routes with time windows and vehicle capacity constraints?▼

OR-Tools handles pickup and delivery routing by applying mathematical formulations and insertion heuristics. It enforces precedence rules ensuring pickups occur before deliveries, while simultaneously optimizing time windows and vehicle capacity constraints for the fleet.

Can OR-Tools solve paired pickup and delivery routing for courier services?▼

OR-Tools solves paired pickup and delivery routing for courier services by applying insertion heuristics to optimize fleet routes. It matches specific pickup locations with their corresponding deliveries while strictly enforcing capacity limits and time window constraints.

What is the difference between PDP and VRPPD in logistics optimization?▼

PDP focuses on optimizing paired pickup and delivery tasks, while VRPPP extends this to optimize routing across an entire vehicle fleet. Both address precedence, capacity, and time window constraints to generate efficient logistics solutions.

What are the limitations of using insertion heuristics for pickup and delivery routing?▼

Insertion heuristics construct pickup and delivery routes sequentially, offering fast solutions but no guarantee of global optimality. They may struggle to find feasible solutions in highly constrained scenarios involving extremely tight time windows and strict vehicle capacity limits.

Do I need numpy and OR-Tools to set up a pickup and delivery routing optimization?▼

You need numpy and OR-Tools to set up pickup and delivery routing optimization. These dependencies provide the mathematical formulations and constraint programming algorithms required to solve VRPPD scenarios with capacity and time window constraints.