Pages that link to "Item:Q336559"

The following pages link to A hybrid algorithm for a class of vehicle routing problems (Q336559):

Displaying 50 items.

• Rich vehicle routing problems: from a taxonomy to a definition (Q299767) (← links)
• A matheuristic approach for the pollution-routing problem (Q319140) (← links)
• An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints (Q322469) (← links)
• The vehicle routing problem with simultaneous pick-ups and deliveries and two-dimensional loading constraints (Q322687) (← links)
• Shipper collaboration in forward and reverse logistics (Q781076) (← links)
• A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen (Q1617109) (← links)
• Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer (Q1634057) (← links)
• An iterated tabu search for the multi-compartment vehicle routing problem (Q1652237) (← links)
• An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen (Q1652283) (← links)
• A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking (Q1652321) (← links)
• A problem-reduction evolutionary algorithm for solving the capacitated vehicle routing problem (Q1664832) (← links)
• A matheuristic for the asymmetric capacitated vehicle routing problem (Q1686058) (← links)
• A performance study on multi improvement neighborhood search strategy (Q1687681) (← links)
• Knowledge-guided local search for the vehicle routing problem (Q1722960) (← links)
• Heuristics for vehicle routing problems: sequence or set optimization? (Q1722969) (← links)
• A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet (Q1730643) (← links)
• Efficiently solving very large-scale routing problems (Q1738815) (← links)
• A matheuristic for the cell formation problem (Q1744631) (← links)
• New benchmark instances for the capacitated vehicle routing problem (Q1752871) (← links)
• A GVNS algorithm for solving the multi-depot vehicle routing problem (Q1791946) (← links)
• Routing a mix of conventional, plug-in hybrid, and electric vehicles (Q1991124) (← links)
• Granular tabu search for the pickup and delivery problem with time windows and electric vehicles (Q1999625) (← links)
• A comment on: ``What makes a VRP solution good? The generation of problem-specific knowledge for heuristics'' (Q2002856) (← links)
• A multi-start local search heuristic for the green vehicle routing problem based on a multigraph reformulation (Q2003563) (← links)
• The multiple traveling salesman problem in presence of drone- and robot-supported packet stations (Q2098034) (← links)
• An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem (Q2099500) (← links)
• Collection of different types of milk with multi-tank tankers under uncertainty: a real case study (Q2121608) (← links)
• Solution strategies for the vehicle routing problem with backhauls (Q2228411) (← links)
• A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem (Q2240058) (← links)
• Multi-depot vehicle routing problem with time windows considering delivery and installation vehicles (Q2292364) (← links)
• A new efficient approach for solving the capacitated vehicle routing problem using the gravitational emulation local search algorithm (Q2294011) (← links)
• Industrial and tramp ship routing problems: closing the gap for real-scale instances (Q2294636) (← links)
• A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
• A matheuristic for the truck and trailer routing problem (Q2355939) (← links)
• Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier (Q2422737) (← links)
• A survey on matheuristics for routing problems (Q2513752) (← links)
• A unified solution framework for multi-attribute vehicle routing problems (Q2514767) (← links)
• A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem (Q2630221) (← links)
• A review of vehicle routing with simultaneous pickup and delivery (Q2664320) (← links)
• A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem (Q2668616) (← links)
• An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems (Q2668773) (← links)
• A POPMUSIC matheuristic for the capacitated vehicle routing problem (Q2669570) (← links)
• Hybrid genetic search for the CVRP: open-source implementation and SWAP* neighborhood (Q2669771) (← links)
• Hybrid adaptive large neighborhood search for vehicle routing problems with depot location decisions (Q2676276) (← links)
• Adjusting the order crossover operator for capacitated vehicle routing problems (Q2676389) (← links)
• In-depth analysis of granular local search for capacitated vehicle routing (Q2686133) (← links)
• Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure (Q2802246) (← links)
• Improving Column Generation for Vehicle Routing Problems via Random Coloring and Parallelization (Q5086000) (← links)
• The Vehicle Routing Problem with Release and Due Dates (Q5131700) (← links)
• The <i>r</i>‐interdiction selective multi‐depot vehicle routing problem (Q6067891) (← links)