Pages that link to "Item:Q2884564"
From MaRDI portal
The following pages link to A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows (Q2884564):
Displaying 50 items.
- Modelization of time-dependent urban freight problems by using a multiple number of distribution centers (Q262919) (← links)
- The vehicle-routing problem with time windows and driver-specific times (Q322409) (← links)
- A knowledge-based evolutionary algorithm for the multiobjective vehicle routing problem with time windows (Q336957) (← links)
- Variable neighborhood search for location routing (Q339539) (← links)
- A bi-objective approach for scheduling ground-handling vehicles in airports (Q342334) (← links)
- Ambulance location and relocation problems with time-dependent travel times (Q613443) (← links)
- Heuristic and exact algorithms for the multi-pile vehicle routing problem (Q657060) (← links)
- Heuristics for the multi-period orienteering problem with multiple time windows (Q732904) (← links)
- An integrated approach to the vehicle routing and container loading problems (Q841582) (← links)
- Delivery strategies for blood products supplies (Q841585) (← links)
- The vehicle routing problem with flexible time windows and traveling times (Q860386) (← links)
- Scheduling periodic customer visits for a traveling salesperson (Q863999) (← links)
- A general heuristic for vehicle routing problems (Q869003) (← links)
- An iterated local search algorithm for the vehicle routing problem with convex time penalty functions (Q943841) (← links)
- An iterated local search algorithm for the time-dependent vehicle routing problem with time windows (Q951117) (← links)
- A variable neighborhood search for the capacitated arc routing problem with intermediate facilities (Q953311) (← links)
- A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows (Q953316) (← links)
- Variable neighbourhood search: methods and applications (Q970194) (← links)
- An adaptive memory algorithm for the split delivery vehicle routing problem (Q972645) (← links)
- Adaptive granular local search heuristic for a dynamic vehicle routing problem (Q1025242) (← links)
- Variable neighbourhood search: Methods and applications (Q1029572) (← links)
- A tabu search algorithm for scheduling pharmaceutical packaging operations (Q1039804) (← links)
- Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer (Q1634057) (← links)
- A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups (Q1652352) (← links)
- Designing granular solution methods for routing problems with time windows (Q1694925) (← links)
- Active guided evolution strategies for large-scale vehicle routing problems with time windows (Q1764768) (← links)
- A cooperative parallel meta-heuristic for the vehicle routing problem with time windows (Q1777146) (← links)
- Variable neighbourhood structures for cycle location problems (Q1926979) (← links)
- A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times (Q1935881) (← links)
- A vehicle routing problem with distribution uncertainty in deadlines (Q2030574) (← links)
- Ant colony system with characterization-based heuristics for a bottled-products distribution logistics system (Q2349706) (← links)
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
- Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach (Q2370333) (← links)
- Dynamic vehicle routing using an improved variable neighborhood search algorithm (Q2375629) (← links)
- A web-based decision support system for waste lube oils collection and recycling (Q2378411) (← links)
- A variable neighborhood search heuristic for periodic routing problems (Q2378420) (← links)
- A variable neighbourhood search algorithm for the open vehicle routing problem (Q2378421) (← links)
- Learning variable neighborhood search for a scheduling problem with time windows and rejections (Q2414479) (← links)
- New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP (Q2466786) (← links)
- Exact and heuristic algorithms for the vehicle routing problem with multiple interdependent time windows (Q2475859) (← links)
- A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems (Q2488912) (← links)
- A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows (Q2506187) (← links)
- An Investigation on Compound Neighborhoods for VRPTW (Q2980168) (← links)
- Competition and Cooperation in Pickup and Multiple Delivery Problems (Q2980177) (← links)
- Robust Data-Driven Vehicle Routing with Time Windows (Q4994169) (← links)
- Simulation on vehicle routing problems in logistics distribution (Q5189835) (← links)
- New Notation and Classification Scheme for Vehicle Routing Problems (Q5247680) (← links)
- Recent progress of local search in handling the time window constraints of the vehicle routing problem (Q5893964) (← links)
- Recent progress of local search in handling the time window constraints of the vehicle routing problem (Q5919996) (← links)
- Variable neighborhood search for the stochastic and dynamic vehicle routing problem (Q5963105) (← links)