The multi-vehicle probabilistic covering tour problem

DOI10.1016/J.EJOR.2018.05.005MaRDI QIDQ724092zbMATH OpenOpenAlexWikidataFDO

Authors Ismail Karaoglan, Güneş Erdogăn, Çağrı Koç

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

zbMATH Keywords

integer programmingbranch-and-cutlinearizationvehicle routingcovering tour

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Integer programming (90C10) Transportation, logistics and supply chain management (90B06)

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

Cites work

• A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem
• A bi-objective metaheuristic for disaster relief operation planning
• A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery
• A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem
• A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit
• A result on projection for the vehicle routing problem
• A survey of healthcare facility location
• A variable neighborhood search heuristic for periodic routing problems
• An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices
• Exact algorithms for the clustered vehicle routing problem
• Handbooks in operations Research \& management science: Transportation
• Heuristics for the multi-vehicle covering tour problem
• Integer Programming Formulation of Traveling Salesman Problems
• OR/MS research in disaster operations management
• Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
• Projection results for vehicle routing
• Solving the multi-vehicle multi-covering tour problem
• The Covering Tour Problem
• The attractive traveling salesman problem
• The bi-objective covering tour problem
• The multi-vehicle cumulative covering tour problem
• The orienteering problem with variable profits
• The vehicle routing problem. Latest advances and new challenges.
• Variable neighborhood search
• Vehicle Routing

Cited in

(12)

• 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
• 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
• An improved formulation for the maximum coverage patrol routing problem
• Solving the multi-vehicle multi-covering tour problem
• The multi-vehicle cumulative covering tour problem
• A multi‐vehicle covering tour problem with speed optimization
• A location-or-routing problem with partial and decaying coverage
• A flow-based model for the multivehicle covering tour problem with route balancing
• Spatial coverage in routing and path planning problems
• Solving the probabilistic profitable tour problem on a line

Describes a project that uses

Uses Software

• VRPLIB
• VRP

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)