The multi-vehicle probabilistic covering tour problem
type: Item
instance of: scholarly article
title: The multi-vehicle probabilistic covering tour problem
zbMATH Open document ID: 1403.90131
author: Ismail Karaoglan
author: Güneş Erdogăn
author: Çağrı Koç
published in: European Journal of Operational Research
publication date: 2018-07-25T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 6910100
zbMATH Keywords: vehicle routing
zbMATH Keywords: covering tour
zbMATH Keywords: linearization
zbMATH Keywords: integer programming
zbMATH Keywords: branch-and-cut
describes a project that uses: VRPLIB
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: j.ejor.2018.05.005
OpenAlex ID: W2800157369
cites work: A survey of healthcare facility location
cites work: A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem
cites work: OR/MS research in disaster operations management
cites work: Exact Algorithms for the Clustered Vehicle Routing Problem
cites work: Q3523238
cites work: A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem
cites work: The attractive traveling salesman problem
cites work: The orienteering problem with variable profits
cites work: Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
cites work: The multi-vehicle cumulative covering tour problem
cites work: The Covering Tour Problem
cites work: The vehicle routing problem. Latest advances and new challenges.
cites work: A result on projection for the vehicle routing problem
cites work: An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices
cites work: Heuristics for the multi-vehicle covering tour problem
cites work: A variable neighborhood search heuristic for periodic routing problems
cites work: The bi-objective covering tour problem
cites work: A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery
cites work: Projection results for vehicle routing
cites work: Integer Programming Formulation of Traveling Salesman Problems
cites work: Variable neighborhood search
cites work: A Bi-objective Metaheuristic for Disaster Relief Operation Planning
cites work: Solving the multi-vehicle multi-covering tour problem
cites work: A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit
cites work: Vehicle Routing
Wikidata QID: Q129852185
DOI: 10.1016/J.EJOR.2018.05.005
description: scientific article; zbMATH DE number 6910100