The following pages link to Vehicle Routing (Q2939938):
Displaying 50 items.
- The set orienteering problem (Q1754239) (← links)
- The vehicle routing problem with profits and consistency constraints (Q1755266) (← links)
- Route and speed optimization for autonomous trucks (Q1782162) (← links)
- Probabilistic time-dependent vehicle routing problem (Q1788926) (← links)
- Application of multiagent technologies to multiple depot vehicle routing problem with time windows (Q1792533) (← links)
- Local search methods for the solution of implicit inverse problems (Q1800277) (← links)
- The vehicle routing-allocation problem: A unifying framework (Q1814811) (← links)
- A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for routing problems with time windows (Q1984692) (← links)
- Finding the nucleolus of the vehicle routing game with time windows (Q1988954) (← links)
- The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time (Q1991101) (← links)
- Routing a mix of conventional, plug-in hybrid, and electric vehicles (Q1991124) (← links)
- An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy (Q1991276) (← links)
- Bee-inspired algorithms applied to vehicle routing problems: a survey and a proposal (Q1992577) (← links)
- Gossiping by energy-constrained mobile agents in tree networks (Q1998846) (← links)
- Exact solution methods for the multi-period vehicle routing problem with due dates (Q2002858) (← links)
- Bicriteria vehicle routing problem with preferences and timing constraints in home health care services (Q2005550) (← links)
- Vehicle routing with subtours (Q2010917) (← links)
- Scenario-based learning for stochastic combinatorial optimisation (Q2011603) (← links)
- A large neighborhood search for the pickup and delivery problem with time windows, split loads and transshipments (Q2026973) (← links)
- A column generation approach for an emission-oriented vehicle routing problem on a multigraph (Q2028762) (← links)
- The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach (Q2029026) (← links)
- Prioritized single nurse routing and scheduling for home healthcare services (Q2029260) (← links)
- A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints (Q2029262) (← links)
- Optimizing routing and delivery patterns with multi-compartment vehicles (Q2030293) (← links)
- Multi-compartment vehicle routing problems: state-of-the-art, modeling framework and future directions (Q2030448) (← links)
- A biased random-key genetic algorithm for the set orienteering problem (Q2030452) (← links)
- Time-dependent stochastic vehicle routing problem with random requests: application to online police patrol management in Brussels (Q2030456) (← links)
- Routing automated lane-guided transport vehicles in a warehouse handling returns (Q2030483) (← links)
- Modelling and multi-criteria analysis of the sustainability dimensions for the green vehicle routing problem (Q2030552) (← links)
- A dynamic programming framework for optimal delivery time slot pricing (Q2030595) (← links)
- A multi-period analysis of the integrated item-sharing and crowdshipping problem (Q2030599) (← links)
- Outreach strategies for vaccine distribution: a multi-period stochastic modeling approach (Q2033398) (← links)
- A pick-up and delivery problem for logistics e-marketplace services (Q2037883) (← links)
- Efficient approximation of the metric CVRP in spaces of fixed doubling dimension (Q2046271) (← links)
- Mixed-integer linear optimization for full truckload pickup and delivery (Q2047182) (← links)
- Vehicle routing problem considering equity of demand satisfaction (Q2047214) (← links)
- Approximation of the capacitated vehicle routing problem with a limited number of routes in metric spaces of fixed doubling dimension (Q2048811) (← links)
- On the one-to-one pickup-and-delivery problem with time windows and trailers (Q2051215) (← links)
- On solving the time window assignment vehicle routing problem via iterated local search (Q2056911) (← links)
- Synchronized pickup and delivery problems with connecting FIFO stack (Q2056913) (← links)
- Scheduling heterogeneous delivery tasks on a mixed logistics platform (Q2076846) (← links)
- A tailored Benders decomposition approach for last-mile delivery with autonomous robots (Q2077920) (← links)
- An adaptive large neighborhood search algorithm for vehicle routing problem with multiple time windows constraints (Q2083393) (← links)
- A CVRP model for an in-plant milk run system (Q2089446) (← links)
- Instance generation framework for green vehicle routing (Q2089617) (← links)
- The multiple traveling salesman problem in presence of drone- and robot-supported packet stations (Q2098034) (← links)
- An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem (Q2099500) (← links)
- Robust vehicle routing under uncertainty via branch-price-and-cut (Q2101653) (← links)
- Approximation algorithms for solving the heterogeneous Chinese postman problem (Q2106868) (← links)
- Opportunities for reinforcement learning in stochastic dynamic vehicle routing (Q2108171) (← links)
