Pages that link to "Item:Q3057120"
From MaRDI portal
The following pages link to Edge assembly-based memetic algorithm for the capacitated vehicle routing problem (Q3057120):
Displaying 21 items.
- A hybrid algorithm for a class of vehicle routing problems (Q336559) (← links)
- Statistical analysis of distance-based path relinking for the capacitated vehicle routing problem (Q336737) (← links)
- Technical note: Split algorithm in \(O(n)\) for the capacitated vehicle routing problem (Q342313) (← links)
- A library of local search heuristics for the vehicle routing problem (Q708775) (← links)
- An integration of Lagrangian split and VNS: the case of the capacitated vehicle routing problem (Q1652121) (← links)
- An iterated tabu search for the multi-compartment vehicle routing problem (Q1652237) (← links)
- A problem-reduction evolutionary algorithm for solving the capacitated vehicle routing problem (Q1664832) (← links)
- Knowledge-guided local search for the vehicle routing problem (Q1722960) (← links)
- New benchmark instances for the capacitated vehicle routing problem (Q1752871) (← links)
- A new efficient approach for solving the capacitated vehicle routing problem using the gravitational emulation local search algorithm (Q2294011) (← links)
- A memetic algorithm for the multiperiod vehicle routing problem with profit (Q2355888) (← links)
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
- A unified solution framework for multi-attribute vehicle routing problems (Q2514767) (← links)
- Implicit depot assignments and rotations in vehicle routing heuristics (Q2514807) (← links)
- An iterated local search algorithm for the vehicle routing problem with backhauls (Q2514876) (← links)
- Exact and hyper‐heuristic solutions for the distribution‐installation problem from the VeRoLog 2019 challenge (Q6092665) (← links)
- Hybrid genetic algorithm for undirected traveling salesman problems with profits (Q6139377) (← links)
- Metaheuristics with variable diversity control and neighborhood search for the heterogeneous site-dependent multi-depot multi-trip periodic vehicle routing problem (Q6164388) (← links)
- Memetic search for the minmax multiple traveling salesman problem with single and multiple depots (Q6167324) (← links)
- A hybrid genetic algorithm for the Hamiltonian <i>p</i>‐median problem (Q6196877) (← links)
- A feasibility-preserved quantum approximate Solver for the capacitated vehicle routing problem (Q6588867) (← links)