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

DOI10.1016/0377-2217(94)90149-XMaRDI QIDQ1328602zbMATH OpenWikidataFDO

Authors John R. Current, David A. Schilling

Publication date 19 February 1995

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

zbMATH Keywords

NP-hardheuristic proceduredistributed computer networksbicriterion routing problemsmaximal covering tour problemmedian tour problemrealistically scaled problem

Mathematics Subject Classification ID

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

Recommendations

• Heuristics for the multi-vehicle covering tour problem
• The Covering Tour Problem
• A heuristic for the multiple tour maximum collection problem
• scientific article; zbMATH DE number 1149858
• Solving the multi-vehicle multi-covering tour problem

Cites work

• scientific article; zbMATH DE number 3898613 (Why is no real title available?)
• scientific article; zbMATH DE number 3694968 (Why is no real title available?)
• scientific article; zbMATH DE number 192876 (Why is no real title available?)
• AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM
• An Insert/Delete Heuristic for the Travelling Salesman Subset-Tour Problem with One Additional Constraint
• An interactive approach to identify the best compromise solution for two objective shortest path problems
• Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
• Multiobjective programming and planning
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• Solution of a Large-Scale Traveling-Salesman Problem
• The Covering Salesman Problem
• The orienteering problem
• The prize collecting traveling salesman problem
• The selective travelling salesman problem
• The shortest path problem with two objective functions

Cited in

(46)

• Using column generation to compute lower bound sets for bi-objective combinatorial optimization problems
• Metaheuristics and cooperative approaches for the bi-objective ring star problem
• Metaheuristics for the distance constrained generalized covering traveling salesman problem
• The Ring Star Problem: Polyhedral analysis and exact algorithm
• 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
• Online covering salesman problem
• The maximum covering/shortest path problem: A multiobjective network design and routing formulation
• Modelling and solving central cycle problems with integer programming.
• An efficient tabu search procedure for the \(p\)-median 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
• Location of paths on trees with minimal eccentricity and superior section
• General network design: a unified view of combined location and network design problems
• Exact algorithms for budgeted prize-collecting covering subgraph problems
• The bi-objective insular traveling salesman problem with maritime and ground transportation costs
• A logic-based Benders decomposition solution approach for two covering problems that consider the underlying transportation
• An efficient composite heuristic for the symmetric generalized traveling salesman problem
• Multiobjective routing problems
• A branch-and-cut algorithm for the maximum covering cycle problem
• Algorithms for the metric ring star problem with fixed edge-cost ratio
• Multicriteria tour planning for mobile healthcare facilities in a developing country
• The bi-objective stochastic covering tour problem
• The transit route arc-node service maximization problem
• Insertion heuristics for central cycle problems
• Time constrained maximal covering salesman problem with weighted demands and partial coverage
• A review of extensive facility location in networks
• Strategic route extension in transit networks
• The bi-objective covering tour problem
• Comparing different metaheuristic approaches for the median path problem with bounded length
• A heuristic for the multiple tour maximum collection problem
• A location-or-routing problem with partial and decaying coverage
• Exact and heuristic approaches for the cycle hub location problem
• A random-key genetic algorithm for the generalized traveling salesman problem
• A flow-based model for the multivehicle covering tour problem with route balancing
• From single-objective to multi-objective vehicle routing problems: motivations, case studies, and methods
• Multi-objective vehicle routing problems
• A data-driven optimization framework for routing mobile medical facilities
• The vehicle routing-allocation problem: A unifying framework
• Locating median cycles in networks
• Exact methods for mono-objective and bi-objective multi-vehicle covering tour problems
• Spatial coverage in routing and path planning problems
• The time constrained maximal covering salesman problem
• An integer programming-based local search for the covering salesman problem
• Facets of the \(p\)-cycle polytope
• Modeling and solving the two-level generalized median tour problem

This page was built for publication: The median tour and maximal covering tour problems: Formulations and heuristics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1328602)