On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints
From MaRDI portal
Publication:3783831
DOI10.1002/net.3230160205zbMath0642.90058OpenAlexW2046806484MaRDI QIDQ3783831
Publication date: 1986
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230160205
Related Items (13)
A new formulation approach for location-routing problems ⋮ A column generation approach for a multi-attribute vehicle routing problem ⋮ Routing problems: A bibliography ⋮ Probabilistic Analysis of a Vehicle Routing Problem with Time Windows ⋮ Minimizing earliness-tardiness costs in supplier networks -- a just-in-time truck routing problem ⋮ A framing link based tabu search algorithm for large-scale multidepot vehicle routing problems ⋮ Minimizing customers' waiting time in a vehicle routing problem with unit demands ⋮ Crane scheduling with time windows in circuit board production lines ⋮ Part logistics in the automotive industry: decision problems, literature review and research agenda ⋮ Practical aspects of route planning for magazine and newspaper wholesalers ⋮ Heuristic methods and applications: A categorized survey ⋮ The multiple TSP with time windows: vehicle bounds based on precedence graphs ⋮ Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks
This page was built for publication: On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints
