Pages that link to "Item:Q5287233"
From MaRDI portal
The following pages link to Extensions of the Petal Method for Vehicle Routeing (Q5287233):
Displaying 14 items.
- A multi-space sampling heuristic for the vehicle routing problem with stochastic demands (Q375990) (← links)
- Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand (Q439376) (← links)
- Efficient frameworks for greedy split and new depth first search split procedures for routing problems (Q613510) (← links)
- A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem (Q1014948) (← links)
- Use of the BATA algorithm and MIS to solve the mail carrier problem (Q1614192) (← links)
- A choice function hyper-heuristic framework for the allocation of maintenance tasks in Danish railways (Q1652574) (← links)
- Stronger \(K\)-tree relaxations for the vehicle routing problem (Q1827647) (← links)
- A sweep-based algorithm for the fleet size and mix vehicle routing problem (Q1848592) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- The column-circular, subsets-selection problem: Complexity and solutions (Q1974273) (← links)
- An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem (Q2099500) (← links)
- A survey on matheuristics for routing problems (Q2513752) (← links)
- A priori policy evaluation and cyclic-order-based simulated annealing for the multi-compartment vehicle routing problem with stochastic demands (Q2629676) (← links)
- An Improved Petal Heuristic for the Vehicle Routeing Problem (Q4887791) (← links)