The following pages link to VRP (Q17347):
Displaying 32 items.
- Stronger multi-commodity flow formulations of the capacitated vehicle routing problem (Q319445) (← links)
- A large neighbourhood based heuristic for two-echelon routing problems (Q342576) (← links)
- Scheduling of parallel machines with sequence-dependent batches and product incompatibilities in an automotive glass facility (Q490371) (← links)
- Optimizing departure times in vehicle routes (Q541710) (← links)
- Heuristic and exact algorithms for the multi-pile vehicle routing problem (Q657060) (← links)
- A unified heuristic for a large class of vehicle routing problems with backhauls (Q819067) (← links)
- Ant colony optimization for the two-dimensional loading vehicle routing problem (Q955597) (← links)
- An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries (Q1039783) (← links)
- An open vehicle routing problem metaheuristic for examining wide solution neighborhoods (Q1040972) (← links)
- A multi-phase constructive heuristic for the vehicle routing problem with multiple trips. (Q1417560) (← links)
- The probabilistic orienteering problem (Q1652250) (← links)
- A two-phase heuristic algorithm for the problem of scheduling and vehicle routing for delivery of medication to patients (Q1721595) (← links)
- Route relaxations on GPU for vehicle routing problems (Q1751660) (← links)
- The bi-objective stochastic covering tour problem (Q1762147) (← links)
- A continuous approximation approach to the planar hub location-routing problem: modeling and solution algorithms (Q1782170) (← links)
- Exact solutions for the collaborative pickup and delivery problem (Q1787916) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- A computational study of solution approaches for the resource constrained elementary shortest path problem (Q1945074) (← links)
- Routing a mix of conventional, plug-in hybrid, and electric vehicles (Q1991124) (← links)
- Dynamic vehicle routing with time windows in theory and practice (Q2311301) (← links)
- A branch-and-cut algorithm for the capacitated profitable tour problem (Q2339836) (← links)
- The multi-vehicle profitable pickup and delivery problem (Q2362250) (← links)
- A guided tabu search for the vehicle routing problem with two-dimensional loading constraints (Q2378414) (← links)
- Evolution-inspired local improvement algorithm solving orienteering problem (Q2399337) (← links)
- Creating very large scale neighborhoods out of smaller ones by compounding moves (Q2491337) (← links)
- Capacitated Vehicle Routing with Nonuniform Speeds (Q2800377) (← links)
- Routing Optimization Under Uncertainty (Q2806069) (← links)
- Capacitated Vehicle Routing with Non-uniform Speeds (Q3009766) (← links)
- Locating Depots for Capacitated Vehicle Routing (Q3088097) (← links)
- VERY STRONGLY CONSTRAINED PROBLEMS: AN ANT COLONY OPTIMIZATION APPROACH (Q3393492) (← links)
- Dynamic programming based metaheuristics for the dial-a-ride problem (Q5963101) (← links)
- On the shortest path problem with negative cost cycles (Q5963684) (← links)
