Pages that link to "Item:Q429673"
From MaRDI portal
The following pages link to The delivery man problem with time windows (Q429673):
Displaying 12 items.
- A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment (Q1652330) (← links)
- Scheduling last-mile deliveries with truck-based autonomous robots (Q1653394) (← links)
- Hybrid optimization methods for time-dependent sequencing problems (Q1751901) (← links)
- An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem (Q1762031) (← links)
- A comparison of three metaheuristics for the workover rig routing problem (Q1926698) (← links)
- A simple and effective metaheuristic for the minimum latency problem (Q1926884) (← links)
- A metaheuristic for the delivery man problem with time windows (Q2045024) (← links)
- Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery (Q2672110) (← links)
- The Surgical Patient Routing Problem: A Central Planner Approach (Q2960361) (← links)
- Skewed general variable neighborhood search for the cumulative capacitated vehicle routing problem (Q6066728) (← links)
- Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND (Q6070871) (← links)
- Improving a state‐of‐the‐art heuristic for the minimum latency problem with data mining (Q6070880) (← links)
