A greedy look-ahead heuristic for the vehicle routing problem with time windows
From MaRDI portal
Publication:4658437
DOI10.1057/palgrave.jors.2601113zbMath1114.90317OpenAlexW2069764609MaRDI QIDQ4658437
Manolis N. Kritikos, George Ioannou, Gregory P. Prastacos
Publication date: 16 March 2005
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601113
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
A multi-start local search algorithm for the vehicle routing problem with time windows ⋮ The home health care problem with working regulations ⋮ A goal programming approach to vehicle routing problems with soft time windows ⋮ REAL-LIFE VEHICLE ROUTING WITH TIME WINDOWS FOR VISUAL ATTRACTIVENESS AND OPERATIONAL ROBUSTNESS ⋮ A novel multi-objective green vehicle routing and scheduling model with stochastic demand, supply, and variable travel times ⋮ A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows ⋮ Vehicle routing problem for multiple product types, compartments, and trips with soft time windows ⋮ Reducing pollutant emissions in a waste collection vehicle routing problem using a variable neighborhood tabu search algorithm: a case study ⋮ Active guided evolution strategies for large-scale vehicle routing problems with time windows ⋮ A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems ⋮ A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows ⋮ An assignment-based heuristic for vehicle routing with time windows ⋮ The heterogeneous fleet location routing problem with simultaneous pickup and delivery and overloads
This page was built for publication: A greedy look-ahead heuristic for the vehicle routing problem with time windows
