Dissimilar arc routing problems
From MaRDI portal
Recommendations
- The k-dissimilar vehicle routing problem
- Arc routing for parking enforcement officers: exact and heuristic solutions
- The vehicle routing problem with arrival time diversification on a multigraph
- scientific article; zbMATH DE number 956790
- Arc routing problems: A review of the past, present, and future
Cites work
- A branch and bound algorithm for symmetric 2-peripatetic salesman problems
- A heuristic approach to the overnight security service problem
- A large neighbourhood metaheuristic for the risk-constrained cash-in-transit vehicle routing problem
- A survey on matheuristics for routing problems
- Branch-and-cut algorithms for the undirected m-Peripatetic Salesman Problem
- Handbooks in operations Research \& management science: Transportation
- scientific article; zbMATH DE number 3485514 (Why is no real title available?)
- Lower and upper bounds for the m-peripatetic vehicle routing problem
- Lower bounds for symmetricK-peripatetic salesman problems
- Lower bounds for the mixed capacitated arc 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
- On the generalized 2-peripatetic salesman problem
- The k-dissimilar vehicle routing problem
- The undirected \(m\)-capacitated peripatetic salesman problem
Cited in
(2)
This page was built for publication: Dissimilar arc routing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6496354)