Pages that link to "Item:Q875422"

The following pages link to An efficient variable neighborhood search heuristic for very large scale vehicle routing problems (Q875422):

Displaying 35 items.

• Fleet design optimisation from historical data using constraint programming and large neighbourhood search (Q265693) (← links)
• Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints (Q319021) (← links)
• Testing local search move operators on the vehicle routing problem with split deliveries and time windows (Q337460) (← links)
• Algorithms for the maximum \(k\)-club problem in graphs (Q385488) (← links)
• A library of local search heuristics for the vehicle routing problem (Q708775) (← links)
• Solving the petroleum replenishment and routing problem with variable demands and time windows (Q827236) (← links)
• A variable-neighbourhood search algorithm for finding optimal run orders in the presence of serial correlation (Q953839) (← links)
• Variable neighbourhood search: methods and applications (Q970194) (← links)
• An adaptive memory algorithm for the split delivery vehicle routing problem (Q972645) (← links)
• Multi-objective redundancy allocation optimization using a variable neighborhood search algorithm (Q972655) (← links)
• Variable neighbourhood search: Methods and applications (Q1029572) (← links)
• An adaptive large neighborhood search for relocating vehicles in electric carsharing services (Q1634774) (← links)
• Adaptive large neighborhood search on the graphics processing unit (Q1711444) (← links)
• Efficiently solving very large-scale routing problems (Q1738815) (← links)
• Collaborative vehicle routing: a survey (Q1754297) (← links)
• A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints (Q1761159) (← links)
• Variable neighbourhood structures for cycle location problems (Q1926979) (← links)
• A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times (Q1935881) (← links)
• Optimization of product category allocation in multiple warehouses to minimize splitting of online supermarket customer orders (Q2029376) (← links)
• An effective iterated two-stage heuristic algorithm for the multiple traveling salesmen problem (Q2147041) (← links)
• A cooperative parallel metaheuristic for the capacitated vehicle routing problem (Q2257342) (← links)
• Neighborhood structures for the container loading problem: a VNS implementation (Q2267814) (← links)
• A nonlinear multidimensional knapsack problem in the optimal design of mixture experiments (Q2329497) (← links)
• Bilayer local search enhanced particle swarm optimization for the capacitated vehicle routing problem (Q2331412) (← links)
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
• Dynamic vehicle routing using an improved variable neighborhood search algorithm (Q2375629) (← links)
• A variable neighbourhood search algorithm for the open vehicle routing problem (Q2378421) (← links)
• An iterated local search algorithm for the vehicle routing problem with backhauls (Q2514876) (← links)
• A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit (Q2630092) (← links)
• New variable-length data compression scheme for solution representation of meta-heuristics (Q2668691) (← links)
• On the integrated charge planning with flexible jobs in primary steelmaking processes (Q3163146) (← links)
• An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems (Q3564361) (← links)
• Robust Data-Driven Vehicle Routing with Time Windows (Q4994169) (← links)
• Variable neighborhood search for the stochastic and dynamic vehicle routing problem (Q5963105) (← links)
• Formulating and solving integrated order batching and routing in multi-depot AGV-assisted mixed-shelves warehouses (Q6109817) (← links)