A C code solving the Traveling salesman problem with time windows using Dynamic Programming. Both objective functions (makespan and travel times) are taken into account.
If you are using this code in your work, we would appreciate a citation to the following paper.
@inproceedings{rifki2021asymptotic,
title={An asymptotic approximation of the traveling salesman problem with uniform non-overlapping time windows},
author={Rifki, Omar and Garaix, Thierry and Solnon, Christine},
booktitle={2021 IEEE 17th International Conference on Automation Science and Engineering (CASE)},
pages={983--988},
year={2021},
organization={IEEE}
}