The vehicle routing problem. Latest advances and new challenges.
From MaRDI portal
(Redirected from Publication:935682)
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06) Transportation, logistics and supply chain management (90B06)
Cited in
(only showing first 100 items - show all)- Iterated tour partitioning for Euclidean capacitated vehicle routing
- Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order
- Solving elementary shortest-path problems as mixed-integer programs
- Data-driven robust resource allocation with monotonic cost functions
- Approximation algorithms for solving the heterogeneous Chinese postman problem
- Solving the integrated multi-period scheduling routing problem for cleaning debris in the aftermath of disasters
- The supply of convenience stores: challenges of short-distance routing within the constraints of working time regulations
- Vehicle Routing Problems and Container Terminal Operations – An Update of Research
- Dynamic fleet scheduling with uncertain demand and customer flexibility
- A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem
- Min-Max vs. Min-Sum vehicle routing: a worst-case analysis
- An approximation algorithm for solving the heterogeneous Chinese postman problem
- A stochastic vehicle routing problem with travel time uncertainty: trade-off between cost and customer service
- A new novel local search integer-programming-based heuristic for PCB assembly on collect-and-place machines
- Multi-agent source seeking via discrete-time extremum seeking control
- The time-dependent vehicle routing problem with time windows and road-network information
- PILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems
- Implicit depot assignments and rotations in vehicle routing heuristics
- An optimization model for the vehicle routing problem with practical three-dimensional loading constraints
- Routing problems with loading constraints
- A lexicographic approach for the bi-objective selective pickup and delivery problem with time windows and paired demands
- Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics
- New approximation algorithms for the rooted budgeted cycle cover problem
- An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems
- A variable neighborhood search for the green vehicle routing problem with two-dimensional loading constraints and split delivery
- General VNS for asymmetric vehicle routing problem with time and capacity constraints
- A hybrid algorithm for the drilling rig routing problem
- A Branch-and-Cut method for the Capacitated Location-Routing Problem
- A GRASP with evolutionary path relinking for the truck and trailer routing problem
- Robust optimization of a broad class of heterogeneous vehicle routing problems under demand uncertainty
- Dynamic courier routing for a food delivery service
- The vehicle routing problem with time windows and flexible delivery locations
- Part logistics in the automotive industry: decision problems, literature review and research agenda
- Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing
- A multi-start local search heuristic for the green vehicle routing problem based on a multigraph reformulation
- An approximation algorithm for vehicle routing with compatibility constraints
- Home chemotherapy delivery: an integrated production scheduling and multi-trip vehicle routing problem
- Approximation of the Shapley value for the Euclidean travelling salesman game
- The pyramidal capacitated vehicle routing problem
- Edge assembly-based memetic algorithm for the capacitated vehicle routing problem
- Combining biased randomization with iterated local search for solving the multidepot vehicle routing problem
- An approximation of the customer waiting time for online restaurants owning delivery system
- A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
- An improvement heuristic based on variable neighborhood search for a dynamic orienteering problem
- Optimal capacitated ring trees
- Ridesharing for emergency evacuation
- A matheuristic for the asymmetric capacitated vehicle routing problem
- Selecting Good a Priori Sequences for Vehicle Routing Problem with Stochastic Demand
- Adaptive demand peak management in online transport process planning
- The heterogeneous rooted tree cover problem
- The multi-vehicle probabilistic covering tour problem
- The dynamic dispatch waves problem for same-day delivery
- Approximation algorithms for solving the constrained arc routing problem in mixed graphs
- An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem
- Rich vehicle routing problems: from a taxonomy to a definition
- Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services
- A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
- Pricing routines for vehicle routing with time windows on road networks
- Accounting for cost heterogeneity on the demand in the context of a technician dispatching problem
- A PTAS for Capacitated Vehicle Routing on Trees
- A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints
- A Large Neighbourhood Search Heuristic for a Periodic Supply Vessel Planning Problem Arising in Offshore Oil and Gas Operations
- A polynomial-time approximation scheme for the Euclidean problem on a cycle cover of a graph
- Vehicle routing with backhauls: review and research perspectives
- Mixed-integer linear programming formulations for the software clustering problem
- Approximation algorithms for multi-robot patrol-scheduling with min-max latency
- Approximating the chance-constrained capacitated vehicle routing problem with robust optimization
- Minimum makespan vehicle routing problem with compatibility constraints
- Budget-balanced and strategy-proof auctions for ridesharing
- Solving the vehicle routing problem with multi-compartment vehicles for city logistics
- Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints
- On service consistency in multi-period vehicle routing
- The multiple vehicle pickup and delivery problem with LIFO constraints
- Stronger multi-commodity flow formulations of the capacitated vehicle routing problem
- The multi-compartment vehicle routing problem with flexible compartment sizes
- New LP relaxations for minimum cycle/path/tree cover problems
- A hybrid approach for the vehicle routing problem with three-dimensional loading constraints
- A concise guide to existing and emerging vehicle routing problem variants
- Last-mile shared delivery: a discrete sequential packing approach
- Modeling and solving the mixed capacitated general routing problem
- A decomposition heuristic for a rich production routing problem
- A VNS approach to multi-location inventory redistribution with vehicle routing
- A multi-compartment vehicle routing problem in cold-chain distribution
- A cluster-first route-second approach for the swap body vehicle routing problem
- A survey of the standard location-routing problem
- New valid inequalities for the symmetric vehicle routing problem with simultaneous pickup and deliveries
- The drone-assisted pickup and delivery problem: an adaptive large neighborhood search metaheuristic
- A branch-and-cut algorithm for the multi-compartment vehicle routing problem with flexible compartment sizes
- Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments
- An efficient column-generation-based algorithm for solving a pickup-and-delivery problem
- On-time delivery probabilistic models for the vehicle routing problem with stochastic demands and time windows
- Thirty years of heterogeneous vehicle routing
- Pro-active real-time routing in applications with multiple request patterns
- Local search heuristics for sectoring routing in a household waste collection context
- Optimizing logistics routings in a network perspective of supply and demand nodes
- An iterated local search for the multi-commodity multi-trip vehicle routing problem with time windows
- An effective tabu search approach with improved loading algorithms for the 3L-CVRP
- Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework
- Using parallel \& distributed computing for real-time solving of vehicle routing problems with stochastic demands
- A method of estimating computational complexity based on input conditions for N-vehicle problem
This page was built for publication: The vehicle routing problem. Latest advances and new challenges.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q935682)
