Pages that link to "Item:Q4030786"

The following pages link to The Vehicle Routing Problem with Time Windows: Minimizing Route Duration (Q4030786):

Displaying 50 items.

• A stochastic vehicle routing problem with travel time uncertainty: trade-off between cost and customer service (Q264279) (← links)
• Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem (Q296680) (← links)
• A comparison of column-generation approaches to the synchronized pickup and delivery problem (Q319923) (← links)
• A long-haul freight transportation problem: synchronizing resources to deliver requests passing through multiple transshipment locations (Q320708) (← links)
• On-time delivery probabilistic models for the vehicle routing problem with stochastic demands and time windows (Q320889) (← links)
• The vehicle-routing problem with time windows and driver-specific times (Q322409) (← links)
• A two-stage solution method for the annual dairy transportation problem (Q322617) (← links)
• Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services (Q336790) (← links)
• Location-arc routing problem: heuristic approaches and test instances (Q336937) (← links)
• A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows (Q337225) (← links)
• Hybrid column generation and large neighborhood search for the dial-a-ride problem (Q339608) (← links)
• An adaptive large neighborhood search heuristic for the share-a-ride problem (Q342178) (← links)
• A parallel matheuristic for the technician routing and scheduling problem (Q375996) (← links)
• A sequential GRASP for the therapist routing and scheduling problem (Q398907) (← links)
• The delivery man problem with time windows (Q429673) (← links)
• Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints (Q443822) (← links)
• An integer \(L\)-shaped algorithm for the dial-a-ride problem with stochastic customer delays (Q540153) (← links)
• Optimizing departure times in vehicle routes (Q541710) (← links)
• An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows (Q617511) (← links)
• Securing home health care in times of natural disasters (Q647524) (← links)
• Local search heuristics for the probabilistic dial-a-ride problem (Q657055) (← links)
• A two-phase hybrid metaheuristic for the vehicle routing problem with time windows (Q707148) (← links)
• Heuristics for the multi-period orienteering problem with multiple time windows (Q732904) (← links)
• Integrated timetabling and vehicle scheduling with balanced departure times (Q747749) (← links)
• An optimization approach for communal home meal delivery service: A case study (Q837090) (← links)
• Applying the attribute based hill climber heuristic to the vehicle routing problem (Q856266) (← links)
• The vehicle routing problem with flexible time windows and traveling times (Q860386) (← links)
• An efficient variable neighborhood search heuristic for very large scale vehicle routing problems (Q875422) (← links)
• Active-guided evolution strategies for large-scale capacitated vehicle routing problems (Q878570) (← links)
• An iterated local search algorithm for the time-dependent vehicle routing problem with time windows (Q951117) (← links)
• The petrol station replenishment problem with time windows (Q955625) (← links)
• Solving the mobile mapping van problem: a hybrid metaheuristic for capacitated arc routing with soft time windows (Q975995) (← links)
• An effective memetic algorithm for the cumulative capacitated vehicle routing problem (Q975996) (← links)
• Adaptive granular local search heuristic for a dynamic vehicle routing problem (Q1025242) (← links)
• Local search with annealing-like restarts to solve the VRPTW (Q1400662) (← links)
• An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization (Q1651513) (← links)
• A simple and effective evolutionary algorithm for the capacitated location-routing problem (Q1651634) (← links)
• A traveling salesman problem with pickups and deliveries, time windows and draft limits: case study from chemical shipping (Q1652016) (← links)
• Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation (Q1652021) (← links)
• A hybrid genetic algorithm for the heterogeneous dial-a-ride problem (Q1652211) (← links)
• Bi-objective orienteering for personal activity scheduling (Q1652268) (← links)
• Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows (Q1652285) (← links)
• Designing sustainable mid-haul logistics networks with intra-route multi-resource facilities (Q1681274) (← links)
• A three-phase matheuristic for the time-effective electric vehicle routing problem with partial recharges (Q1687653) (← links)
• Designing granular solution methods for routing problems with time windows (Q1694925) (← links)
• Typology and literature review for dial-a-ride problems (Q1698288) (← links)
• A unified matheuristic for solving multi-constrained traveling salesman problems with profits (Q1707083) (← links)
• Vehicle routing with arrival time diversification (Q1711450) (← links)
• Heuristics for routing heterogeneous unmanned vehicles with fuel constraints (Q1717710) (← links)
• A time-based pheromone approach for the ant system (Q1758053) (← links)