Michel Gendreau
, Manuel Iori, Gilbert Laporte et Silvaro Martello
Article de revue (2007)
Document publié alors que les auteurs ou autrices n'étaient pas affiliés à Polytechnique Montréal
Un lien externe est disponible pour ce document
Abstract
This article addresses the well-known Capacitated Vehicle Routing Problem (CVRP), in the special case where the demand of a customer consists of a certain number of two-dimensional weighted items. The problem calls for the minimization of the cost of transportation needed for the delivery of the goods demanded by the customers, and carried out by a fleet of vehicles based at a central depot. In order to accommodate all items on the vehicles, a feasibility check of the two-dimensional packing (2L) must be executed on each vehicle. The overall problem, denoted as 2L-CVRP, is NP-hard and particularly difficult to solve in practice. We propose a Tabu Search algorithm, in which the loading component of the problem is solved through heuristics, lower bounds, and a truncated branch-and-bound procedure. The effectiveness of the algorithm is demonstrated through extensive computational experiments.
Mots clés
| Matériel d'accompagnement: | |
|---|---|
| Département: | Département de mathématiques et de génie industriel |
| Centre de recherche: | CIRRELT - Centre interuniversitaire de recherche sur les réseaux d'entreprise, la logistique et le transport |
| Organismes subventionnaires: | Ministero dell’Istruzione, dell’Università e dellaRicerca (MIUR), Consiglio Nazionale delle Ricerche (CNR), Natural Sciences and Engineering Research Council of Canada (NSERC) |
| Numéro de subvention: | OPG0038816, OPG0039682 |
| URL de PolyPublie: | https://publications.polymtl.ca/74886/ |
| Titre de la revue: | Networks (vol. 51, no 1) |
| Maison d'édition: | Wiley |
| DOI: | 10.1002/net.20192 |
| URL officielle: | https://doi.org/10.1002/net.20192 |
| Date du dépôt: | 04 août 2026 09:49 |
| Dernière modification: | 16 sept. 2026 09:34 |
| Citer en APA 7: | Gendreau, M., Iori, M., Laporte, G., & Martello, S. (2007). A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints. Networks, 51(1), 4-18. https://doi.org/10.1002/net.20192 |
|---|---|
Statistiques
Dimensions
Actions réservées au personnel
|
Afficher document |
