The probabilistic uncapacitated open vehicle routing location problem
From MaRDI portal
Recommendations
- Multi-depot traveling salesmen location problems on networks with special structure
- Probabilistic a priori routing-location problems
- Probabilistic Sales-Delivery Man and Sales-Delivery Facility Location Problems on a Tree
- The Capacitated Traveling Salesman Location Problem
- Minisum location of a traveling salesman
Cites work
- A Heuristic Algorithm for the Traveling Salesman Location Problem on Networks
- A hybrid evolution strategy for the open vehicle routing problem
- A multi-start algorithm for a balanced real-world open vehicle routing problem
- A survey of recent research on location-routing problems
- A taxonomical analysis, current methods and objectives on location-routing problems
- A variable neighbourhood search algorithm for the open vehicle routing problem
- An ILP improvement procedure for the open vehicle routing problem
- An improved formulation for the multi-depot open vehicle routing problem
- Approximation algorithms for VRP with stochastic demands
- Minisum location of a traveling salesman
- Modeling uncertainty. An examination of stochastic theory, methods, and applications
- Probabilistic a priori routing-location problems
- Probabilistic Sales-Delivery Man and Sales-Delivery Facility Location Problems on a Tree
- The open vehicle routing problem with decoupling points
- The open vehicle routing problem: algorithms, large-scale test problems, and computational results
- Traveling Salesman Facility Location Problems
This page was built for publication: The probabilistic uncapacitated open vehicle routing location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6179724)