Pages that link to "Item:Q2514807"

The following pages link to Implicit depot assignments and rotations in vehicle routing heuristics (Q2514807):

Displaying 12 items.

• Hybrid metaheuristics for the clustered vehicle routing problem (Q337513) (← links)
• Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem (Q1703462) (← links)
• Fresh seafood delivery routing problem using an improved ant colony optimization (Q1730650) (← links)
• A variable neighborhood search-based algorithm with adaptive local search for the vehicle routing problem with time windows and multi-depots aiming for vehicle fleet reduction (Q2108102) (← links)
• Multi-depot vehicle routing problem with time windows considering delivery and installation vehicles (Q2292364) (← links)
• A unified solution framework for multi-attribute vehicle routing problems (Q2514767) (← links)
• An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems (Q2668773) (← links)
• Hybrid adaptive large neighborhood search for vehicle routing problems with depot location decisions (Q2676276) (← links)
• Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure (Q2802246) (← links)
• A general VNS for the multi-depot open vehicle routing problem with time windows (Q6063504) (← links)
• The <i>r</i>‐interdiction selective multi‐depot vehicle routing problem (Q6067891) (← links)
• Solving the multidepot vehicle routing problem with limited depot capacity and stochastic demands (Q6070975) (← links)