Pages that link to "Item:Q4918250"

The following pages link to Vehicle routing problems with split deliveries (Q4918250):

Displaying 47 items.

• Branch-and-cut algorithms for the split delivery vehicle routing problem (Q296858) (← links)
• Rich vehicle routing problems: from a taxonomy to a definition (Q299767) (← links)
• An ant colony system for responsive dynamic vehicle routing (Q319660) (← links)
• A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem (Q322620) (← links)
• Mathematical programming algorithms for bin packing problems with item fragmentation (Q336982) (← links)
• An iterated local search heuristic for the split delivery vehicle routing problem (Q337288) (← links)
• A decomposition-based heuristic for the multiple-product inventory-routing problem (Q337420) (← links)
• Testing local search move operators on the vehicle routing problem with split deliveries and time windows (Q337460) (← links)
• Special issue on vehicle routing and scheduling: recent trends and advances (Q375973) (← links)
• A randomized granular tabu search heuristic for the split delivery vehicle routing problem (Q490211) (← links)
• Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads (Q724007) (← links)
• Shipper collaboration in forward and reverse logistics (Q781076) (← links)
• Integer optimization with penalized fractional values: the knapsack case (Q1631508) (← links)
• The flexible periodic vehicle routing problem (Q1652351) (← links)
• A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups (Q1652352) (← links)
• Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem (Q1652698) (← links)
• A distance function for computing on finite subsets of Euclidean spaces (Q1709440) (← links)
• New exact solution approaches for the split delivery vehicle routing problem (Q1742903) (← links)
• A hierarchical solution approach for a multicommodity distribution problem under a special cost structure (Q1761205) (← links)
• A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups (Q1782165) (← links)
• A large neighborhood search for the pickup and delivery problem with time windows, split loads and transshipments (Q2026973) (← links)
• The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach (Q2029026) (← links)
• Multi-compartment vehicle routing problems: state-of-the-art, modeling framework and future directions (Q2030448) (← links)
• Approximation issues of fractional knapsack with penalties: a note (Q2144213) (← links)
• A concise guide to existing and emerging vehicle routing problem variants (Q2184128) (← links)
• A column generation-based heuristic for the split delivery vehicle routing problem with time windows (Q2226483) (← links)
• A branch-and-cut algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem (Q2242245) (← links)
• The split delivery vehicle routing problem with three-dimensional loading constraints (Q2282545) (← links)
• A mathematical programming model for integrating production and procurement transport decisions (Q2294862) (← links)
• Adaptive large neighborhood search for the commodity constrained split delivery VRP (Q2329717) (← links)
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
• The bin packing problem with item fragmentation: a worst-case analysis (Q2414454) (← links)
• A survey on matheuristics for routing problems (Q2513752) (← links)
• An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery (Q2669556) (← links)
• The heterogeneous flexible periodic vehicle routing problem: mathematical formulations and solution algorithms (Q2669729) (← links)
• Resilient route design for collection of material from suppliers with split deliveries and stochastic demands (Q2676305) (← links)
• An approach for efficient ship routing (Q2865160) (← links)
• A novel approach to solve the split delivery vehicle routing problem (Q2968484) (← links)
• Particle Swarm Optimization for Split Delivery Vehicle Routing Problem (Q4642133) (← links)
• A hybrid algorithm for the drilling rig routing problem (Q5100126) (← links)
• Thirty years of <i>International Transactions in Operational Research</i>: past, present, and future direction (Q6056865) (← links)
• Systematic reviews as a metaknowledge tool: caveats and a review of available options (Q6056869) (← links)
• An evolutionary algorithm for the multi‐objective pick‐up and delivery pollution‐routing problem (Q6066303) (← links)
• Exact and hyper‐heuristic solutions for the distribution‐installation problem from the VeRoLog 2019 challenge (Q6092665) (← links)
• A memetic algorithm for solving rich waste collection problems (Q6167528) (← links)
• The inventory routing problem with split deliveries (Q6180028) (← links)
• A parallel greedy approach enhanced by genetic algorithm for the stochastic rig routing problem (Q6181372) (← links)