The following pages link to (Q3048611):
Displaying 50 items.
- Routing problems: A bibliography (Q1908308) (← links)
- The simulated trading heuristic for solving vehicle routing problems (Q1917260) (← links)
- Probabilistic diversification and intensification in local search for vehicle routing (Q1922635) (← links)
- Self-organizing maps in population based metaheuristic to the dynamic vehicle routing problem (Q1928502) (← links)
- MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems (Q1948529) (← links)
- A hybrid algorithm based on ACO and PSO for capacitated vehicle routing problems (Q1955120) (← links)
- Algorithms and codes for dense assignment problems: The state of the art (Q1962018) (← links)
- Cooperative versus non-cooperative parallel variable neighborhood search strategies: a case study on the capacitated vehicle routing problem (Q2022213) (← links)
- Bin packing problem with conflicts and item fragmentation (Q2026980) (← links)
- The split heterogeneous vehicle routing problem with three-dimensional loading constraints on a large scale (Q2077944) (← links)
- The multiple traveling salesman problem in presence of drone- and robot-supported packet stations (Q2098034) (← links)
- A cumulative unmanned aerial vehicle routing problem approach for humanitarian coverage path planning (Q2116920) (← links)
- Collection of different types of milk with multi-tank tankers under uncertainty: a real case study (Q2121608) (← links)
- Vehicle routing for milk collection with gradual blending: a case arising in Chile (Q2160533) (← links)
- A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem (Q2178077) (← links)
- Optimal a priori tour and restocking policy for the single-vehicle routing problem with stochastic demands (Q2183324) (← links)
- A generic exact solver for vehicle routing and related problems (Q2196312) (← links)
- A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem (Q2240058) (← links)
- On the minimum clique partitioning problem on weighted chordal graphs (Q2272395) (← links)
- A lexicographic minimax approach to the vehicle routing problem with route balancing (Q2282498) (← links)
- The split delivery vehicle routing problem with three-dimensional loading constraints (Q2282545) (← links)
- Two-level vehicle routing with cross-docking in a three-echelon supply chain: a genetic algorithm approach (Q2285830) (← links)
- A hybrid reactive GRASP heuristic for the risk-averse \(k\)-traveling repairman problem with profits (Q2289922) (← links)
- Solving the vehicle routing problem with multi-compartment vehicles for city logistics (Q2289931) (← links)
- Bilayer local search enhanced particle swarm optimization for the capacitated vehicle routing problem (Q2331412) (← links)
- A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints (Q2339816) (← links)
- A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem (Q2340494) (← links)
- A heuristic algorithm to solve the single-facility location routing problem on Riemannian surfaces (Q2355716) (← links)
- An effective PSO-inspired algorithm for the team orienteering problem (Q2355862) (← links)
- A matheuristic for the truck and trailer routing problem (Q2355939) (← links)
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem (Q2367016) (← links)
- Planning and approximation models for delivery route based services with price-sensitive demands (Q2370367) (← links)
- A variable neighbourhood search algorithm for the open vehicle routing problem (Q2378421) (← links)
- Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier (Q2422737) (← links)
- Heuristics for the lexicographic Max-ordering vehicle routing problem (Q2461267) (← links)
- Operations research at container terminals: a literature update (Q2480797) (← links)
- Very large-scale vehicle routing: new test problems, algorithms, and results (Q2485169) (← links)
- Creating very large scale neighborhoods out of smaller ones by compounding moves (Q2491337) (← links)
- Enhanced savings calculation and its applications for solving capacitated vehicle routing problem (Q2511703) (← links)
- A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem (Q2514732) (← links)
- A memetic algorithm for the multi trip vehicle routing problem (Q2514735) (← links)
- A unified solution framework for multi-attribute vehicle routing problems (Q2514767) (← links)
- Implicit depot assignments and rotations in vehicle routing heuristics (Q2514807) (← links)
- A new ILP-based refinement heuristic for vehicle routing problems (Q2583137) (← links)
- A survey of variants and extensions of the location-routing problem (Q2629668) (← links)
- A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit (Q2630092) (← links)
- Mathematical formulations for a 1-full-truckload pickup-and-delivery problem (Q2630253) (← links)
- The exponential multi-insertion neighborhood for the vehicle routing problem with unit demands (Q2664291) (← links)
- A review of vehicle routing with simultaneous pickup and delivery (Q2664320) (← links)
