Pages that link to "Item:Q297272"

The following pages link to An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem (Q297272):

Displaying 22 items.

• A variable neighborhood search for the multi-period collection of recyclable materials (Q320992) (← links)
• Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests (Q322826) (← links)
• An adaptive large neighborhood search for an E-grocery delivery routing problem (Q342326) (← links)
• The two-echelon multi-depot inventory-routing problem (Q1628063) (← links)
• An adaptive large neighbourhood search for asset protection during escaped wildfires (Q1652717) (← links)
• Electric vehicle routing problem with time-dependent waiting times at recharging stations (Q1738821) (← links)
• A metaheuristic for the time-dependent pollution-routing problem (Q1751914) (← links)
• A matheuristic method for the electric vehicle routing problem with time windows and fast chargers (Q1782172) (← links)
• Adaptive large neighborhood search algorithm for route planning of freight buses with pickup and delivery (Q1983730) (← links)
• A blood bank network design problem with integrated facility location, inventory and routing decisions (Q2005956) (← links)
• Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search (Q2030591) (← links)
• A variable neighborhood search based matheuristic for a waste cooking oil collection network design problem (Q2140329) (← links)
• The two-echelon inventory-routing problem with fleet management (Q2664298) (← links)
• The distributionally robust machine scheduling problem with job selection and sequence-dependent setup times (Q2664350) (← links)
• Cyclic inventory routing with dynamic safety stocks under recurring non-stationary interdependent demands (Q2668678) (← links)
• The traveling purchaser problem with fast service option (Q2669765) (← links)
• Combinatorial Heuristics for Inventory Routing Problems (Q5084657) (← links)
• A hybrid collaborative framework for integrated production scheduling and vehicle routing problem with batch manufacturing and soft time windows (Q6047896) (← links)
• On the zero-inventory-ordering policy in the inventory routing problem (Q6087504) (← links)
• A variable neighborhood search simheuristic for the multiperiod inventory routing problem with stochastic demands (Q6088245) (← links)
• A reactive simheuristic using online data for a real‐life inventory routing problem with stochastic demands (Q6090498) (← links)
• A general deep reinforcement learning hyperheuristic framework for solving combinatorial optimization problems (Q6112785) (← links)