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):
Displayed 50 items.
- 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)
- 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)
- 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)
- 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)
- Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies. (Q1406947) (← links)
- A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem. (Q1410330) (← links)
- Solving a fuel delivery problem by heuristic and exact approaches. (Q1410332) (← links)
- Guidelines for the use of meta-heuristics in combinatorial optimization. (Q1410607) (← links)
- Combination of geographical information system and efficient routing algorithms for real life distribution operations. (Q1412749) (← links)
- A multi-phase constructive heuristic for the vehicle routing problem with multiple trips. (Q1417560) (← links)
- D-Ants: Savings Based Ants divide and conquer the vehicle routing problem. (Q1427099) (← links)
- A framework for the description of evolutionary algorithms (Q1584807) (← links)
- Search strategies for the feeder bus network design problem (Q1609905) (← links)
- Proposals for chunking and tabu search (Q1609920) (← links)
- Use of the BATA algorithm and MIS to solve the mail carrier problem (Q1614192) (← links)
- A TABU search heuristic for the team orienteering problem (Q1764755) (← links)
- Active guided evolution strategies for large-scale vehicle routing problems with time windows (Q1764768) (← links)
- A heuristic algorithm for the truckload and less-than-truckload problem (Q1771352) (← links)
- Solving the vehicle routing problem with adaptive memory programming methodology (Q1772865) (← links)
- A cooperative parallel meta-heuristic for the vehicle routing problem with time windows (Q1777146) (← links)
- A route-neighborhood-based metaheuristic for vehicle routing problem with time windows (Q1806612) (← links)
- Vehicle routing problem with time windows and a limited number of vehicles. (Q1812003) (← links)
- On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem (Q1847167) (← links)
- Diversification strategies in local search for a nonbifurcated network loading problem (Q1848356) (← links)
- A sweep-based algorithm for the fleet size and mix vehicle routing problem (Q1848592) (← links)
- A tabu search heuristic and adaptive memory procedure for political districting (Q1869686) (← links)
- A visual interactive approach to vehicle routing (Q1869906) (← links)
- A genetic algorithm for the vehicle routing problem (Q1870833) (← links)
- Tabu search heuristics for the vehicle routing problem with time windows. (Q1871417) (← links)