Pages that link to "Item:Q1039783"

The following pages link to An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries (Q1039783):

Displaying 14 items.

• An improved particle swarm optimization for carton heterogeneous vehicle routing problem with a collection depot (Q324308) (← 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)
• Local search for the undirected capacitated arc routing problem with profits (Q531469) (← 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)
• The paired many-to-many pickup and delivery problem: an application (Q2343076) (← links)
• Finite and infinite-horizon single vehicle routing problems with a predefined customer sequence and pickup and delivery (Q2356181) (← 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)
• 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)
• An integer L-shaped algorithm for vehicle routing problem with simultaneous delivery and stochastic pickup (Q6164581) (← links)