Pages that link to "Item:Q1687688"
From MaRDI portal
The following pages link to A variable neighborhood search algorithm for the capacitated vehicle routing problem (Q1687688):
Displaying 21 items.
- Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem (Q421467) (← links)
- A hybrid bat algorithm with path relinking for capacitated vehicle routing problem (Q459876) (← links)
- An optimization algorithm for solving the rich vehicle routing problem based on variable neighborhood search and tabu search metaheuristics (Q491075) (← links)
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems (Q875422) (← links)
- A variable neighborhood search for the capacitated arc routing problem with intermediate facilities (Q953311) (← links)
- A variable MIP neighborhood descent algorithm for managing inventory and distribution of cash in automated Teller machines (Q1652346) (← links)
- Order matters -- a variable neighborhood search for the swap-body vehicle routing problem (Q1694919) (← links)
- Cooperative versus non-cooperative parallel variable neighborhood search strategies: a case study on the capacitated vehicle routing problem (Q2022213) (← links)
- A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem (Q2240058) (← links)
- A new efficient approach for solving the capacitated vehicle routing problem using the gravitational emulation local search algorithm (Q2294011) (← 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)
- Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem (Q2508207) (← links)
- A variable neighborhood search algorithm for the vehicle routing problem with multiple trips (Q2631286) (← links)
- A variable neighborhood search for solving the multi-vehicle covering tour problem (Q2631288) (← links)
- Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS (Q2669792) (← links)
- Hybrid scatter search algorithm for capacitated vehicle routing problem (Q2992371) (← links)
- Solving the capacitated vehicle routing problem using the ALGELECT electrostatic algorithm (Q3612220) (← links)
- A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem (Q4411206) (← links)
- Advances in Neural Networks – ISNN 2005 (Q5706987) (← links)
- A novel variable neighborhood strategy adaptive search for SALBP-2 problem with a limit on the number of machine's types (Q6170690) (← links)