A Two-Stage Heuristic with Ejection Pools and Generalized Ejection Chains for the Vehicle Routing Problem with Time Windows
From MaRDI portal
Publication:2892357
DOI10.1287/ijoc.1060.0186zbMath1241.90051MaRDI QIDQ2892357
Andrew E. B. Lim, Xingwen Zhang
Publication date: 18 June 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.1060.0186
90B06: Transportation, logistics and supply chain management
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
Related Items
Recent progress of local search in handling the time window constraints of the vehicle routing problem, Recent progress of local search in handling the time window constraints of the vehicle routing problem, On service consistency in multi-period vehicle routing, A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints, The vehicle-routing problem with time windows and driver-specific times, A knowledge-based evolutionary algorithm for the multiobjective vehicle routing problem with time windows, A tabu search algorithm for the multi-period inspector scheduling problem, A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows, An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows, Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem, A vehicle routing problem with pickup and delivery time windows, and coordination of transportable resources, A powerful route minimization heuristic for the vehicle routing problem with time windows, A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows, A guided local search with iterative ejections of bottleneck operations for the job shop scheduling problem, Designing granular solution methods for routing problems with time windows, Vehicle routing with arrival time diversification, Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints
Uses Software
