The multi-vehicle probabilistic covering tour problem
DOI10.1016/J.EJOR.2018.05.005zbMATH Open1403.90131OpenAlexW2800157369WikidataQ129852185 ScholiaQ129852185MaRDI QIDQ724092FDOQ724092
Güneş Erdogăn, Ç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
Recommendations
- Solving the multi-vehicle multi-covering tour problem
- Heuristics for the multi-vehicle covering tour problem
- A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem
- An integration of mixed VND and VNS: the case of the multivehicle covering tour problem
- Iterative column generation algorithm for generalized multi-vehicle covering tour problem
Deterministic network models in operations research (90B10) Integer programming (90C10) Transportation, logistics and supply chain management (90B06)
Cites Work
- Integer Programming Formulation of Traveling Salesman Problems
- Handbooks in operations Research \& management science: Transportation
- A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery
- The vehicle routing problem. Latest advances and new challenges.
- Variable neighborhood search
- Heuristics for the multi-vehicle covering tour problem
- A variable neighborhood search heuristic for periodic routing problems
- The Covering Tour Problem
- The orienteering problem with variable profits
- A result on projection for the vehicle routing problem
- OR/MS research in disaster operations management
- Projection results for vehicle routing
- Vehicle Routing
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem
- The attractive traveling salesman problem
- 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
- A Bi-objective Metaheuristic for Disaster Relief Operation Planning
- Exact Algorithms for the Clustered Vehicle Routing Problem
- The bi-objective covering tour problem
- Solving the multi-vehicle multi-covering tour problem
- A survey of healthcare facility location
- The multi-vehicle cumulative covering tour problem
- An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices
Cited In (8)
- An integration of mixed VND and VNS: the case of the multivehicle covering tour problem
- 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
- The multi-vehicle cumulative covering tour problem
- A location-or-routing problem with partial and decaying coverage
- A flow-based model for the multivehicle covering tour problem with route balancing
- Solving the probabilistic profitable tour problem on a line
- Spatial coverage in routing and path planning problems
Uses Software
This page was built for publication: The multi-vehicle probabilistic covering tour problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q724092)
