Pages that link to "Item:Q707138"

The following pages link to Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries (Q707138):

Displayed 49 items.

• A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem (Q322620) ‎ (← links)
• The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation (Q337237) ‎ (← links)
• Route planning for a seaplane service: the case of the Greek islands (Q337533) ‎ (← links)
• Stochastic single vehicle routing problem with delivery and Pick up and a predefined customer sequence (Q421576) ‎ (← links)
• Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing (Q421709) ‎ (← links)
• Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem (Q709128) ‎ (← 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)
• Inventory routing with continuous moves (Q858281) ‎ (← 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)
• Lasso solution strategies for the vehicle routing problem with pickups and deliveries (Q1011218) ‎ (← links)
• A local search heuristic for the pre- and end-haulage of intermodal container terminals (Q1017451) ‎ (← links)
• An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries (Q1039783) ‎ (← 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)
• Multi-trip pickup and delivery problem with time windows and synchronization (Q1695786) ‎ (← links)
• A framing link based tabu search algorithm for large-scale multidepot vehicle routing problems (Q1717769) ‎ (← links)
• Optimization of vehicle routing with pickup based on multibatch production (Q1727038) ‎ (← 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)
• Variable neighbourhood structures for cycle location problems (Q1926979) ‎ (← links)
• Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints (Q1926986) ‎ (← links)
• A mathematical formulation and heuristic approach for the heterogeneous fixed fleet vehicle routing problem with simultaneous pickup and delivery (Q1983673) ‎ (← links)
• Heuristic optimization for multi-depot vehicle routing problem in ATM network model (Q2087124) ‎ (← links)
• Methods for strategic liner shipping network design (Q2256277) ‎ (← links)
• The vehicle routing problem with simultaneous pickup and delivery and handling costs (Q2289929) ‎ (← links)
• Adaptive memory artificial bee colony algorithm for Green vehicle routing with cross-docking (Q2293789) ‎ (← links)
• Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care (Q2356017) ‎ (← links)
• Finite and infinite-horizon single vehicle routing problems with a predefined customer sequence and pickup and delivery (Q2356181) ‎ (← links)
• A Lagrangian relaxation-based heuristic for the vehicle routing with full container load (Q2432884) ‎ (← 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 VRPPD model and a hybrid heuristic solution approach for e-tailing (Q2514740) ‎ (← links)
• A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service (Q2566927) ‎ (← 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)
• One-to-Many-to-One Single Vehicle Pickup and Delivery Problems (Q3564364) ‎ (← links)
• Unified heuristics to solve routing problem of reverse logistics in sustainable supply chain (Q5494706) ‎ (← links)
• Ant colony algorithm for the multi-depot vehicle routing problem in large quantities by a heterogeneous fleet of vehicles (Q6160382) ‎ (← links)
• (Q6202380) ‎ (← links)