https://faculty.biu.ac.il/~shnaidh/zooloo/trnsprt2/Location-routing-%20Issues,%20models%20and%20methods.pdf

Location-routing: Issues, models and methods

The orienteering problem: A survey

Variable neighbourhood search (VNS) is a metaheuristic, or a framework for building heuristics, based upon systematic changes of neighbourhoods both in descent phase, to find a local minimum, and in perturbation phase to emerge from the corresponding valley It was first proposed in 1997 and has since then rapidly developed both in its methods and its applications In the present paper, these two aspects are thoroughly reviewed and an extensive bibliography is provided Moreover, one section is devoted to newcomers It consists of steps for developing a heuristic for any particular problem Those steps are common to the implementation of other metaheuristics

Variable neighbourhood search: methods and applications

Variable neighbourhood search (VNS) is a metaheuristic, or a framework for building heuristics, based upon systematic changes of neighbourhoods both in descent phase, to find a local minimum, and in perturbation phase to emerge from the corresponding valley. It was first proposed in 1997 and has since then rapidly developed both in its methods and its applications. In the present paper, these two aspects are thoroughly reviewed and an extensive bibliography is provided. Moreover, one section is devoted to newcomers. It consists of steps for developing a heuristic for any particular problem. Those steps are common to the implementation of other metaheuristics.

https://ink.library.smu.edu.sg/cgi/viewcontent.cgi?article=4273&context=sis_research

Orienteering Problem: A survey of recent variants, solution approaches and applications

In the Ring Star Problem, the aim is to locate a simple cycle through a subset of vertices of a graph with the objective of minimizing the sum of two costs: a ring cost proportional to the length of the cycle and an assignment cost from the vertices not in the cycle to their closest vertex on the cycle. The problem has several applications in telecommunications network design and in rapid transit systems planning. It is an extension of the classical location–allocation problem introduced in the early 1960s, and closely related versions have been recently studied by several authors. This article formulates the problem as a mixed-integer linear program and strengthens it with the introduction of several families of valid inequalities. These inequalities are shown to be facet-defining and are used to develop a branch-and-cut algorithm. Computational results show that instances involving up to 300 vertices can be solved optimally using the proposed methodology. © 2004 Wiley Periodicals, Inc.

The Ring Star Problem: Polyhedral analysis and exact algorithm

Locating median cycles in networks

Variable neighborhood tabu search and its application to the median cycle problem

Several problems arising in transportation and telecommunications can be cast in terms of optimally locating a cycle in a graph. This paper proposes a classification of cycle location problems under two main headings. In Hamiltonian problems, all vertices of the graph must belong to the cycle. The most important cases are the traveling salesman problem (TSP), the TSP with precedence constraints, the clustered TSP, the TSP with backhauls, the TSP with time windows, several classes of pickup and delivery problems, and stochastic TSPs. In non-Hamiltonian problems, only a subset of vertices must be visited. These problems include the generalized TSP, the covering tour problem, the median cycle and ring star problems, and several cycle location problems with revenues. These problems are modeled within a unified framework and algorithmic strategies are provided, together with computational results. Several applications are also described. © 2007 Wiley Periodicals, Inc. NETWORKS, Vol. 50(1), 92–108 2007

Locating a cycle in a transportation or a telecommunications network

Estudio de los Problemas del Ciclo Mediana (MCP), consistentes en ubicar en un grafo completo mixto un ciclo que visita un determinado vertice, teniendo en cuenta el costo total de establecimiento del ciclo y el costo total de accesibilidad al mismo, definiendose este ultimo como la suma de las distancias de los vertices no visitados al ciclo. Se presenta y describe una nueva tecnica metaheuristica denominada Busqueda Tabu de Entorno Variable (VNTS) para la resolucion de los MCP.

Inmaculada Rodríguez Martín

Papers

The Ring Star Problem: Polyhedral analysis and exact algorithm

Locating median cycles in networks

Variable neighborhood tabu search and its application to the median cycle problem

Locating a cycle in a transportation or a telecommunications network

Cycle location problems