Single vehicle routing with a predefined customer sequence and multiple depot returns
From MaRDI portal
Publication:2463499
Recommendations
- Stochastic single vehicle routing with a predefined customer sequence and multiple depot returns
- Single vehicle routing with predefined client sequence and multiple warehouse returns: the case of two warehouses
- Stochastic single vehicle routing problem with delivery and Pick up and a predefined customer sequence
- Single vehicle routing problems with a predefined customer sequence, compartmentalized load and stochastic demands
- Finite and infinite-horizon single vehicle routing problems with a predefined customer sequence and pickup and delivery
Cites work
- A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
- A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
- A stochastic and dynamic model for the single-vehicle pick-up and delivery problem
- A unified heuristic for a large class of vehicle routing problems with backhauls
- Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
- scientific article; zbMATH DE number 432754 (Why is no real title available?)
- scientific article; zbMATH DE number 49715 (Why is no real title available?)
- scientific article; zbMATH DE number 1128822 (Why is no real title available?)
- scientific article; zbMATH DE number 3895002 (Why is no real title available?)
- Hybrid metaheuristics for the vehicle routing problem with stochastic demands
- Optimization by simulated annealing
- Stochastic vehicle routing problem with restocking
- The vehicle routing problem
- The vehicle routing problem with pickups and deliveries on some special graphs
- The vehicle routing problem: An overview of exact and approximate algorithms
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
Cited in
(16)- Stochastic single vehicle routing with a predefined customer sequence and multiple depot returns
- Complexity results for an integrated single machine scheduling and outbound delivery problem with fixed sequence
- Buy online and pick up in-store: design of the service area
- Optimal a priori tour and restocking policy for the single-vehicle routing problem with stochastic demands
- A stochastic single vehicle routing problem with a predefined sequence of customers and collection of two similar materials
- Finite and infinite-horizon single vehicle routing problems with a predefined customer sequence and pickup and delivery
- Single vehicle routing with predefined client sequence and multiple warehouse returns: the case of two warehouses
- Stochastic single vehicle routing problem with delivery and Pick up and a predefined customer sequence
- Single vehicle routing problems with a predefined customer sequence, compartmentalized load and stochastic demands
- SINGLE VEHICLE ROUTING PROBLEMS WITH A PREDEFINED CUSTOMER ORDER, UNIFIED LOAD AND STOCHASTIC DISCRETE DEMANDS
- Vehicle routing problems with multiple trips
- Vehicle routing problems with multiple trips
- Exact and hyper‐heuristic solutions for the distribution‐installation problem from the VeRoLog 2019 challenge
- A near-optimal database allocation for reducing the average waiting time in the grid computing environment
- Integrated production and distribution scheduling with lifespan constraints
- A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands
This page was built for publication: Single vehicle routing with a predefined customer sequence and multiple depot returns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2463499)