Pages that link to "Item:Q439557"
From MaRDI portal
The following pages link to Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW (Q439557):
Displaying 16 items.
- Evaluating two new heuristics for constructing customer clusters in a VRPTW with multiple service workers (Q301906) (← links)
- Using the primal-dual interior point algorithm within the branch-price-and-cut method (Q336429) (← links)
- A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen (Q1617109) (← links)
- An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen (Q1652283) (← links)
- Variable neighborhood descent for solving the vehicle routing problem with time windows (Q1687673) (← links)
- How to choose ``last mile'' delivery modes for E-fulfillment (Q1718319) (← links)
- The line-haul feeder vehicle routing problem: mathematical model formulation and heuristic approaches (Q1754738) (← links)
- Models and algorithms for the delivery and installation routing problem (Q2029957) (← links)
- The effects of the tractor and semitrailer routing problem on mitigation of carbon dioxide emissions (Q2312298) (← links)
- Robust optimization for the vehicle routing problem with multiple deliverymen (Q2323425) (← links)
- A matheuristic for the truck and trailer routing problem (Q2355939) (← links)
- Vehicle routing problems with time windows and multiple service workers: a systematic comparison between ACO and GRASP (Q2629574) (← links)
- Exact approaches to the robust vehicle routing problem with time windows and multiple deliverymen (Q2664412) (← links)
- The paired mail carrier problem (Q6112565) (← links)
- Small and large neighborhood search for the park-and-loop routing problem with parking selection (Q6112711) (← links)
- An integer L-shaped algorithm for the vehicle routing problem with time windows and stochastic demands (Q6167539) (← links)
