A GRASP for the Vehicle Routing Problem with Time Windows
From MaRDI portal
Publication:4835445
DOI10.1287/ijoc.7.1.10zbMath0822.90055OpenAlexW2090619991MaRDI QIDQ4835445
Jonathan F. Bard, George Kontoravdis
Publication date: 9 October 1995
Published in: ORSA Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.7.1.10
vehicle routinggreedy randomized adaptive search proceduretime window constraintslower bounding heuristicsminimum number of vehicles
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)
Related Items
A unified heuristic for a large class of vehicle routing problems with backhauls ⋮ A multi-start local search algorithm for the vehicle routing problem with time windows ⋮ Path inequalities for the vehicle routing problem with time windows ⋮ An effective and fast heuristic for the dial-a-ride problem ⋮ Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) ⋮ Vehicle routing with backhauls: review and research perspectives ⋮ Routing problems: A bibliography ⋮ Improved modeling and solution methods for the multi-resource routing problem ⋮ The simulated trading heuristic for solving vehicle routing problems ⋮ Metaheuristics: A bibliography ⋮ Exact Branch-Price-and-Cut for a Hospital Therapist Scheduling Problem with Flexible Service Locations and Time-Dependent Location Capacity ⋮ A sequential GRASP for the therapist routing and scheduling problem ⋮ A light‐touch routing optimization tool (RoOT) for vaccine and medical supply distribution in Mozambique ⋮ MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems ⋮ Towards a decision support system for the ready concrete distribution system: a case of a Greek company. ⋮ A heuristic algorithm for solving hazardous materials distribution problems. ⋮ Comparing backhauling strategies in vehicle routing using ant colony optimization ⋮ Challenges and Opportunities in Attended Home Delivery ⋮ City-courier routing and scheduling problems ⋮ A reactive GRASP with path relinking for capacitated clustering ⋮ A HYBRID GREEDY RANDOMIZED ADAPTIVE SEARCH HEURISTIC TO SOLVE THE DIAL-A-RIDE PROBLEM ⋮ A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment ⋮ Active guided evolution strategies for large-scale vehicle routing problems with time windows ⋮ Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem ⋮ A two-phase hybrid metaheuristic for the vehicle routing problem with time windows ⋮ Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows ⋮ Adaptive memory artificial bee colony algorithm for Green vehicle routing with cross-docking ⋮ A route-neighborhood-based metaheuristic for vehicle routing problem with time windows ⋮ Adaptive granular local search heuristic for a dynamic vehicle routing problem ⋮ Heuristics for the flow line problem with setup costs ⋮ Ant colony system for a dynamic vehicle routing problem ⋮ An approach for efficient ship routing ⋮ The multiple TSP with time windows: vehicle bounds based on precedence graphs ⋮ Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care ⋮ Metaheuristics in combinatorial optimization
