Pages that link to "Item:Q1806768"
From MaRDI portal
The following pages link to Extensions to the generalised assignment heuristic for vehicle routing (Q1806768):
Displaying 13 items.
- Delivery pattern and transportation planning in grocery retailing (Q322832) (← links)
- Lagrangian relaxation guided problem space search heuristics for generalized assignment problems (Q884028) (← links)
- Use of the BATA algorithm and MIS to solve the mail carrier problem (Q1614192) (← links)
- Accelerating the convergence of subgradient optimisation (Q1847153) (← links)
- A visual interactive approach to vehicle routing (Q1869906) (← links)
- A genetic algorithm for the vehicle routing problem (Q1870833) (← links)
- An efficient transformation of the generalized vehicle routing problem (Q1971986) (← links)
- Tuning a parametric Clarke–Wright heuristic via a genetic algorithm (Q3394026) (← links)
- A List Based Threshold Accepting Algorithm for the Capacitated Vehicle Routing Problem (Q4543518) (← links)
- An Improved Petal Heuristic for the Vehicle Routeing Problem (Q4887791) (← links)
- Extensions of the Petal Method for Vehicle Routeing (Q5287233) (← links)
- A Survey of the Generalized Assignment Problem and Its Applications (Q6102818) (← links)
- Vehicle routing with stochastic demand, service and waiting times -- the case of food bank collection problems (Q6572838) (← links)