Solving a General Routing and Scheduling Problem by Chain Decomposition and Tabu Search

DOI10.1287/trsc.29.1.30zbMath0826.90044OpenAlexW2001062219MaRDI QIDQ4836838

N. R. Natraj, John N. Hooker

Publication date: 23 November 1995

Published in: Transportation Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/trsc.29.1.30

zbMATH Keywords

vehicle routingtime windowsclassical chain decomposition model

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Related Items (5)

A robust strategy approach to a strategic mobility problem ⋮ Routing problems: A bibliography ⋮ Metaheuristics: A bibliography ⋮ Mixed logical-linear programming ⋮ The multiple TSP with time windows: vehicle bounds based on precedence graphs

This page was built for publication: Solving a General Routing and Scheduling Problem by Chain Decomposition and Tabu Search