The multi-vehicle probabilistic covering tour problem
From MaRDI portal
Publication:724092
DOI10.1016/j.ejor.2018.05.005zbMath1403.90131OpenAlexW2800157369WikidataQ129852185 ScholiaQ129852185MaRDI QIDQ724092
Güneş Erdoğan, Çağrı Koç, Ismail Karaoglan
Publication date: 25 July 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2018.05.005
Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)
Related Items (4)
An improved matheuristic for solving the electric vehicle routing problem with time windows and synchronized mobile charging/battery swapping ⋮ Integrating facility layout design and aisle structure in manufacturing systems: formulation and exact solution ⋮ Spatial coverage in routing and path planning problems ⋮ A location-or-routing problem with partial and decaying coverage
Uses Software
Cites Work
- Unnamed Item
- A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery
- The bi-objective covering tour problem
- The vehicle routing problem. Latest advances and new challenges.
- The attractive traveling salesman problem
- A result on projection for the vehicle routing problem
- Variable neighborhood search
- Solving the multi-vehicle multi-covering tour problem
- A survey of healthcare facility location
- The multi-vehicle cumulative covering tour problem
- Heuristics for the multi-vehicle covering tour problem
- An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices
- A variable neighborhood search heuristic for periodic routing problems
- OR/MS research in disaster operations management
- Projection results for vehicle routing
- A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit
- A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem
- Vehicle Routing
- Integer Programming Formulation of Traveling Salesman Problems
- A Bi-objective Metaheuristic for Disaster Relief Operation Planning
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- The Covering Tour Problem
- A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem
- Exact Algorithms for the Clustered Vehicle Routing Problem
- The orienteering problem with variable profits
This page was built for publication: The multi-vehicle probabilistic covering tour problem
