Scheduled penalty variable neighborhood search
DOI10.1016/J.COR.2013.12.004zbMATH Open1348.90647OpenAlexW2031321347MaRDI QIDQ337204FDOQ337204
Emanuele Manni, Barrett W. Thomas
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2013.12.004
Recommendations
variable neighborhood searchorienteering problem with time windowsscheduled penaltytraveling salesman problem with time windows
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art
- The Orienteering Problem with Time Windows
- An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
- The orienteering problem: a survey
- Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming
- Variable neighbourhood search: Methods and applications
- A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- A unified tabu search heuristic for vehicle routing problems with time windows
- A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
- Extended ant colony optimization for non-convex mixed integer nonlinear programming
- Variable neighborhood search
- A Genetic Algorithm for the Multiple-Choice Integer Program
- Adaptive Penalty Methods for Genetic Optimization of Constrained Combinatorial Problems
- Heuristics for the multi-period orienteering problem with multiple time windows
- Bees algorithm for generalized assignment problem
- A variable neighborhood search heuristic for periodic routing problems
- A Variable Neighborhood Search Approach for the Two-Echelon Location-Routing Problem
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- Iterated local search for the team orienteering problem with time windows
- Delivery strategies for blood products supplies
- A Tabu Search Heuristic for the Vehicle Routing Problem
- Exploiting tabu search memory in constrained problems
- Title not available (Why is that?)
- The Vehicle Routing Problem with Time Windows Part II: Genetic Search
- An efficient General Variable Neighborhood Search for large Travelling Salesman Problem with Time Windows
- General variable neighborhood search for the continuous optimization
- A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties
- Topics in real-time fleet management
- The optimal packing of arbitrarily-shaped polygons using simulated annealing and polynomial-time cooling schedules
- Beam-ACO for the travelling salesman problem with time windows
- A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem
- The second generation of self-organizing adaptive penalty strategy for constrained genetic search
- A generalized insertion heuristic for the travelling salesman problem with time windows
- New state-space relaxations for solving the traveling salesman problem with time windows
- A compressed-annealing heuristic for the traveling salesman problem with time windows
- A Tabu-Search Heuristic for the Capacitated Lot-Sizing Problem with Set-up Carryover
- A general VNS heuristic for the traveling salesman problem with time windows
- Convergence in Probability of Compressed Annealing
- Annealing a genetic algorithm for constrained optimization
- The oracle penalty method
Cited In (1)
Uses Software
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)
