Pages that link to "Item:Q319363"
From MaRDI portal
The following pages link to The discrete time window assignment vehicle routing problem (Q319363):
Displaying 31 items.
- A priori optimization with recourse for the vehicle routing problem with hard time windows and stochastic service times (Q320872) (← links)
- A lookahead partitioning heuristic for a new assignment and scheduling problem in a distribution system (Q421661) (← links)
- Solving the petroleum replenishment and routing problem with variable demands and time windows (Q827236) (← links)
- The vehicle routing problem with coupled time windows (Q926344) (← links)
- An assignment-based heuristic for vehicle routing with time windows (Q1001380) (← links)
- A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen (Q1617109) (← links)
- 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)
- Column generation based primal heuristics for routing and loading problems (Q1742212) (← links)
- Vehicle routing and appointment scheduling with team assignment for home services (Q1782148) (← links)
- Consistent vehicle routing problem with service level agreements: a case study in the pharmaceutical distribution sector (Q1991272) (← links)
- Self-imposed time windows in vehicle routing problems (Q2018105) (← links)
- Route-based approximate dynamic programming for dynamic pricing in attended home delivery (Q2023939) (← links)
- Real-time ride-sharing framework with dynamic timeframe and anticipation-based migration (Q2028763) (← links)
- Home service routing and appointment scheduling with stochastic service times (Q2028845) (← links)
- Efficient formulation for transportation scheduling of single refinery multiproduct pipelines (Q2030316) (← links)
- On solving the time window assignment vehicle routing problem via iterated local search (Q2056911) (← links)
- Time window optimization for attended home service delivery under multiple sources of uncertainties (Q2108142) (← links)
- Two-stage vehicle routing problem with arc time windows: a mixed integer programming formulation and a heuristic approach (Q2356026) (← links)
- Modeling Distribution Problems with Time Windows. Part II: Two Customer Types (Q3762058) (← links)
- A synthesis of assignment and heuristic solutions for vehicle routing with time windows (Q4661219) (← links)
- Addressing Orientation Symmetry in the Time Window Assignment Vehicle Routing Problem (Q4995084) (← links)
- Primal Heuristics for Branch and Price: The Assets of Diving Methods (Q5138257) (← links)
- Adaptive appointment scheduling with periodic updates (Q6065633) (← links)
- The time‐consistent dial‐a‐ride problem (Q6065902) (← links)
- Demand management for attended home delivery -- a literature review (Q6096610) (← links)
- Stochastic optimization models for a home service routing and appointment scheduling problem with random travel and service times (Q6106964) (← links)
- A survey of attended home delivery and service problems with a focus on applications (Q6142935) (← links)
- A triple bottom line optimization model for assignment and routing of on-demand home services (Q6568459) (← links)
- Consistent routing for local same-day delivery via micro-hubs (Q6581372) (← links)
- Multi-period time window assignment for attended home delivery (Q6586276) (← links)
