The bi-objective covering tour problem
From MaRDI portal
Publication:868132
DOI10.1016/j.cor.2005.07.022zbMath1190.90044OpenAlexW2168723985MaRDI QIDQ868132
El-Ghazali Talbi, Frédéric Semet, Nicolas Jozefowiez
Publication date: 19 February 2007
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.07.022
Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20)
Related Items (23)
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 ⋮ A generalized model and a heuristic algorithm for the large-scale covering tour problem ⋮ A math-heuristic for the warehouse location-routing problem in disaster relief ⋮ Dimensionality reduction in multiobjective shortest path search ⋮ Time constrained maximal covering salesman problem with weighted demands and partial coverage ⋮ An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem ⋮ An \(\varepsilon \)-constraint column generation-and-enumeration algorithm for bi-objective vehicle routing problems ⋮ A branch-and-bound algorithm based on NSGAII for multi-objective mixed integer nonlinear optimization problems ⋮ Modelling beneficiaries' choice in disaster relief logistics ⋮ From Single-Objective to Multi-Objective Vehicle Routing Problems: Motivations, Case Studies, and Methods ⋮ Health Care Logistics, Emergency Preparedness, and Disaster Relief: New Challenges for Routing Problems with a Focus on the Austrian Situation ⋮ An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits ⋮ Multi-objective vehicle routing problems ⋮ The bi-objective stochastic covering tour problem ⋮ A heuristic two-phase solution approach for the multi-objective dial-a-ride problem ⋮ The multi-vehicle probabilistic covering tour problem ⋮ A branch-and-cut algorithm for the maximum covering cycle problem ⋮ Exact methods for mono-objective and bi-objective multi-vehicle covering tour problems ⋮ A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem ⋮ Spatial coverage in routing and path planning problems ⋮ Using column generation to compute lower bound sets for bi-objective combinatorial optimization problems ⋮ A location-or-routing problem with partial and decaying coverage
Cites Work
- Unnamed Item
- A genetic algorithm for the set covering problem
- The median tour and maximal covering tour problems: Formulations and heuristics
- Multiobjective routing problems
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- The Covering Tour Problem
- The Covering Salesman Problem
This page was built for publication: The bi-objective covering tour problem
