Pages that link to "Item:Q1976826"

The following pages link to Record breaking optimization results using the ruin and recreate principle (Q1976826):

Displaying 30 items.

• New decomposition methods for home care scheduling with predefined visits (Q2289923) (← links)
• Handling fairness issues in time-relaxed tournaments with availability constraints (Q2289924) (← links)
• Vehicle routing with transportable resources: using carpooling and walking for on-site services (Q2315653) (← links)
• A heuristic algorithm for the free newspaper delivery problem (Q2355940) (← links)
• Multi-machine energy-aware scheduling (Q2397770) (← links)
• Adaptive large neighborhood search for the curriculum-based course timetabling problem (Q2398424) (← links)
• Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier (Q2422737) (← links)
• An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives (Q2467260) (← links)
• On the neighborhood structure of the traveling salesman problem generated by local search moves (Q2468271) (← links)
• Minimizing shifts for personnel task scheduling problems: a three-phase algorithm (Q2514834) (← links)
• Fast local search algorithms for the handicapped persons transportation problem (Q2573013) (← links)
• Search with evolutionary ruin and stochastic rebuild: a theoretic framework and a case study on exam timetabling (Q2630226) (← links)
• Large multiple neighborhood search for the soft-clustered vehicle-routing problem (Q2668597) (← links)
• Modeling and optimization of multiple traveling salesmen problems: an evolution strategy approach (Q2668611) (← links)
• Scheduling heterogeneous multi-load AGVs with battery constraints (Q2669605) (← links)
• Adaptive large neighborhood search for vehicle routing problems with transshipment facilities arising in city logistics (Q2669614) (← links)
• Centered $L_2$-discrepancy of random sampling and Latin hypercube design, and construction of uniform designs (Q2759097) (← links)
• A template-based adaptive large neighborhood search for the consistent vehicle routing problem (Q2811324) (← links)
• A generalized model and a heuristic algorithm for the large-scale covering tour problem (Q4553890) (← links)
• Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks (Q4648688) (← links)
• Hybridizing adaptive large neighborhood search with kernel search: a new solution approach for the nurse routing problem with incompatible services and minimum demand (Q6056092) (← links)
• Combining an LNS-based approach and organizational mining for the resource replacement problem (Q6065649) (← links)
• The intermittent travelling salesman problem (Q6066722) (← links)
• Large neighborhood search for the bike request scheduling problem (Q6069919) (← links)
• Metaheuristics: A Canadian Perspective (Q6102854) (← links)
• The vehicle routing problem with time windows and flexible delivery locations (Q6112699) (← links)
• Small and large neighborhood search for the park-and-loop routing problem with parking selection (Q6112711) (← links)
• Hybridizations of evolutionary algorithms with large neighborhood search (Q6158769) (← links)
• Hybridation de l’algorithme de colonie de Fourmis avec l’algorithme de recherche à grand Voisinage pour la résolution du VRPTW statique et dynamique (Q6160384) (← links)
• Efficient GRASP solution approach for the prisoner transportation problem (Q6164367) (← links)