Pages that link to "Item:Q2566927"

The following pages link to A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service (Q2566927):

Displaying 46 items.

• The vehicle routing problem with simultaneous pick-ups and deliveries and two-dimensional loading constraints (Q322687) (← links)
• A hybrid algorithm for a class of vehicle routing problems (Q336559) (← links)
• Route planning for a seaplane service: the case of the Greek islands (Q337533) (← links)
• An adaptive large neighborhood search for an E-grocery delivery routing problem (Q342326) (← 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)
• Integrated ant colony and tabu search approach for time dependent vehicle routing problems with simultaneous pickup and delivery (Q405689) (← links)
• Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery (Q408394) (← links)
• Stochastic single vehicle routing problem with delivery and Pick up and a predefined customer sequence (Q421576) (← links)
• Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW (Q439557) (← links)
• A fast tabu search implementation for large asymmetric traveling salesman problems defined on sparse graphs (Q505141) (← 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)
• General solutions to the single vehicle routing problem with pickups and deliveries (Q869591) (← 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)
• A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows (Q976316) (← links)
• Lasso solution strategies for the vehicle routing problem with pickups and deliveries (Q1011218) (← links)
• Single-commodity vehicle routing problem with pickup and delivery service (Q1023173) (← 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)
• Solving fixed charge transportation problem with truck load constraint using metaheuristics (Q1730658) (← 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)
• Probabilistic time-dependent vehicle routing problem (Q1788926) (← links)
• A mathematical formulation and heuristic approach for the heterogeneous fixed fleet vehicle routing problem with simultaneous pickup and delivery (Q1983673) (← links)
• A fast randomized algorithm for the heterogeneous vehicle routing problem with simultaneous pickup and delivery (Q2005557) (← links)
• Simulation-based optimisation for stochastic maintenance routing in an offshore wind farm (Q2029264) (← links)
• Mixed-integer linear optimization for full truckload pickup and delivery (Q2047182) (← links)
• Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care (Q2356017) (← links)
• A metaheuristic method for vehicle routing problem based on improved ant colony optimization and tabu search (Q2358876) (← links)
• Optimizing two-level reverse distribution networks with hybrid memetic algorithms (Q2448154) (← links)
• The single vehicle routing problem with deliveries and selective pickups (Q2475847) (← links)
• A new VRPPD model and a hybrid heuristic solution approach for e-tailing (Q2514740) (← links)
• A unified solution framework for multi-attribute vehicle routing problems (Q2514767) (← 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)
• An adaptive tabu search algorithm embedded with iterated local search and route elimination for the bike repositioning and recycling problem (Q2664364) (← links)
• GENVNS-TS-CL-PR: A heuristic approach for solving the vehicle routing problem with simultaneous pickup and delivery (Q2840778) (← links)
• Convergence of taboo search in continuous global optimization (Q3503364) (← links)
• One-to-Many-to-One Single Vehicle Pickup and Delivery Problems (Q3564364) (← links)
• A selective adaptive large neighborhood search heuristic for the profitable tour problem with simultaneous pickup and delivery services (Q4634326) (← links)
• New valid inequalities for the symmetric vehicle routing problem with simultaneous pickup and deliveries (Q6065909) (← links)
• An integer L-shaped algorithm for vehicle routing problem with simultaneous delivery and stochastic pickup (Q6164581) (← links)