https://github.com/raviqqe/tsppd

TSPPD with PuLP
https://github.com/raviqqe/tsppd

linear-programming python tsp

Last synced: 8 months ago
JSON representation

TSPPD with PuLP

• Host: GitHub
• URL: https://github.com/raviqqe/tsppd
• Owner: raviqqe
• License: mit
• Created: 2018-08-08T18:47:51.000Z (almost 8 years ago)
• Default Branch: master
• Last Pushed: 2019-05-28T16:25:26.000Z (about 7 years ago)
• Last Synced: 2025-03-28T00:41:18.668Z (about 1 year ago)
• Topics: linear-programming, python, tsp
• Language: Python
• Homepage:
• Size: 65.4 KB
• Stars: 0
• Watchers: 2
• Forks: 3
• Open Issues: 1
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

          
# Travelling Salesman Problem with Pickup and Delivery (TSPPD)

[![Circle CI](https://img.shields.io/circleci/project/github/raviqqe/tsppd.svg?style=flat-square)](https://circleci.com/gh/raviqqe/tsppd)

[![License](https://img.shields.io/github/license/raviqqe/tsppd.svg?style=flat-square)](LICENSE)

The solution for TSPPD with [PuLP][pulp] in Python.

## Description

The TSPPD is formulated as an integer linear programming problem with extra

constraints of pickup and delivery because each passenger needs to be picked up

before being dropped off.

As the underlying ILP solver is [CBC](https://github.com/coin-or/Cbc) used by

[PuLP][pulp], the branch-and-cut method is used for faster solution search.

## Running examples

```

python3 src/main.py

```

## License

[MIT](LICENSE)

[pulp]: https://github.com/coin-or/pulp