A Computational Study Of A New Heuristic For The Site-Dependent Vehicle Routing Problem
From MaRDI portal
Publication:5888107
DOI10.1080/03155986.1999.11732387OpenAlexW2402516267MaRDI QIDQ5888107
Edward A. Wasil, I-Ming Chao, Bruce L. Golden
Publication date: 21 April 2023
Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03155986.1999.11732387
Related Items (15)
Thirty years of heterogeneous vehicle routing ⋮ Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems ⋮ A general heuristic for vehicle routing problems ⋮ A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem ⋮ Resource constrained routing and scheduling: review and research prospects ⋮ A rich vehicle routing problem dealing with perishable food: a case study ⋮ The sales force sizing problem with multi-period workload assignments, and service time windows ⋮ Routing a Heterogeneous Fleet of Vehicles ⋮ The line-haul feeder vehicle routing problem: mathematical model formulation and heuristic approaches ⋮ Solving the truck and trailer routing problem based on a simulated annealing heuristic ⋮ A tabu search method for the truck and trailer routing problem ⋮ A metaheuristic algorithm and structured analysis for the Line-haul Feeder vehicle routing problem with time windows ⋮ Pricing strategies for the site-dependent vehicle routing problem ⋮ Robust Optimization of a Broad Class of Heterogeneous Vehicle Routing Problems Under Demand Uncertainty ⋮ Solving a manpower scheduling problem for airline catering using metaheuristics
This page was built for publication: A Computational Study Of A New Heuristic For The Site-Dependent Vehicle Routing Problem