The following pages link to Michael Schneider (Q319530):
Displaying 15 items.
- Routing a mixed fleet of electric and conventional vehicles (Q319531) (← links)
- The vehicle-routing problem with time windows and driver-specific times (Q322409) (← links)
- A note on the time travel approach for handling time windows in vehicle routing problems (Q336572) (← links)
- Designing sustainable mid-haul logistics networks with intra-route multi-resource facilities (Q1681274) (← links)
- A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem (Q1681522) (← links)
- A survey of the standard location-routing problem (Q1698292) (← links)
- An adaptive VNS algorithm for vehicle routing problems with intermediate stops (Q2018107) (← links)
- Order batching and batch sequencing in an AMR-assisted picker-to-parts system (Q2076924) (← links)
- Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier (Q2422737) (← links)
- A survey of variants and extensions of the location-routing problem (Q2629668) (← links)
- Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows (Q2957464) (← links)
- Modeling Single-Picker Routing Problems in Classical and Modern Warehouses (Q4995081) (← links)
- Routing electric vehicles with a single recharge per route (Q6092658) (← links)
- Cost-neutral reduction of infection risk in picker-to-parts warehousing systems (Q6103187) (← links)
- A conceptually simple algorithm for the capacitated location-routing problem (Q6491328) (← links)
