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 biased‐randomized algorithm for the two‐dimensional vehicle routing problem with and without item rotations, 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, 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, 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, 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 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, MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems, Vehicle routing problems with loading constraints: state-of-the-art and future directions, A method of estimating computational complexity based on input conditions for \(N\)-vehicle problem, The pyramidal capacitated vehicle routing problem, 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, 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