The vehicle routing problem. Latest advances and new challenges.

zbMath1142.90004MaRDI QIDQ935682

No author found.

Publication date: 7 August 2008

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

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90B06: Transportation, logistics and supply chain management

90C59: Approximation methods and heuristics in mathematical programming

00B15: Collections of articles of miscellaneous specific interest

90-06: Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming

Related Items

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, 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, 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, Thirty years of heterogeneous vehicle routing, On-time delivery probabilistic models for the vehicle routing problem with stochastic demands and time windows, Pro-active real-time routing in applications with multiple request patterns, Local search heuristics for sectoring routing in a household waste collection context, Approximability of the minimum-weight \(k\)-size cycle cover problem, A hybrid approach for the vehicle routing problem with three-dimensional loading constraints, Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services, Paired cooperative reoptimization strategy for the vehicle routing problem with stochastic demands, An iterated local search for the multi-commodity multi-trip vehicle routing problem with time windows, Pricing routines for vehicle routing with time windows on road networks, A vehicle routing problem with flexible time windows, An effective tabu search approach with improved loading algorithms for the 3L-CVRP, A decomposition-based heuristic for the multiple-product inventory-routing problem, A heuristic algorithm for a supply chain's production-distribution planning, A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows, 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, Mixed-integer linear programming formulations for the software clustering problem, 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, Special issue on vehicle routing and scheduling: recent trends and advances, Modeling and solving the mixed capacitated general routing problem, A worst-case analysis for the split delivery vehicle routing problem with minimum delivery amounts, A min-max vehicle routing problem with split delivery and heterogeneous demand, A simple model of optimal clearance of improvised explosive devices, Dynamic fleet scheduling with uncertain demand and customer flexibility, Partial-route inequalities for the multi-vehicle routing problem with stochastic demands, Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing, Multi-agent source seeking via discrete-time extremum seeking control, Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees, A reduction approach to the two-campus transport problem, A polynomial-time approximation scheme for the Euclidean problem on a cycle cover of a graph, A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing, The vehicle routing problem with drones: several worst-case results, An efficient column-generation-based algorithm for solving a pickup-and-delivery problem, Routing problems with loading constraints, A Branch-and-Cut method for the Capacitated Location-Routing Problem, An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows, Heuristic and exact algorithms for a min-max selective vehicle routing problem, A GRASP with evolutionary path relinking for the truck and trailer routing problem, Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation, Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies, The multi-vehicle probabilistic covering tour problem, The dynamic dispatch waves problem for same-day delivery, Part logistics in the automotive industry: decision problems, literature review and research agenda, PILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems, A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows, Adaptive demand peak management in online transport process planning, Immunity-based evolutionary algorithm for optimal global container repositioning in liner shipping, An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem, A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows, Using a TSP heuristic for routing order pickers in warehouses, A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen, Managing platelet supply through improved routing of blood collection vehicles, A decomposition heuristic for a rich production routing problem, A VNS approach to multi-location inventory redistribution with vehicle routing, Vehicle routing with backhauls: review and research perspectives, A matheuristic for the asymmetric capacitated vehicle routing problem, Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems, A cluster-first route-second approach for the swap body vehicle routing problem, An ILP-based local search procedure for the VRP with pickups and deliveries, A survey of the standard location-routing problem, The dynamic bowser routing problem, Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics, A lexicographic approach for the bi-objective selective pickup and delivery problem with time windows and paired demands, Dynamic courier routing for a food delivery service, Vehicle selection for a multi-compartment vehicle routing problem, Solving the stochastic time-dependent orienteering problem with time windows, Route relaxations on GPU for vehicle routing problems, A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints, Efficient algorithms for the double traveling salesman problem with multiple stacks, Development of a fuel consumption optimization model for the capacitated vehicle routing problem, Linear formulations for the vehicle routing problem with synchronization constraints, MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems, The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time, A multi-start local search heuristic for the green vehicle routing problem based on a multigraph reformulation, Minimum makespan vehicle routing problem with compatibility constraints, Vehicle routing problems with loading constraints: state-of-the-art and future directions, Accounting for cost heterogeneity on the demand in the context of a technician dispatching problem, Optimizing logistics routings in a network perspective of supply and demand nodes, A concise guide to existing and emerging vehicle routing problem variants, The time-dependent vehicle routing problem with time windows and road-network information, An improvement heuristic based on variable neighborhood search for a dynamic orienteering problem, An inverse optimization approach for a capacitated vehicle routing problem, A method of estimating computational complexity based on input conditions for \(N\)-vehicle problem, The pyramidal capacitated vehicle routing problem, A multi-compartment vehicle routing problem in cold-chain distribution, New LP relaxations for minimum cycle/path/tree cover problems, Solving the vehicle routing problem with multi-compartment vehicles for city logistics, A biased‐randomized algorithm for the two‐dimensional vehicle routing problem with and without item rotations, Robust Multiperiod Vehicle Routing Under Customer Order Uncertainty, Robust Data-Driven Vehicle Routing with Time Windows, The Distributionally Robust Chance-Constrained Vehicle Routing Problem, Horizontal cooperation in road transportation: a case illustrating savings in distances and greenhouse gas emissions, Recent progress of local search in handling the time window constraints of the vehicle routing problem, Recent progress of local search in handling the time window constraints of the vehicle routing problem, Distribution of waiting time for dynamic pickup and delivery problems, Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet, Scheduling issues in vehicle routing, An approximation algorithm for vehicle routing with compatibility constraints, Reoptimization framework and policy analysis for maritime inventory routing under uncertainty, A branch-and-cut algorithm for the multi-compartment vehicle routing problem with flexible compartment sizes, A memetic algorithm for the multiperiod vehicle routing problem with profit, Heuristics for multi-attribute vehicle routing problems: a survey and synthesis, A multi-trip split-delivery vehicle routing problem with time windows for inventory replenishment under stochastic travel times, An approximation of the customer waiting time for online restaurants owning delivery system, Solving elementary shortest-path problems as mixed-integer programs, A survey on matheuristics for routing problems, A memetic algorithm for the multi trip vehicle routing problem, A unified solution framework for multi-attribute vehicle routing problems, Implicit depot assignments and rotations in vehicle routing heuristics, Min-Max vs. Min-Sum vehicle routing: a worst-case analysis, A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem, Combining biased randomization with iterated local search for solving the multidepot vehicle routing problem, Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments, An optimization model for the vehicle routing problem with practical three-dimensional loading constraints, Edge assembly-based memetic algorithm for the capacitated vehicle routing problem, Selecting Good a Priori Sequences for Vehicle Routing Problem with Stochastic Demand, Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency, Robust Optimization of a Broad Class of Heterogeneous Vehicle Routing Problems Under Demand Uncertainty, Last-Mile Shared Delivery: A Discrete Sequential Packing Approach, Polynomial Time Approximation Scheme for Single-Depot Euclidean Capacitated Vehicle Routing Problem