Pages that link to "Item:Q2468488"
From MaRDI portal
The following pages link to Formulations and exact algorithms for the vehicle routing problem with time windows (Q2468488):
Displaying 36 items.
- Rich vehicle routing problems: from a taxonomy to a definition (Q299767) (← links)
- A bi-objective approach for scheduling ground-handling vehicles in airports (Q342334) (← links)
- Approximation schemes for Euclidean vehicle routing problems with time windows (Q346518) (← links)
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints (Q439444) (← links)
- Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model (Q635160) (← links)
- A local search heuristic for the pre- and end-haulage of intermodal container terminals (Q1017451) (← links)
- Vehicle routing with backhauls: review and research perspectives (Q1652540) (← links)
- A two-phase heuristic algorithm for the common frequency routing problem with vehicle type choice in the milk run (Q1665593) (← links)
- Designing granular solution methods for routing problems with time windows (Q1694925) (← links)
- Multigraph modeling and adaptive large neighborhood search for the vehicle routing problem with time windows (Q1725604) (← links)
- A routing and scheduling approach to rail transportation of hazardous materials with demand due dates (Q1753563) (← links)
- Branch-price-and-cut for the mixed capacitated general routing problem with time windows (Q1754228) (← links)
- Consistent vehicle routing problem with service level agreements: a case study in the pharmaceutical distribution sector (Q1991272) (← links)
- Accounting for cost heterogeneity on the demand in the context of a technician dispatching problem (Q2023966) (← links)
- The vehicle routing problem with time windows and evidential service and travel times: a recourse model (Q2146039) (← links)
- Optimizing the planning of the observation of a catalog of objects by a mobile observer, taking the implicated limitations into account (Q2171276) (← links)
- A decision framework for automatic guided vehicle routing problem with traffic congestions (Q2223261) (← links)
- Ant colony system with characterization-based heuristics for a bottled-products distribution logistics system (Q2349706) (← links)
- Two-stage vehicle routing problem with arc time windows: a mixed integer programming formulation and a heuristic approach (Q2356026) (← links)
- An optimization algorithm for a capacitated vehicle routing problem with time windows (Q2363743) (← links)
- Vehicle routing with soft time windows and stochastic travel times: a column generation and branch-and-price solution approach (Q2514731) (← links)
- A multi-tiered vehicle routing problem with global cross-docking (Q2669633) (← links)
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints (Q3028709) (← links)
- An Exact Algorithm for the Pickup and Delivery Problem with Time Windows (Q3098764) (← links)
- Layered Formulation for the Robust Vehicle Routing Problem with Time Windows (Q3167629) (← links)
- On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem with Time Windows (Q4367254) (← links)
- Solving an On-Line Capacitated Vehicle Routing Problem with Structured Time Windows (Q4596452) (← links)
- New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows (Q4599317) (← links)
- Matheurísticas para resolver el problema de ruteo de vehículos con ventanas de tiempo (Q5042023) (← links)
- Path inequalities for the vehicle routing problem with time windows (Q5295485) (← links)
- A two-phase approach for jointly determining the lot size and delivery policy in a vendor-buyer integrated system with rework (Q5891691) (← links)
- Using constraint-based operators to solve the vehicle routing problem with time windows (Q5960031) (← links)
- A multi‐vehicle covering tour problem with speed optimization (Q6065856) (← links)
- A survey of attended home delivery and service problems with a focus on applications (Q6142935) (← links)
- Clique Inequalities Applied to the Vehicle Routing Problem with Time Windows (Q6160235) (← links)
- An Extension of Specificity-Based Approximations to Other Belief Function Relations (Q6488073) (← links)
