Scheduled penalty variable neighborhood search

DOI10.1016/j.cor.2013.12.004zbMath1348.90647OpenAlexW2031321347MaRDI QIDQ337204

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

zbMATH Keywords

variable neighborhood searchorienteering problem with time windowsscheduled penaltytraveling salesman problem with time windows

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (1)

Multi-period orienteering with uncertain adoption likelihood and waiting at customers

Uses Software

• GLOB
• LINPACK
• OptimJ

Cites Work

• Unnamed Item
• A general VNS heuristic for the traveling salesman problem with time windows
• Annealing a genetic algorithm for constrained optimization
• The orienteering problem: a survey
• Heuristics for the multi-period orienteering problem with multiple time windows
• Iterated local search for the team orienteering problem with time windows
• Delivery strategies for blood products supplies
• General variable neighborhood search for the continuous optimization
• Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming
• The oracle penalty method
• Extended ant colony optimization for non-convex mixed integer nonlinear programming
• A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties
• Variable neighbourhood search: Methods and applications
• Topics in real-time fleet management
• A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
• Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art
• Variable neighborhood search
• The optimal packing of arbitrarily-shaped polygons using simulated annealing and polynomial-time cooling schedules
• Bees algorithm for generalized assignment problem
• Beam-ACO for the travelling salesman problem with time windows
• A variable neighborhood search heuristic for periodic routing problems
• 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 Traveling Salesman Problem with Time Windows
• New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows
• Exploiting Tabu Search Memory in Constrained Problems
• A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• A Tabu-Search Heuristic for the Capacitated Lot-Sizing Problem with Set-up Carryover
• A Variable Neighborhood Search Approach for the Two-Echelon Location-Routing Problem
• The Orienteering Problem with Time Windows
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• A Genetic Algorithm for the Multiple-Choice Integer Program
• A unified tabu search heuristic for vehicle routing problems with time windows
• A Tabu Search Heuristic for the Vehicle Routing Problem
• An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
• The Vehicle Routing Problem with Time Windows Part II: Genetic Search
• Adaptive Penalty Methods for Genetic Optimization of Constrained Combinatorial Problems
• An efficient General Variable Neighborhood Search for large Travelling Salesman Problem with Time Windows
• A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
• Convergence in Probability of Compressed Annealing

This page was built for publication: Scheduled penalty variable neighborhood search