A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for routing problems with time windows
Résumé
We propose lifted versions of the Miller-Tucker-Zemlin subtour elimination constraints for routing problems with time windows (TW). The constraints are valid for problems such as the travelling salesman problem with TW, the vehicle routing problem with TW, the generalized travelling salesman problem with TW, and the general vehicle routing problem with TW. They are corrected versions of the constraints proposed by Desrochers and Laporte (1991).
Origine : Fichiers produits par l'(les) auteur(s)
Loading...