The following pages link to (Q4955265):
Displaying 50 items.
- Consolidating home meal delivery with limited operational disruption (Q319069) (← links)
- Battery swap station location-routing problem with capacitated electric vehicles (Q337428) (← links)
- Hybrid metaheuristics for the clustered vehicle routing problem (Q337513) (← links)
- Optimised crossover genetic algorithm for capacitated vehicle routing problem (Q438026) (← links)
- A fast tabu search implementation for large asymmetric traveling salesman problems defined on sparse graphs (Q505141) (← links)
- Heuristic and exact algorithms for a min-max selective vehicle routing problem (Q622161) (← links)
- Models, relaxations and exact approaches for the capacitated vehicle routing problem (Q697581) (← links)
- A library of local search heuristics for the vehicle routing problem (Q708775) (← links)
- Computing nine new best-so-far solutions for capacitated VRP with a cellular genetic algorithm (Q844205) (← links)
- A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows (Q853026) (← links)
- Applying the attribute based hill climber heuristic to the vehicle routing problem (Q856266) (← links)
- A general heuristic for vehicle routing problems (Q869003) (← links)
- A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem (Q875419) (← links)
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems (Q875422) (← links)
- The open vehicle routing problem: algorithms, large-scale test problems, and computational results (Q878563) (← links)
- Active-guided evolution strategies for large-scale capacitated vehicle routing problems (Q878570) (← 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)
- On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm (Q976404) (← links)
- A tabu search heuristic for the vehicle routing problem with private fleet and common carrier (Q1026772) (← links)
- D-Ants: Savings Based Ants divide and conquer the vehicle routing problem. (Q1427099) (← links)
- An integration of Lagrangian split and VNS: the case of the capacitated vehicle routing problem (Q1652121) (← links)
- An iterated tabu search for the multi-compartment vehicle routing problem (Q1652237) (← links)
- A fast two-level variable neighborhood search for the clustered vehicle routing problem (Q1652293) (← links)
- Large-scale vehicle routing problems: quantum annealing, tunings and results (Q1652398) (← links)
- Stochastic local search with learning automaton for the swap-body vehicle routing problem (Q1652446) (← links)
- An efficient implementation of a static move descriptor-based local search heuristic (Q1652594) (← links)
- A problem-reduction evolutionary algorithm for solving the capacitated vehicle routing problem (Q1664832) (← links)
- Designing sustainable mid-haul logistics networks with intra-route multi-resource facilities (Q1681274) (← links)
- What makes a VRP solution good? The generation of problem-specific knowledge for heuristics (Q1734855) (← links)
- Efficiently solving very large-scale routing problems (Q1738815) (← links)
- New benchmark instances for the capacitated vehicle routing problem (Q1752871) (← links)
- Large multiple neighborhood search for the clustered vehicle-routing problem (Q1754733) (← links)
- An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem (Q1762031) (← links)
- Development of a fuel consumption optimization model for the capacitated vehicle routing problem (Q1762131) (← links)
- A TABU search heuristic for the team orienteering problem (Q1764755) (← 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 dynamic vehicle routing problem with time-dependent travel times (Q1781571) (← links)
- A simple and effective evolutionary algorithm for the vehicle routing problem (Q1879785) (← links)
- An adaptive VNS algorithm for vehicle routing problems with intermediate stops (Q2018107) (← links)
- Cooperative versus non-cooperative parallel variable neighborhood search strategies: a case study on the capacitated vehicle routing problem (Q2022213) (← links)
- A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem (Q2178077) (← links)
- A PSO based algorithm with an efficient optimal split procedure for the multiperiod vehicle routing problem with profit (Q2196083) (← links)
- A branch-and-cut algorithm for the soft-clustered vehicle-routing problem (Q2208364) (← links)
- A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem (Q2240058) (← links)
- A multi-objective vehicle routing and scheduling problem with uncertainty in customers' request and priority (Q2251139) (← links)
- A cooperative parallel metaheuristic for the capacitated vehicle routing problem (Q2257342) (← links)
- Exact solution of the soft-clustered vehicle-routing problem (Q2272311) (← links)
- A new efficient approach for solving the capacitated vehicle routing problem using the gravitational emulation local search algorithm (Q2294011) (← links)
