Pages that link to "Item:Q336781"

The following pages link to An adaptive large neighborhood search for a vehicle routing problem with multiple routes (Q336781):

Displaying 37 items.

• Elective course student sectioning at Danish high schools (Q284401) (← links)
• Decomposition based hybrid metaheuristics (Q319285) (← links)
• An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization (Q323288) (← links)
• Minimum cost VRP with time-dependent speed data and congestion charge (Q337447) (← links)
• Dynamic design of sales territories (Q337456) (← links)
• An adaptive large neighborhood search for an E-grocery delivery routing problem (Q342326) (← links)
• The dynamic dispatch waves problem for same-day delivery (Q724132) (← links)
• An adaptive large neighborhood search for the discrete and continuous berth allocation problem (Q1651633) (← links)
• An iterated local search for the traveling salesman problem with release dates and completion time minimization (Q1651639) (← links)
• The multiple trip vehicle routing problem with backhauls: formulation and a two-level variable neighbourhood search (Q1652112) (← links)
• An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen (Q1652283) (← links)
• An adaptive large neighbourhood search for asset protection during escaped wildfires (Q1652717) (← links)
• Order matters -- a variable neighborhood search for the swap-body vehicle routing problem (Q1694919) (← links)
• A two-echelon inventory routing problem for perishable products (Q1738829) (← links)
• A general framework for assessing the value of social data for disaster response logistics planning (Q1750460) (← links)
• The pickup and delivery traveling salesman problem with handling costs (Q1752776) (← links)
• An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem (Q1762031) (← links)
• A comparison of three metaheuristics for the workover rig routing problem (Q1926698) (← links)
• A hybrid algorithm for time-dependent vehicle routing problem with time windows (Q2027083) (← links)
• Two-echelon vehicle routing problem with satellite bi-synchronization (Q2028760) (← links)
• Multi-trip time-dependent vehicle routing problem with time windows (Q2029965) (← links)
• Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search (Q2030591) (← links)
• Learning surrogate functions for the short-horizon planning in same-day delivery problems (Q2117229) (← links)
• The fish feed production routing problem (Q2147087) (← links)
• Scheduling unrelated additive manufacturing machines with practical constraints (Q2147124) (← links)
• A waste collection problem with service type option (Q2160512) (← links)
• Adaptive large neighborhood search for the commodity constrained split delivery VRP (Q2329717) (← links)
• The consultation timetabling problem at Danish high schools (Q2359151) (← links)
• The traveling purchaser problem with fast service option (Q2669765) (← links)
• A sample average approximation approach for the stochastic dial-a-ride problem on a multigraph with user satisfaction (Q2672126) (← links)
• Оптимальное планирование пассажирских перевозок в региональной авиатранспортной сети (Q5141814) (← links)
• A two‐tier urban delivery network with robot‐based deliveries (Q6065839) (← links)
• Split-demand multi-trip vehicle routing problem with simultaneous pickup and delivery in airport baggage transit (Q6087499) (← links)
• The vehicle routing problem with time windows and flexible delivery locations (Q6112699) (← links)
• Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows (Q6113315) (← links)
• A survey of attended home delivery and service problems with a focus on applications (Q6142935) (← links)
• Hybridizations of evolutionary algorithms with large neighborhood search (Q6158769) (← links)