Pages that link to "Item:Q4868786"

The following pages link to An Exchange Heuristic for Routeing Problems with Time Windows (Q4868786):

Displaying 50 items.

• Modelization of time-dependent urban freight problems by using a multiple number of distribution centers (Q262919) (← links)
• The vehicle-routing problem with time windows and driver-specific times (Q322409) (← links)
• An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics (Q339671) (← links)
• A sequential GRASP for the therapist routing and scheduling problem (Q398907) (← links)
• An optimization algorithm for solving the rich vehicle routing problem based on variable neighborhood search and tabu search metaheuristics (Q491075) (← links)
• Vehicle routing with compartments: applications, modelling and heuristics (Q657053) (← links)
• A two-phase hybrid metaheuristic for the vehicle routing problem with time windows (Q707148) (← links)
• On the tour planning problem (Q763203) (← 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)
• 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)
• Solving the mobile mapping van problem: a hybrid metaheuristic for capacitated arc routing with soft time windows (Q975995) (← links)
• A powerful route minimization heuristic for the vehicle routing problem with time windows (Q1038101) (← links)
• Approximative solutions to the bicriterion vehicle routing problem with time windows (Q1038402) (← links)
• A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows (Q1040973) (← links)
• Local search with annealing-like restarts to solve the VRPTW (Q1400662) (← links)
• Modeling rolling batch planning as vehicle routing problem with time windows. (Q1406729) (← links)
• A heuristic algorithm for solving hazardous materials distribution problems. (Q1412759) (← links)
• Vehicle routing-scheduling for waste collection in Hanoi (Q1582030) (← links)
• A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls (Q1607978) (← links)
• A hybrid genetic algorithm for the heterogeneous dial-a-ride problem (Q1652211) (← 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 GRASP+VND heuristic for the two-echelon vehicle routing problem arising in city logistics (Q1718582) (← links)
• Minimizing the maximal ergonomic burden in intra-hospital patient transportation (Q1734337) (← links)
• Active guided evolution strategies for large-scale vehicle routing problems with time windows (Q1764768) (← links)
• Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows (Q1788902) (← links)
• A route-neighborhood-based metaheuristic for vehicle routing problem with time windows (Q1806612) (← links)
• Tabu search heuristics for the vehicle routing problem with time windows. (Q1871417) (← links)
• A parallel hybrid genetic algorithm for the vehicle routing problem with time windows (Q1879791) (← links)
• A multi-start local search algorithm for the vehicle routing problem with time windows (Q1887956) (← links)
• Integrated planning of loaded and empty container movements (Q1944871) (← links)
• Granular tabu search for the pickup and delivery problem with time windows and electric vehicles (Q1999625) (← links)
• A multi-start local search heuristic for the green vehicle routing problem based on a multigraph reformulation (Q2003563) (← links)
• Self-imposed time windows in vehicle routing problems (Q2018105) (← links)
• Integrated planning for electric commercial vehicle fleets: a case study for retail mid-haul logistics networks (Q2030659) (← links)
• A two-stage hybrid heuristic solution for the container drayage problem with trailer reposition (Q2077914) (← links)
• A cooperative parallel metaheuristic for the capacitated vehicle routing problem (Q2257342) (← links)
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
• The mixed capacitated general routing problem under uncertainty (Q2629641) (← links)
• A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem (Q2630221) (← links)
• Adaptive large neighborhood search for vehicle routing problems with transshipment facilities arising in city logistics (Q2669614) (← links)
• An adaptive iterated local search heuristic for the heterogeneous fleet vehicle routing problem (Q2676358) (← links)
• COMPARISON OF SYSTEMS BASED ON EVOLUTIONARY SEARCH AND SIMULATED ANNEALING TO SOLVE THE VRPTW PROBLEM (Q3022133) (← links)
• Edge assembly-based memetic algorithm for the capacitated vehicle routing problem (Q3057120) (← links)
• Deriving Convergence of Vehicle Routing Problems using a Fictitious Play Approach (Q3534464) (← links)
• Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks (Q4648688) (← links)
• Variable neighborhood search for the stochastic and dynamic vehicle routing problem (Q5963105) (← links)
• Metaheuristics: A Canadian Perspective (Q6102854) (← links)