Pages that link to "Item:Q439444"
From MaRDI portal
The following pages link to Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints (Q439444):
Displaying 50 items.
- Branch-and-price and constraint programming for solving a real-life technician dispatching problem (Q296755) (← links)
- The discrete time window assignment vehicle routing problem (Q319363) (← links)
- An ant colony system for responsive dynamic vehicle routing (Q319660) (← links)
- The vehicle-routing problem with time windows and driver-specific times (Q322409) (← links)
- Using the primal-dual interior point algorithm within the branch-price-and-cut method (Q336429) (← links)
- An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size (Q336876) (← links)
- A vehicle routing problem with flexible time windows (Q337177) (← links)
- A decomposition based memetic algorithm for multi-objective vehicle routing problem with time windows (Q337630) (← links)
- Special issue on vehicle routing and scheduling: recent trends and advances (Q375973) (← links)
- Exact methods for solving the elementary shortest and longest path problems (Q512936) (← links)
- A column generation algorithm for the vehicle routing problem with soft time windows (Q538287) (← links)
- Solving the petroleum replenishment and routing problem with variable demands and time windows (Q827236) (← links)
- A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen (Q1617109) (← links)
- An iterated tabu search for the multi-compartment vehicle routing problem (Q1652237) (← links)
- A branch-and-cut algorithm for the time window assignment vehicle routing problem (Q1652456) (← links)
- Robust vehicle routing problem with hard time windows under demand and travel time uncertainty (Q1652619) (← links)
- A problem-reduction evolutionary algorithm for solving the capacitated vehicle routing problem (Q1664832) (← links)
- A matheuristic for the asymmetric capacitated vehicle routing problem (Q1686058) (← links)
- Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems (Q1694814) (← 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)
- Solving fixed charge transportation problem with truck load constraint using metaheuristics (Q1730658) (← links)
- The separation problem of rounded capacity inequalities: some polynomial cases (Q1751206) (← links)
- On the complexity of the separation problem for rounded capacity inequalities (Q1751233) (← links)
- Asymmetry matters: dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster (Q1753599) (← links)
- Branch-price-and-cut for the mixed capacitated general routing problem with time windows (Q1754228) (← links)
- Minimizing the number of machines with limited workload capacity for scheduling jobs with interval constraints (Q1985052) (← 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)
- Tabu search for the time-dependent vehicle routing problem with time windows on a road network (Q2028848) (← links)
- Scheduling heterogeneous delivery tasks on a mixed logistics platform (Q2076846) (← links)
- A CVRP model for an in-plant milk run system (Q2089446) (← 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 hybrid ant colony optimization algorithm for a multi-objective vehicle routing problem with flexible time windows (Q2214966) (← links)
- A column generation-based heuristic for the split delivery vehicle routing problem with time windows (Q2226483) (← links)
- Vehicle routing with transportable resources: using carpooling and walking for on-site services (Q2315653) (← links)
- Synchronous routing for personal rapid transit pods (Q2336598) (← links)
- A matheuristic for the truck and trailer routing problem (Q2355939) (← links)
- Two-stage vehicle routing problem with arc time windows: a mixed integer programming formulation and a heuristic approach (Q2356026) (← links)
- Routing optimization with time windows under uncertainty (Q2414906) (← links)
- Solving elementary shortest-path problems as mixed-integer programs (Q2454365) (← links)
- Min-Max vs. Min-Sum vehicle routing: a worst-case analysis (Q2629640) (← links)
- Ensuring service levels in routing problems with time windows and stochastic travel times (Q2629660) (← links)
- A survey of variants and extensions of the location-routing problem (Q2629668) (← links)
- A variable neighborhood search branching for the electric vehicle routing problem with time windows (Q2631269) (← links)
- The vehicle sharing and task allocation problem: MILP formulation and a heuristic solution approach (Q2676335) (← links)
- A column generation-based heuristic for a rehabilitation patient scheduling and routing problem (Q2676370) (← links)
- Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments (Q2811328) (← links)
- Tolerance-Based vs. Cost-Based Branching for the Asymmetric Capacitated Vehicle Routing Problem (Q2820103) (← links)
- New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows (Q4599317) (← links)
