Variable neighbourhood structures for cycle location problems
From MaRDI portal
Publication:1926979
DOI10.1016/j.ejor.2012.05.038zbMath1253.90136OpenAlexW2084359844MaRDI QIDQ1926979
Publication date: 29 December 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2012.05.038
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- A general VNS heuristic for the traveling salesman problem with time windows
- Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
- Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
- An effective VNS for the capacitated \(p\)-median problem
- A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows
- Variable neighbourhood search: methods and applications
- Setting a common due date in a constrained flowshop: a variable neighbourhood search approach
- A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
- A population-based variable neighborhood search for the single machine total weighted tardiness problem
- The double traveling salesman problem with multiple stacks: A variable neighborhood search approach
- A review of extensive facility location in networks
- Variable neighborhood search
- Variable neighborhood tabu search and its application to the median cycle problem.
- Modelling and solving central cycle problems with integer programming.
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- A note on characterizing the \(k-OPT\) neighborhood via group theory
- Locating median cycles in networks
- A variable neighborhood search heuristic for periodic routing problems
- On the neighborhood structure of the traveling salesman problem generated by local search moves
- Solving the \(p\)-median problem with pos/neg weights by variable neighborhood search and some results for special cases
- Variable neighborhood search for the dial-a-ride problem
- A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows
- Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem
- Locating a cycle in a transportation or a telecommunications network
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- Variable neighborhood search for the p-median
- Efficient heuristics for Median Cycle Problems
- The Covering Salesman Problem
- A variable depth search algorithm with branching search for the generalized assignment problem
- Combinatorics of Compositions and Words
- A variable neighbourhood search algorithm for the constrained task allocation problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Variable neighborhood search: Principles and applications
This page was built for publication: Variable neighbourhood structures for cycle location problems
