The vehicle routing problem
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- An optimisation-oriented model of distributed supply-chain
- Lasso solution strategies for the vehicle routing problem with pickups and deliveries
- A computer-enabled solution procedure for food wholesalers' distribution decision in cities with a circular transportation infrastructure
- Stochastic single vehicle routing with a predefined customer sequence and multiple depot returns
- Single-commodity vehicle routing problem with pickup and delivery service
- An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem
- The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
- Metaheuristics for vehicle routing problems with three-dimensional loading constraints
- The school bus routing problem: a review
- Solving a manpower scheduling problem for airline catering using metaheuristics
- Vehicle scheduling with combinable delivery and pickup operations
- The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method
- Using scenario trees and progressive hedging for stochastic inventory routing problems
- Implementation techniques for the vehicle routing problem
- A practical heuristic for a large scale vehicle routing problem
- The vehicle routing problem: An overview of exact and approximate algorithms
- Vehicle routing problem with trailers
- Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies.
- On the capacitated vehicle routing problem
- A decision support system for a real vehicle routing problem.
- Nearest route problem
- A new approach for solution of vehicle routing problem with hard time window: an application in a supermarket chain
- Vehicle dispatching for minimizing arrival conflicts in multi-supplier logistics network
- Evaluating the quality of online optimization algorithms by discrete event simulation
- The driver and vehicle routing problem
- Reformulations and branch-and-price algorithm for the minimum cost hop-and-root constrained forest problem
- Managing platelet supply through improved routing of blood collection vehicles
- Multiscale production routing in multicommodity supply chains with complex production facilities
- A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups
- Mathematical models for green vehicle routing problems with pickup and delivery: a case of semiconductor supply chain
- A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem
- The vehicle routing problem with service level constraints
- Multi-trip pickup and delivery problem with time windows and synchronization
- Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem
- A lexicographic approach for the bi-objective selective pickup and delivery problem with time windows and paired demands
- The separation problem of rounded capacity inequalities: some polynomial cases
- On the complexity of the separation problem for rounded capacity inequalities
- Vehicle routing problem for multiple product types, compartments, and trips with soft time windows
- The windy rural postman problem with a time-dependent zigzag option
- Making the most of fleets: a profit-maximizing multi-vehicle pickup and delivery selection problem
- The demand weighted vehicle routing problem
- Energy efficient ant colony algorithms for data aggregation in wireless sensor networks
- A time-based pheromone approach for the ant system
- A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints
- An integer programming-based local search for the covering salesman problem
- Restricted dynamic programming: a flexible framework for solving realistic VRPs
- Vehicle routing under time-dependent travel times: the impact of congestion avoidance
- Solving the vehicle routing problem with adaptive memory programming methodology
- A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
- Vehicle routing and appointment scheduling with team assignment for home services
- Algorithm for directing cooperative vehicles of a vehicle routing problem for improving fault-tolerance
- Two-echelon location routing synchronized with production schedules and time windows
- The vehicle routing-allocation problem: A unifying framework
- Stronger K-tree relaxations for the vehicle routing problem
- A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
- An interactive decision support system for the bank courier routing problem
- A look at the past and present of optimization - an editorial
- The single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach
- The close-open mixed vehicle routing problem
- Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints
- A mathematical formulation and heuristic approach for the heterogeneous fixed fleet vehicle routing problem with simultaneous pickup and delivery
- A hybrid VNS/tabu search algorithm for solving the vehicle routing problem with drones and en route operations
- Hybrid particle swarm optimization with genetic algorithm for solving capacitated vehicle routing problem with fuzzy demand - a case study on garbage collection system
- Vehicle routing problems with loading constraints: state-of-the-art and future directions
- Cooperative versus non-cooperative parallel variable neighborhood search strategies: a case study on the capacitated vehicle routing problem
- A hybrid algorithm for time-dependent vehicle routing problem with time windows
- Vehicle routing with endogenous learning: application to offshore plug and abandonment campaign planning
- Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation
- Distance-based adaptive large neighborhood search algorithm for green-PDPTW
- Strong cuts from compatibility relations for the dial-a-ride problem
- Transportation problem on a graph
- Makespan trade-offs for visiting triangle edges (extended abstract)
- SeaPearl: a constraint programming solver guided by reinforcement learning
- A constant-factor approximation for directed latency in quasi-polynomial time
- Faster algorithms for orienteering and \(k\)-TSP
- Decentralized route-planning for multi-vehicle teams to satisfy a subclass of linear temporal logic specifications
- An overview of graph covering and partitioning
- On the stochastic vehicle routing problem with time windows, correlated travel times, and time dependency
- Combinatorial algorithms for rooted prize-collecting walks and applications to orienteering and minimum-latency problems
- Optimizing the planning of the observation of a catalog of objects by a mobile observer, taking the implicated limitations into account
- On optimal coverage of a tree with multiple robots
- Goal programming model applied to waste paper logistics processes
- Gossip algorithms for heterogeneous multi-vehicle routing problems
- City-courier routing and scheduling problems
- Solving a bi-objective transportation location routing problem by metaheuristic algorithms
- Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints
- New mixed integer-programming model for the pickup-and-delivery problem with transshipment
- A cooperative parallel metaheuristic for the capacitated vehicle routing problem
- The pyramidal capacitated vehicle routing problem
- Industrial aspects and literature survey: Combined inventory management and routing
- A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times
- A lexicographic minimax approach to the vehicle routing problem with route balancing
- New LP relaxations for minimum cycle/path/tree cover problems
- A branch and bound algorithm for dynamic resource allocation in population disease management
- A new model for the asymmetric vehicle routing problem with simultaneous pickup and deliveries
- A simulated annealing heuristic for the capacitated green vehicle routing problem
- Distance constrained vehicle routing problem to minimize the total cost
- Variants and formulations of the vehicle routing problem
- A branch-and-cut algorithm for the capacitated profitable tour problem
- A fast metaheuristic for the travelling salesperson problem with hotel selection
This page was built for publication: The vehicle routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2772085)
