The following pages link to (Q4365135):
Displaying 50 items.
- Metaheuristics for the risk-constrained cash-in-transit vehicle routing problem (Q319379) (← links)
- A bi-objective home care scheduling problem: analyzing the trade-off between costs and client inconvenience (Q320696) (← links)
- The vehicle-routing problem with time windows and driver-specific times (Q322409) (← links)
- The electric fleet size and mix vehicle routing problem with time windows and recharging stations (Q323018) (← links)
- A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows (Q339607) (← links)
- Hybridized evolutionary local search algorithm for the team orienteering problem with time windows (Q415560) (← links)
- DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic (Q604947) (← links)
- Securing home health care in times of natural disasters (Q647524) (← links)
- A library of local search heuristics for the vehicle routing problem (Q708775) (← links)
- Control abstractions for local search (Q816678) (← links)
- An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup (Q833542) (← links)
- Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery (Q850302) (← links)
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems (Q875422) (← links)
- A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows (Q953316) (← links)
- Ant colony optimization for the two-dimensional loading vehicle routing problem (Q955597) (← links)
- An effective memetic algorithm for the cumulative capacitated vehicle routing problem (Q975996) (← links)
- A powerful route minimization heuristic for the vehicle routing problem with time windows (Q1038101) (← links)
- A hybrid evolution strategy for the open vehicle routing problem (Q1038279) (← links)
- Hybridization of very large neighborhood search for ready-mixed concrete delivery problems (Q1038296) (← links)
- Metaheuristics for vehicle routing problems with three-dimensional loading constraints (Q1038331) (← links)
- A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows (Q1040973) (← links)
- A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls (Q1124810) (← links)
- Designing granular solution methods for routing problems with time windows (Q1694925) (← links)
- A simultaneous facility location and vehicle routing problem arising in health care logistics in the Netherlands (Q1754370) (← links)
- A heuristic algorithm for the truckload and less-than-truckload problem (Q1771352) (← links)
- A cooperative parallel meta-heuristic for the vehicle routing problem with time windows (Q1777146) (← links)
- Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows (Q1788902) (← links)
- A heuristic approach to the overnight security service problem (Q1868811) (← links)
- The team orienteering problem with time windows: an LP-based granular variable neighborhood search (Q1926697) (← links)
- A simple and effective metaheuristic for the minimum latency problem (Q1926884) (← links)
- Reducing pollutant emissions in a waste collection vehicle routing problem using a variable neighborhood tabu search algorithm: a case study (Q2001870) (← links)
- Bicriteria vehicle routing problem with preferences and timing constraints in home health care services (Q2005550) (← links)
- Time-dependent stochastic vehicle routing problem with random requests: application to online police patrol management in Brussels (Q2030456) (← links)
- On the one-to-one pickup-and-delivery problem with time windows and trailers (Q2051215) (← links)
- A hybrid algorithm for the vehicle routing problem with and/or precedence constraints and time windows (Q2147032) (← links)
- An efficient optimisation procedure for the workforce scheduling and routing problem: Lagrangian relaxation and iterated local search (Q2147119) (← links)
- The prisoner transportation problem (Q2178139) (← links)
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
- A variable neighborhood search heuristic for periodic routing problems (Q2378420) (← links)
- Multi-ant colony system (MACS) for a vehicle routing problem with backhauls (Q2378454) (← links)
- Time dependent vehicle routing problem with a multi ant colony system (Q2464200) (← links)
- Sequential search and its application to vehicle-routing problems (Q2489298) (← links)
- A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints (Q2503082) (← links)
- A unified solution framework for multi-attribute vehicle routing problems (Q2514767) (← links)
- Implicit depot assignments and rotations in vehicle routing heuristics (Q2514807) (← links)
- An iterated local search algorithm for the vehicle routing problem with backhauls (Q2514876) (← links)
- Fast local search algorithms for the handicapped persons transportation problem (Q2573013) (← links)
- A new constraint programming model and a linear programming-based adaptive large neighborhood search for the vehicle routing problem with synchronization constraints (Q2664428) (← links)
- In-depth analysis of granular local search for capacitated vehicle routing (Q2686133) (← links)
- What you should know about the vehicle routing problem (Q3499286) (← links)
