A note on the lifted Miller-Tucker-Zemlin ...
Type de document :
Compte-rendu et recension critique d'ouvrage
Titre :
A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for routing problems with time windows
Auteur(s) :
Yuan, Yuan [Auteur]
Integrated Optimization with Complex Structure [INOCS]
Cattaruzza, Diego [Auteur]
Integrated Optimization with Complex Structure [INOCS]
Ogier, Maxime [Auteur]
Integrated Optimization with Complex Structure [INOCS]
SEMET, Frédéric [Auteur]
Integrated Optimization with Complex Structure [INOCS]
Integrated Optimization with Complex Structure [INOCS]
Cattaruzza, Diego [Auteur]
Integrated Optimization with Complex Structure [INOCS]
Ogier, Maxime [Auteur]
Integrated Optimization with Complex Structure [INOCS]
SEMET, Frédéric [Auteur]
Integrated Optimization with Complex Structure [INOCS]
Titre de la revue :
Operations Research Letters
Pagination :
167-169
Éditeur :
Elsevier
Date de publication :
2020-03
ISSN :
0167-6377
Mot(s)-clé(s) en anglais :
Miller-Tucker-Zemlin
subtour elimination constraints
routing problems
time windows
subtour elimination constraints
routing problems
time windows
Discipline(s) HAL :
Informatique [cs]/Recherche opérationnelle [cs.RO]
Résumé en anglais : [en]
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, ...
Lire la suite >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).Lire moins >
Lire la suite >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).Lire moins >
Langue :
Anglais
Vulgarisation :
Non
Collections :
Source :
Fichiers
- https://hal.archives-ouvertes.fr/hal-02947086/document
- Accès libre
- Accéder au document
- https://hal.archives-ouvertes.fr/hal-02947086/document
- Accès libre
- Accéder au document
- https://hal.archives-ouvertes.fr/hal-02947086/document
- Accès libre
- Accéder au document
- document
- Accès libre
- Accéder au document
- MTZ_VRPTW.pdf
- Accès libre
- Accéder au document
- MTZ_VRPTW.pdf
- Accès libre
- Accéder au document