Pages that link to "Item:Q3154414"

The following pages link to A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling (Q3154414):

Displaying 50 items.

• Evaluating two new heuristics for constructing customer clusters in a VRPTW with multiple service workers (Q301906) (← links)
• A hybrid algorithm for a class of vehicle routing problems (Q336559) (← links)
• A memetic algorithm for the capacitated location-routing problem with mixed backhauls (Q337427) (← links)
• Multiobjective vehicle routing problem with fixed delivery and optional collections (Q375980) (← links)
• Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery (Q376001) (← links)
• Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery (Q408394) (← links)
• Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries (Q707138) (← links)
• A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery (Q713116) (← links)
• Shipper collaboration in forward and reverse logistics (Q781076) (← links)
• A unified heuristic for a large class of vehicle routing problems with backhauls (Q819067) (← links)
• An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup (Q833542) (← links)
• A heuristic method for the vehicle routing problem with mixed deliveries and pickups (Q835589) (← links)
• CLOVES: a cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up (Q859684) (← links)
• General solutions to the single vehicle routing problem with pickups and deliveries (Q869591) (← links)
• A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries (Q927194) (← links)
• A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery (Q959519) (← links)
• A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery (Q976005) (← links)
• Validating vehicle routing zone construction using Monte Carlo simulation (Q976400) (← links)
• An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries (Q1039783) (← links)
• Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer (Q1634057) (← links)
• A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups (Q1652352) (← links)
• Vehicle routing with backhauls: review and research perspectives (Q1652540) (← links)
• A methodology to exploit profit allocation in logistics joint distribution network optimization (Q1666679) (← links)
• Variable neighborhood search algorithms for pickup and delivery problems with loading constraints (Q1687656) (← links)
• Multi-trip pickup and delivery problem with time windows and synchronization (Q1695786) (← links)
• A survey of the standard location-routing problem (Q1698292) (← links)
• Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries (Q1761164) (← links)
• A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups (Q1782165) (← links)
• Exact solutions for the collaborative pickup and delivery problem (Q1787916) (← links)
• A mathematical formulation and heuristic approach for the heterogeneous fixed fleet vehicle routing problem with simultaneous pickup and delivery (Q1983673) (← links)
• Optimizing logistics routings in a network perspective of supply and demand nodes (Q2033331) (← links)
• The vehicle routing problem with simultaneous pickup and delivery and handling costs (Q2289929) (← links)
• The heterogeneous fleet location routing problem with simultaneous pickup and delivery and overloads (Q2321672) (← links)
• Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care (Q2356017) (← links)
• Single vehicle routing with a predefined customer sequence and multiple depot returns (Q2463499) (← links)
• The single vehicle routing problem with deliveries and selective pickups (Q2475847) (← links)
• A new tabu search algorithm for the vehicle routing problem with backhauls (Q2496076) (← links)
• A unified solution framework for multi-attribute vehicle routing problems (Q2514767) (← links)
• A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service (Q2566927) (← 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)
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) (Q2644426) (← links)
• A review of vehicle routing with simultaneous pickup and delivery (Q2664320) (← links)
• GENVNS-TS-CL-PR: a heuristic approach for solving the vehicle routing problem with simultaneous pickup and delivery (Q2840778) (← links)
• A selective adaptive large neighborhood search heuristic for the profitable tour problem with simultaneous pickup and delivery services (Q4634326) (← links)
• New Notation and Classification Scheme for Vehicle Routing Problems (Q5247680) (← links)
• AN ALGORITHM FOR THE GENERALIZED VEHICLE ROUTING PROBLEM WITH BACKHAULING (Q5315981) (← links)
• Unified heuristics to solve routing problem of reverse logistics in sustainable supply chain (Q5494706) (← links)
• New valid inequalities for the symmetric vehicle routing problem with simultaneous pickup and deliveries (Q6065909) (← links)
• Variable neighborhood search algorithms for the vehicle routing problem with two‐dimensional loading constraints and mixed linehauls and backhauls (Q6066723) (← links)