Pages that link to "Item:Q1040973"

The following pages link to A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows (Q1040973):

Displaying 28 items.

• A stochastic vehicle routing problem with travel time uncertainty: trade-off between cost and customer service (Q264279) (← links)
• Branch-and-price and constraint programming for solving a real-life technician dispatching problem (Q296755) (← links)
• On service consistency in multi-period vehicle routing (Q319190) (← links)
• The fleet size and mix location-routing problem with time windows: formulations and a heuristic algorithm (Q320620) (← links)
• The vehicle-routing problem with time windows and driver-specific times (Q322409) (← links)
• The electric fleet size and mix vehicle routing problem with time windows and recharging stations (Q323018) (← links)
• A note on the time travel approach for handling time windows in vehicle routing problems (Q336572) (← links)
• Coupling a memetic algorithm to simulation models for promising multi-period asset allocations (Q336580) (← links)
• A knowledge-based evolutionary algorithm for the multiobjective vehicle routing problem with time windows (Q336957) (← links)
• An iterated local search for the multi-commodity multi-trip vehicle routing problem with time windows (Q337147) (← links)
• Scheduled penalty variable neighborhood search (Q337204) (← links)
• A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading (Q337617) (← links)
• A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows (Q339607) (← links)
• A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows (Q342060) (← links)
• Designing sustainable mid-haul logistics networks with intra-route multi-resource facilities (Q1681274) (← links)
• Designing granular solution methods for routing problems with time windows (Q1694925) (← links)
• A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet (Q1730643) (← links)
• Heuristics for vehicle routing problems with backhauls, time windows, and 3D loading constraints (Q1754159) (← links)
• High-level relay hybrid metaheuristic method for multi-depot vehicle routing problem with time windows (Q1951171) (← links)
• Routing a mix of conventional, plug-in hybrid, and electric vehicles (Q1991124) (← links)
• Granular tabu search for the pickup and delivery problem with time windows and electric vehicles (Q1999625) (← links)
• A hybrid algorithm for time-dependent vehicle routing problem with time windows (Q2027083) (← links)
• Comparison of anticipatory algorithms for a dial-a-ride problem (Q2140208) (← links)
• An effective iterated two-stage heuristic algorithm for the multiple traveling salesmen problem (Q2147041) (← links)
• An efficient optimisation procedure for the workforce scheduling and routing problem: Lagrangian relaxation and iterated local search (Q2147119) (← links)
• Recent progress of local search in handling the time window constraints of the vehicle routing problem (Q5893964) (← links)
• Scheduling issues in vehicle routing (Q5963106) (← links)
• Multi-depot vehicle routing problem with time windows under shared depot resources (Q5963636) (← links)