Pages that link to "Item:Q337513"

The following pages link to Hybrid metaheuristics for the clustered vehicle routing problem (Q337513):

Displaying 25 items.

• Evaluating two new heuristics for constructing customer clusters in a VRPTW with multiple service workers (Q301906) (← links)
• CLOVES: a cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up (Q859684) (← links)
• A heuristic algorithm for a single vehicle static bike sharing rebalancing problem (Q1652142) (← links)
• Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times (Q1652166) (← links)
• A fast two-level variable neighborhood search for the clustered vehicle routing problem (Q1652293) (← links)
• Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times (Q1652516) (← links)
• The bi-objective insular traveling salesman problem with maritime and ground transportation costs (Q1653384) (← links)
• The static bike relocation problem with multiple vehicles and visits (Q1681499) (← links)
• Heuristics for vehicle routing problems: sequence or set optimization? (Q1722969) (← links)
• Dynamic vehicle routing problems with enhanced ant colony optimization (Q1726966) (← links)
• A hybrid ant colony optimization for dynamic multidepot vehicle routing problem (Q1727073) (← links)
• Large multiple neighborhood search for the clustered vehicle-routing problem (Q1754733) (← links)
• A simple and effective hybrid genetic search for the job sequencing and tool switching problem (Q2027021) (← links)
• Design of experiment for tuning parameters of an ant colony optimization method for the constrained shortest Hamiltonian path problem in the grid networks (Q2061347) (← links)
• A unified exact approach for clustered and generalized vehicle routing problems (Q2108132) (← links)
• The vacation planning problem: a multi-level clustering-based metaheuristic approach (Q2108189) (← links)
• A branch-and-cut algorithm for the soft-clustered vehicle-routing problem (Q2208364) (← links)
• A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem (Q2240058) (← links)
• Exact solution of the soft-clustered vehicle-routing problem (Q2272311) (← links)
• A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
• Hybrid metaheuristics for the vehicle routing problem with stochastic demands (Q2506217) (← 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)
• (Q5154495) (← links)
• A decomposition-based method for solving the clustered vehicle routing problem (Q5384360) (← links)