A heuristic approach to the overnight security service problem
From MaRDI portal
Publication:1868811
DOI10.1016/S0305-0548(02)00070-9zbMath1026.90018OpenAlexW1965594342WikidataQ115023237 ScholiaQ115023237MaRDI QIDQ1868811
Roberto Wolfler Calvo, Roberto Cordone
Publication date: 28 April 2003
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(02)00070-9
Related Items (28)
The \(k\)-dissimilar vehicle routing problem ⋮ Metaheuristics for the risk-constrained cash-in-transit vehicle routing problem ⋮ Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services ⋮ A large neighbourhood metaheuristic for the risk-constrained cash-in-transit vehicle routing problem ⋮ Minimization of the total traveling distance and maximum distance by using a transformed-based encoding EDA to solve the multiple traveling salesmen problem ⋮ A polynomial algorithm with asymptotic ratio $2/3$ for the asymmetric maximization version of the $m$-PSP ⋮ The secure time-dependent vehicle routing problem with uncertain demands ⋮ The vehicle routing problem with arrival time diversification on a multigraph ⋮ Strategies for Generating Well Centered Tetrahedral Meshes on Industrial Geometries ⋮ Finding \(K\) dissimilar paths: single-commodity and discretized flow formulations ⋮ Safe and secure vehicle routing: a survey on minimization of risk exposure ⋮ Finding shortest and dissimilar paths ⋮ The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions ⋮ A cash transportation vehicle routing problem with combinations of different cash denominations ⋮ Secure and efficient routing on nodes, edges, and arcs of simple‐graphs and of multi‐graphs ⋮ Lower and upper bounds for the \(m\)-peripatetic vehicle routing problem ⋮ A biobjective decision model to increase security and reduce travel costs in the cash-in-transit sector ⋮ On the asymptotic optimality of an algorithm for solving the maximum \(m\)-PSP in a multidimensional Euclidean space ⋮ Vehicle routing with arrival time diversification ⋮ Combinatorial algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graph ⋮ The undirected \(m\)-capacitated peripatetic salesman problem ⋮ Branch-and-cut algorithms for the undirected \(m\)-Peripatetic Salesman Problem ⋮ A 2-Approximation Algorithm for the Metric 2-Peripatetic Salesman Problem ⋮ A risk-constrained time-dependent cash-in-transit routing problem in multigraph under uncertainty ⋮ The multiple shortest path problem with path deconfliction ⋮ Heuristiques pour le Problème du Vendeurm-Péripatétique ⋮ A Polynomial 3/5-Approximate Algorithm for the Asymmetric Maximization Version of the 3-PSP ⋮ Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving capacitated clustering problems
- Heuristics for the multi-vehicle covering tour problem
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks
- The Covering Tour Problem
- A heuristic for the vehicle routing problem with time windows
This page was built for publication: A heuristic approach to the overnight security service problem
