A constraint programming approach to the Chinese postman problem with time windows

@article{Aminu2006ACP,
  title={A constraint programming approach to the Chinese postman problem with time windows},
  author={U. F. Aminu and Richard W. Eglese},
  journal={Computers & OR},
  year={2006},
  volume={33},
  pages={3423-3431}
}
The Chinese postman problem with time windows (CPPTW) is modelled as a constraint programme and results are reported for a set of test problems with up to 69 edges. Two different formulations are proposed. The first formulation approaches the problem directly and the second transforms the problem to an equivalent vehicle routing problem with time windows. The results demonstrate that optimal solutions can be obtained quickly when the time windows are tight. However, the results also show that… CONTINUE READING