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):

Displaying 27 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)
• Multi-trip pickup and delivery problem with time windows and synchronization (Q1695786) (← 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)