Pages that link to "Item:Q1782165"

The following pages link to A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups (Q1782165):

Displaying 14 items.

• A hybrid algorithm for time-dependent vehicle routing problem with time windows (Q2027083) (← links)
• Efficient approximation of the metric CVRP in spaces of fixed doubling dimension (Q2046271) (← links)
• Approximation of the capacitated vehicle routing problem with a limited number of routes in metric spaces of fixed doubling dimension (Q2048811) (← links)
• Optimal budget allocation policy for tabu search in stochastic simulation optimization (Q2108143) (← links)
• The split delivery vehicle routing problem with three-dimensional loading constraints (Q2282545) (← links)
• An adaptive tabu search algorithm embedded with iterated local search and route elimination for the bike repositioning and recycling problem (Q2664364) (← links)
• An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems (Q2668773) (← links)
• Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order (Q2669495) (← links)
• Constant-factor approximation algorithms for a series of combinatorial routing problems based on the reduction to the asymmetric traveling salesman problem (Q2689288) (← links)
• Synchronized truck and drone routing under disastrous conditions (case study: urban thoroughfares disinfection) (Q6047837) (← links)
• Factors affecting the final solution of the bike-sharing rebalancing problem under heuristic algorithms (Q6047927) (← links)
• Split-demand multi-trip vehicle routing problem with simultaneous pickup and delivery in airport baggage transit (Q6087499) (← links)
• Tabu search exploiting local optimality in binary optimization (Q6167666) (← links)
• A heuristic with a performance guarantee for the commodity constrained split delivery vehicle routing problem (Q6659085) (← links)