Pages that link to "Item:Q4427373"
From MaRDI portal
The following pages link to A Set-Partitioning-Based Heuristic for the Vehicle Routing Problem (Q4427373):
Displaying 14 items.
- A hybrid algorithm for a class of vehicle routing problems (Q336559) (← links)
- A multi-space sampling heuristic for the vehicle routing problem with stochastic demands (Q375990) (← links)
- A hybrid soft computing approach for subset problems (Q474017) (← links)
- Heuristics for the variable sized bin-packing problem (Q1017465) (← links)
- Use of the BATA algorithm and MIS to solve the mail carrier problem (Q1614192) (← links)
- A combined multistart random constructive heuristic and set partitioning based formulation for the vehicle routing problem with time dependent travel times (Q1651555) (← links)
- An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem (Q2099500) (← links)
- A matheuristic for the truck and trailer routing problem (Q2355939) (← links)
- A new modeling and solution approach for the set-partitioning problem (Q2456638) (← links)
- A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems (Q2488912) (← links)
- A LP-based heuristic for a time-constrained routing problem (Q2491773) (← links)
- A survey on matheuristics for routing problems (Q2513752) (← links)
- Survey of research in the design and control of automated guided vehicle systems (Q2575559) (← links)
- A List Based Threshold Accepting Algorithm for the Capacitated Vehicle Routing Problem (Q4543518) (← links)
