Variable neighbourhood structures for cycle location problems
type: Item
instance of: scholarly article
title: Variable neighbourhood structures for cycle location problems
zbMATH Open document ID: 1253.90136
author: John D. Lamb
published in: European Journal of Operational Research
publication date: 2012-12-29T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6119549
zbMATH Keywords: heuristics
zbMATH Keywords: variable neighbourhood search
zbMATH Keywords: circuit
zbMATH Keywords: cycle
describes a project that uses: TSPLIB
MaRDI profile type: Publication
full work available at URL: j.ejor.2012.05.038
OpenAlex ID: W2084359844
cites work: A reactive variable neighborhood search for the vehicle-routing problem with time windows
cites work: A note on characterizing the \(k-OPT\) neighborhood via group theory
cites work: Q4371290
cites work: The Covering Salesman Problem
cites work: A general VNS heuristic for the traveling salesman problem with time windows
cites work: Solving the \(p\)-median problem with pos/neg weights by variable neighborhood search and some results for special cases
cites work: The double traveling salesman problem with multiple stacks: A variable neighborhood search approach
cites work: An effective VNS for the capacitated \(p\)-median problem
cites work: Modelling and solving central cycle problems with integer programming.
cites work: Primal-dual variable neighborhood search for the simple plant-location problem
cites work: Variable neighborhood search for the p-median
cites work: Variable neighborhood search: Principles and applications
cites work: Variable neighbourhood search: methods and applications
cites work: An effective implementation of the Lin-Kernighan traveling salesman heuristic
cites work: A variable neighborhood search heuristic for periodic routing problems
cites work: Combinatorics of Compositions and Words
cites work: A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
cites work: An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
cites work: Locating median cycles in networks
cites work: Locating a cycle in a transportation or a telecommunications network
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: A variable neighbourhood search algorithm for the constrained task allocation problem
cites work: A review of extensive facility location in networks
cites work: Variable neighborhood search
cites work: Variable neighborhood tabu search and its application to the median cycle problem.
cites work: Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
cites work: A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows
cites work: Variable neighborhood search for the dial-a-ride problem
cites work: Setting a common due date in a constrained flowshop: a variable neighbourhood search approach
cites work: Efficient heuristics for Median Cycle Problems
cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem
cites work: Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
cites work: On the neighborhood structure of the traveling salesman problem generated by local search moves
cites work: A population-based variable neighborhood search for the single machine total weighted tardiness problem
cites work: A variable depth search algorithm with branching search for the generalized assignment problem
DOI: 10.1016/J.EJOR.2012.05.038
description: scientific article; zbMATH DE number 6119549