The median tour and maximal covering tour problems: Formulations and heuristics

DOI10.1016/0377-2217(94)90149-XzbMath0806.90036WikidataQ58615081 ScholiaQ58615081MaRDI QIDQ1328602

Publication date: 19 February 1995

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

NP-hard heuristic procedure distributed computer networks bicriterion routing problems maximal covering tour problem median tour problem realistically scaled problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

An integration of mixed VND and VNS: the case of the multivehicle covering tour problem, Column generation algorithms for bi-objective combinatorial optimization problems with a min-max objective, Metaheuristics for the distance constrained generalized covering traveling salesman problem, Covering part of a planar network, A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem, Locating median cycles in networks, The time constrained maximal covering salesman problem, Exact algorithms for budgeted prize-collecting covering subgraph problems, A random-key genetic algorithm for the generalized traveling salesman problem, The bi-objective insular traveling salesman problem with maritime and ground transportation costs, Time constrained maximal covering salesman problem with weighted demands and partial coverage, Metaheuristics and cooperative approaches for the bi-objective ring star problem, The bi-objective covering tour problem, Multiobjective routing problems, General network design: a unified view of combined location and network design problems, Exact and heuristic approaches for the cycle hub location problem, A logic-based Benders decomposition solution approach for two covering problems that consider the underlying transportation, The transit route arc-node service maximization problem, A data-driven optimization framework for routing mobile medical facilities, Modelling and solving central cycle problems with integer programming., Comparing different metaheuristic approaches for the median path problem with bounded length, Online covering salesman problem, From Single-Objective to Multi-Objective Vehicle Routing Problems: Motivations, Case Studies, and Methods, Multi-objective vehicle routing problems, An integer programming-based local search for the covering salesman problem, The bi-objective stochastic covering tour problem, Facets of the \(p\)-cycle polytope, Insertion heuristics for central cycle problems, A branch-and-cut algorithm for the maximum covering cycle problem, Exact methods for mono-objective and bi-objective multi-vehicle covering tour problems, Algorithms for the metric ring star problem with fixed edge-cost ratio, The vehicle routing-allocation problem: A unifying framework, A review of extensive facility location in networks, An efficient tabu search procedure for the \(p\)-median problem, Location of paths on trees with minimal eccentricity and superior section, The Ring Star Problem: Polyhedral analysis and exact algorithm, Spatial coverage in routing and path planning problems, Using column generation to compute lower bound sets for bi-objective combinatorial optimization problems, An efficient composite heuristic for the symmetric generalized traveling salesman problem, A location-or-routing problem with partial and decaying coverage, Strategic route extension in transit networks

Cites Work