Pages that link to "Item:Q2018105"
From MaRDI portal
The following pages link to Self-imposed time windows in vehicle routing problems (Q2018105):
Displayed 12 items.
- A branch-and-cut algorithm for the time window assignment vehicle routing problem (Q1652456) (← links)
- Product-oriented time window assignment for a multi-compartment vehicle routing problem (Q1734344) (← links)
- Vehicle routing and appointment scheduling with team assignment for home services (Q1782148) (← links)
- Time window optimization for attended home service delivery under multiple sources of uncertainties (Q2108142) (← links)
- A concise guide to existing and emerging vehicle routing problem variants (Q2184128) (← links)
- The vehicle routing problem with arrival time diversification on a multigraph (Q2184148) (← links)
- A hybrid ant colony optimization algorithm for a multi-objective vehicle routing problem with flexible time windows (Q2214966) (← links)
- An adaptive large neighborhood search heuristic for the pollution-routing problem (Q2253352) (← links)
- A vehicle routing problem with multiple service agreements (Q6066197) (← links)
- Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location (Q6068533) (← links)
- A survey of attended home delivery and service problems with a focus on applications (Q6142935) (← links)
- Statistical arbitrage: factor investing approach (Q6201542) (← links)