Pages that link to "Item:Q1754733"

The following pages link to Large multiple neighborhood search for the clustered vehicle-routing problem (Q1754733):

Displaying 12 items.

• Heuristics for vehicle routing problems: sequence or set optimization? (Q1722969) (← links)
• Real-time ride-sharing framework with dynamic timeframe and anticipation-based migration (Q2028763) (← links)
• Single-machine scheduling with release times, deadlines, setup times, and rejection (Q2030718) (← links)
• A unified exact approach for clustered and generalized vehicle routing problems (Q2108132) (← links)
• A branch-and-cut algorithm for the soft-clustered vehicle-routing problem (Q2208364) (← links)
• Exact solution of the soft-clustered vehicle-routing problem (Q2272311) (← links)
• The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances (Q2286911) (← links)
• Large multiple neighborhood search for the soft-clustered vehicle-routing problem (Q2668597) (← links)
• The joint order batching and picker routing problem: modelled and solved as a clustered vehicle routing problem (Q2668601) (← links)
• An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems (Q2668773) (← links)
• An improved matheuristic for solving the electric vehicle routing problem with time windows and synchronized mobile charging/battery swapping (Q6047843) (← links)
• Community logistics and dynamic community partitioning: a new approach for solving e-commerce last mile delivery (Q6106970) (← links)