Skip to content

This repository contains a Python notebook implementing a class for solving multiple Traveling Salesman Problems (TSP) using Pyomo and the CPLEX solver. The class includes a solution for the simple TSP scenario when there is only one driver.

Notifications You must be signed in to change notification settings

parsakhavarinejad/TSP_optimization

Repository files navigation

TSP_optimization

Overview

This repository provides a Python notebook with a class for solving Traveling Salesman Problems (TSP) using Pyomo and the CPLEX solver. The implemented class handles multiple TSP instances, and in the case where there is only one driver, it efficiently solves a simple TSP problem.

Requirements

  • Pyomo
  • IBM CPLEX solver
  • Python 3.x

Usage

  1. Install the required dependencies.
    pip install pyomo
    # Ensure you have IBM CPLEX installed on your laptop
  2. Open the notebook and run the cells to see the TSP problem-solving in action.
  3. Customize the class and parameters based on your specific TSP scenarios.

Feel free to contribute, report issues, or suggest improvements!

About

This repository contains a Python notebook implementing a class for solving multiple Traveling Salesman Problems (TSP) using Pyomo and the CPLEX solver. The class includes a solution for the simple TSP scenario when there is only one driver.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published