The following pages link to Vehicle Routing (Q2939938):
Displaying 50 items.
- The probabilistic orienteering problem (Q1652250) (← links)
- MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration (Q1652297) (← links)
- An open source spreadsheet solver for vehicle routing problems (Q1652315) (← links)
- The flexible periodic vehicle routing problem (Q1652351) (← links)
- Vehicle routing with backhauls: review and research perspectives (Q1652540) (← links)
- Robust vehicle routing problem with hard time windows under demand and travel time uncertainty (Q1652619) (← links)
- Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem (Q1652698) (← links)
- A profit-maximization location-routing-pricing problem: a branch-and-price algorithm (Q1653368) (← links)
- Accelerating the branch-and-price algorithm using machine learning (Q1653391) (← links)
- A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints (Q1681135) (← links)
- The shared customer collaboration vehicle routing problem (Q1681166) (← links)
- The open vehicle routing problem with decoupling points (Q1681358) (← links)
- Trends in transportation and logistics (Q1681388) (← links)
- A branch-and-price approach to the feeder network design problem (Q1681514) (← links)
- The accuracy of carbon emission and fuel consumption computations in green vehicle routing (Q1683091) (← links)
- Appointment scheduling and routing optimization of attended home delivery system with random customer behavior (Q1683134) (← links)
- A matheuristic for the asymmetric capacitated vehicle routing problem (Q1686058) (← links)
- A robust multi-trip vehicle routing problem of perishable products with intermediate depots and time windows (Q1686418) (← links)
- Solving the pickup and delivery problem with three-dimensional loading constraints and reloading ban (Q1694323) (← links)
- Resource constrained routing and scheduling: review and research prospects (Q1694813) (← 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)
- A cluster-first route-second approach for the swap body vehicle routing problem (Q1695789) (← links)
- An ILP-based local search procedure for the VRP with pickups and deliveries (Q1698289) (← links)
- A survey of the standard location-routing problem (Q1698292) (← links)
- Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem (Q1703462) (← links)
- Adaptive large neighborhood search on the graphics processing unit (Q1711444) (← links)
- A vehicle routing problem arising in unmanned aerial monitoring (Q1722956) (← links)
- Heuristics for vehicle routing problems: sequence or set optimization? (Q1722969) (← links)
- Multigraph modeling and adaptive large neighborhood search for the vehicle routing problem with time windows (Q1725604) (← links)
- A lexicographic approach for the bi-objective selective pickup and delivery problem with time windows and paired demands (Q1730662) (← links)
- Capacitated vehicle routing problem with pick-up and alternative delivery (CVRPPAD): model and implementation using hybrid approach (Q1730665) (← links)
- Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review (Q1730669) (← links)
- Efficiently solving very large-scale routing problems (Q1738815) (← links)
- Dynamic courier routing for a food delivery service (Q1738833) (← links)
- The multi-pickup and delivery problem with time windows (Q1744529) (← links)
- Vehicle selection for a multi-compartment vehicle routing problem (Q1750481) (← links)
- The separation problem of rounded capacity inequalities: some polynomial cases (Q1751206) (← links)
- Heuristic algorithms for the operator-based relocation problem in one-way electric carsharing systems (Q1751207) (← links)
- On the complexity of the separation problem for rounded capacity inequalities (Q1751233) (← links)
- The packing while traveling problem (Q1751654) (← links)
- The windy rural postman problem with a time-dependent zigzag option (Q1751757) (← links)
- The traveling purchaser problem and its variants (Q1751767) (← links)
- Disruption management in vehicle routing and scheduling for road freight transport: a review (Q1752346) (← links)
- The undirected capacitated general routing problem with profits (Q1752868) (← links)
- Asymmetry matters: dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster (Q1753599) (← links)
- Solving the team orienteering arc routing problem with a column generation approach (Q1754007) (← links)
- A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints (Q1754109) (← links)
- Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems (Q1754114) (← links)
- Heuristics for vehicle routing problems with backhauls, time windows, and 3D loading constraints (Q1754159) (← links)
