Plus court chemin avec dépendance horaire : résolution et application aux problèmes de tournées

DOI10.1051/ro/1997310201171zbMath0872.90034OpenAlexW2278778075MaRDI QIDQ4342759

Mohamed Haouari, Pierre Dejax

Publication date: 27 July 1997

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/105145

zbMATH Keywords

Lagrangian relaxationcolumn generationbranch-and-boundtime windows constraintstime dependent vehicle routingknapsack type constrainttime dependent shortest path problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)

Related Items (2)

Exact approaches for integrated aircraft fleeting and routing at TunisAir ⋮ A genetic algorithm for service level based vehicle scheduling

This page was built for publication: Plus court chemin avec dépendance horaire : résolution et application aux problèmes de tournées