The vehicle routing problem. Latest advances and new challenges.

zbMATH Open1142.90004MaRDI QIDQ935682FDOQ935682

Authors:

Publication date: 7 August 2008

Published in: Operations Research/Computer Science Interfaces Series (Search for Journal in Brave)

Mathematics Subject Classification ID

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)

• Polynomial Time Approximation Scheme for Single-Depot Euclidean Capacitated Vehicle Routing Problem
• An approximation algorithm for solving the heterogeneous Chinese postman problem
• Dynamic fleet scheduling with uncertain demand and customer flexibility
• 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
• Robust Multiperiod Vehicle Routing Under Customer Order Uncertainty
• Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing
• Approximation of the Shapley value for the Euclidean travelling salesman game
• Combining biased randomization with iterated local search for solving the multidepot vehicle routing problem
• Ridesharing for emergency evacuation
• Selecting Good a Priori Sequences for Vehicle Routing Problem with Stochastic Demand
• A matheuristic for the asymmetric capacitated vehicle routing problem
• Adaptive demand peak management in online transport process planning
• The multi-vehicle probabilistic covering tour problem
• The dynamic dispatch waves problem for same-day delivery
• A PTAS for Capacitated Vehicle Routing on Trees
• A Large Neighbourhood Search Heuristic for a Periodic Supply Vessel Planning Problem Arising in Offshore Oil and Gas Operations
• Vehicle routing with backhauls: review and research perspectives
• Minimum makespan vehicle routing problem with compatibility constraints
• Robust Optimization of a Broad Class of Heterogeneous Vehicle Routing Problems Under Demand Uncertainty
• A decomposition heuristic for a rich production routing problem
• A VNS approach to multi-location inventory redistribution with vehicle routing
• A cluster-first route-second approach for the swap body vehicle routing problem
• A survey of the standard location-routing problem
• Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments
• Optimizing logistics routings in a network perspective of supply and demand nodes
• Heuristic and exact algorithms for a min-max selective vehicle routing problem
• A multi-trip split-delivery vehicle routing problem with time windows for inventory replenishment under stochastic travel times
• The min-max split delivery multi-depot vehicle routing problem with minimum service time requirement
• Lower and upper competitive bounds for online directed graph exploration
• A min-max vehicle routing problem with split delivery and heterogeneous demand
• The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time
• Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency
• Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation
• An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows
• Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees
• A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing
• A reduction approach to the two-campus transport problem
• A granular local search matheuristic for a heterogeneous fleet vehicle routing problem with stochastic travel times
• Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems
• An ILP-based local search procedure for the VRP with pickups and deliveries
• MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems
• A worst-case analysis for the split delivery vehicle routing problem with minimum delivery amounts
• Special issue on vehicle routing and scheduling: recent trends and advances
• A simple model of optimal clearance of improvised explosive devices
• Reoptimization framework and policy analysis for maritime inventory routing under uncertainty
• Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies
• The dynamic bowser routing problem
• Route relaxations on GPU for vehicle routing problems
• Scheduling issues in vehicle routing
• Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order
• The vehicle routing problem with drones: several worst-case results
• Vehicle Routing Problems and Container Terminal Operations – An Update of Research
• 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
• A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem
• Min-Max vs. Min-Sum vehicle routing: a worst-case analysis
• 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
• 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
• An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems
• A Branch-and-Cut method for the Capacitated Location-Routing Problem
• A GRASP with evolutionary path relinking for the truck and trailer routing problem
• Part logistics in the automotive industry: decision problems, literature review and research agenda
• Edge assembly-based memetic algorithm for the capacitated vehicle routing problem
• A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
• Optimal capacitated ring trees
• 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
• A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints
• A polynomial-time approximation scheme for the Euclidean problem on a cycle cover of a graph
• Mixed-integer linear programming formulations for the software clustering problem
• A biased‐randomized algorithm for the two‐dimensional vehicle routing problem with and without item rotations
• 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
• A hybrid approach for the vehicle routing problem with three-dimensional loading constraints
• Modeling and solving the mixed capacitated general routing problem
• 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
• A method of estimating computational complexity based on input conditions for \(N\)-vehicle problem
• 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
• Partial-route inequalities for the multi-vehicle routing problem with stochastic demands
• A memetic algorithm for the multiperiod vehicle routing problem with profit
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis

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)