Scheduled penalty variable neighborhood search
From MaRDI portal
(Redirected from Publication:337204)
Recommendations
Cites work
- scientific article; zbMATH DE number 6676558 (Why is no real title available?)
- A Genetic Algorithm for the Multiple-Choice Integer Program
- A Tabu Search Heuristic for the Vehicle Routing Problem
- A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
- A compressed-annealing heuristic for the traveling salesman problem with time windows
- A general VNS heuristic for the traveling salesman problem with time windows
- A generalized insertion heuristic for the travelling salesman problem with time windows
- A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties
- A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem
- A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- A tabu-search heuristic for the capacitated lot-sizing problem with set-up carryover
- A unified tabu search heuristic for vehicle routing problems with time windows
- A variable neighborhood search approach for the two-echelon location-routing problem
- A variable neighborhood search heuristic for periodic routing problems
- Adaptive Penalty Methods for Genetic Optimization of Constrained Combinatorial Problems
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
- An efficient general variable neighborhood search for large travelling salesman problem with time windows
- Annealing a genetic algorithm for constrained optimization
- Beam-ACO for the travelling salesman problem with time windows
- Bees algorithm for generalized assignment problem
- Convergence in Probability of Compressed Annealing
- Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming
- Delivery strategies for blood products supplies
- Exploiting tabu search memory in constrained problems
- Extended ant colony optimization for non-convex mixed integer nonlinear programming
- General variable neighborhood search for the continuous optimization
- Heuristics for the multi-period orienteering problem with multiple time windows
- Iterated local search for the team orienteering problem with time windows
- New state-space relaxations for solving the traveling salesman problem with time windows
- The Orienteering Problem with Time Windows
- The Vehicle Routing Problem with Time Windows Part II: Genetic Search
- The optimal packing of arbitrarily-shaped polygons using simulated annealing and polynomial-time cooling schedules
- The oracle penalty method
- The orienteering problem: a survey
- The second generation of self-organizing adaptive penalty strategy for constrained genetic search
- Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art
- Topics in real-time fleet management
- Variable neighborhood search
- Variable neighbourhood search: Methods and applications
This page was built for publication: Scheduled penalty variable neighborhood search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337204)
