Pages that link to "Item:Q5278229"

The following pages link to Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem (Q5278229):

Displaying 32 items.

• Variable neighborhood search accelerated column generation for the nurse rostering problem (Q1687629) (← links)
• Empirical study of variable neighbourhood search applied to the optimization of the internal delivery vehicles at maritime container terminals (Q1687662) (← links)
• Computation of optimum type-II progressively hybrid censoring schemes using variable neighborhood search algorithm (Q1694485) (← links)
• Variable neighborhood search: basics and variants (Q1707084) (← links)
• Solving the maximum min-sum dispersion by alternating formulations of two different problems (Q1753455) (← links)
• Less is more: general variable neighborhood search for the capacitated modular hub location problem (Q2002852) (← links)
• A parallel variable neighborhood search for solving covering salesman problem (Q2070124) (← links)
• An efficient heuristic for a hub location routing problem (Q2070128) (← links)
• Solving the traveling delivery person problem with limited computational time (Q2103948) (← links)
• A cumulative unmanned aerial vehicle routing problem approach for humanitarian coverage path planning (Q2116920) (← links)
• Variable neighborhood search based algorithms to solve a rich \(k\)-travelling repairmen problem (Q2228400) (← links)
• A survey on the applications of variable neighborhood search algorithm in healthcare management (Q2240705) (← links)
• Analysis of variable neighborhood descent as a local search operator for total weighted tardiness problem on unrelated parallel machines (Q2297569) (← links)
• A hybrid ant colony optimization-variable neighborhood descent approach for the cumulative capacitated vehicle routing problem (Q2669499) (← links)
• Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS (Q2669792) (← links)
• In-depth analysis of granular local search for capacitated vehicle routing (Q2686133) (← links)
• Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem (Q2691195) (← links)
• A Variable Neighborhood Search Algorithm for Cost-Balanced Travelling Salesman Problem (Q5011677) (← links)
• Efficient metaheuristics for the home (health)-care routing and scheduling problem with time windows and synchronized visits (Q6063509) (← links)
• Variable neighborhood search for the single machine scheduling problem to minimize the total early work (Q6063510) (← links)
• General variable neighborhood search for the parallel machine scheduling problem with two common servers (Q6063516) (← links)
• Less is more approach: basic variable neighborhood search for the obnoxious <i>p</i>‐median problem (Q6066720) (← links)
• Multiple traveling salesperson problem with drones: general variable neighborhood search approach (Q6068716) (← links)
• Heuristics for the capacitated dispersion problem (Q6070413) (← links)
• The uncapacitated <i>r</i>‐allocation <i>p</i>‐hub center problem (Q6070875) (← links)
• Multi‐mode resource‐constrained project scheduling using modified variable neighborhood search heuristic (Q6088236) (← links)
• A variable neighborhood search for flying sidekick traveling salesman problem (Q6088243) (← links)
• VNS methods for home care routing and scheduling problem with temporal dependencies, and multiple structures and specialties (Q6088244) (← links)
• Covering delivery problem with electric vehicle and parcel lockers: variable neighborhood search approach (Q6106570) (← links)
• Variable neighborhood search: the power of change and simplicity (Q6164603) (← links)
• Minimizing the makespan on two parallel machines with a common server in charge of loading and unloading operations (Q6568449) (← links)
• The multiobjective traveling salesman-repairman problem with profits: design and implementation of a variable neighborhood descent algorithm for a real scenario (Q6609709) (← links)