Pages that link to "Item:Q1922635"
From MaRDI portal
The following pages link to Probabilistic diversification and intensification in local search for vehicle routing (Q1922635):
Displaying 50 items.
- An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: application to the MDPVRP (Q319782) (← links)
- Thirty years of heterogeneous vehicle routing (Q320861) (← links)
- Large neighborhood search for multi-trip vehicle routing (Q323545) (← links)
- A hybrid algorithm for a class of vehicle routing problems (Q336559) (← links)
- A hybrid data mining GRASP with path-relinking (Q336726) (← links)
- Statistical analysis of distance-based path relinking for the capacitated vehicle routing problem (Q336737) (← links)
- An adaptive large neighborhood search for a vehicle routing problem with multiple routes (Q336781) (← links)
- A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows (Q337225) (← links)
- A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading (Q337617) (← links)
- A decomposition based memetic algorithm for multi-objective vehicle routing problem with time windows (Q337630) (← links)
- Vehicle routing problem with stochastic travel times including soft time windows and service costs (Q339568) (← links)
- A multi-space sampling heuristic for the vehicle routing problem with stochastic demands (Q375990) (← links)
- Heuristics for a project management problem with incompatibility and assignment costs (Q429511) (← links)
- Optimised crossover genetic algorithm for capacitated vehicle routing problem (Q438026) (← links)
- Single vehicle routing problems with a predefined customer sequence, compartmentalized load and stochastic demands (Q439377) (← links)
- Adaptive memory in multistart heuristics for multicommodity network design (Q535395) (← links)
- Optimizing departure times in vehicle routes (Q541710) (← links)
- DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic (Q604947) (← links)
- A hybrid search method for the vehicle routing problem with time windows (Q613770) (← links)
- A tabu search algorithm for the open vehicle routing problem (Q703907) (← links)
- Greedy random adaptive memory programming search for the capacitated clustering problem (Q707129) (← links)
- A library of local search heuristics for the vehicle routing problem (Q708775) (← links)
- A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem (Q709119) (← links)
- Multiterminal net assignments by scatter search (Q814239) (← links)
- Metaheuristics in combinatorial optimization (Q817206) (← links)
- Graph colouring approaches for a satellite range scheduling problem (Q835607) (← links)
- Computing nine new best-so-far solutions for capacitated VRP with a cellular genetic algorithm (Q844205) (← links)
- Computing the metric dimension of graphs by genetic algorithms (Q849088) (← links)
- Adaptive memory programming for the vehicle routing problem with multiple trips (Q850308) (← links)
- The multi-depot vehicle routing problem with inter-depot routes (Q852937) (← links)
- A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows (Q858260) (← links)
- A flexible adaptive memory-based algorithm for real-life transportation operations: two case studies from dairy and construction sector (Q863996) (← links)
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems (Q875422) (← links)
- Active-guided evolution strategies for large-scale capacitated vehicle routing problems (Q878570) (← links)
- A GA based heuristic for the vehicle routing problem with multiple trips (Q928681) (← links)
- A neural-tabu search heuristic for the real time vehicle routing problem (Q928694) (← links)
- Scatter search for the fleet size and mix vehicle routing problem with time windows (Q940820) (← links)
- EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem (Q953302) (← links)
- Honey bees mating optimization algorithm for large scale vehicle routing problems (Q968387) (← links)
- A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery (Q976005) (← links)
- Industrial aspects and literature survey: fleet composition and routing (Q991360) (← links)
- A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem (Q1014948) (← links)
- Adaptive granular local search heuristic for a dynamic vehicle routing problem (Q1025242) (← links)
- An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries (Q1039783) (← links)
- Solving a manpower scheduling problem for airline catering using metaheuristics (Q1041027) (← links)
- Scatter search for a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries in Brazil (Q1042225) (← links)
- General local search methods (Q1268283) (← links)
- Planning models for freight transportation (Q1278638) (← links)
- An adaptive memory heuristic for a class of vehicle routing problems with minmax objective (Q1362944) (← links)
- Local search with annealing-like restarts to solve the VRPTW (Q1400662) (← links)
