Skip to content

The Family Traveling Salesman Problem

  • Home
  • The Problem
  • Instances
    • Benchmark instances
    • Generated instances based on asymmetric UTPP instances
    • Generated instances based on asymmetric TSP instances
    • Generated instances based on symmetric TSP instances
  • Best Known Upper Bounds
  • FTSP-IC
    • FTSP-IC instances
  • MDFTSP
    • MDFTSP instances
  • F-CVRP

MDFTSP instances

The MDFTSP instances may be downloaded from the following link:

https://www.dropbox.com/s/0752vg5imgrf1wh/Benchmark%20instances%20for%20the%20MDFTSP.zip?dl=0

 

The instances must be read in the following manner:

1st line: |N| |D| L V

2nd line: List of the number of family members (nl)

3rd line: List of the number of family visits (vl)

4th line until the end: Cost matrix (cij)

Proudly powered by WordPress