Pages that link to "Item:Q935682"
From MaRDI portal
The following pages link to The vehicle routing problem. Latest advances and new challenges. (Q935682):
Displaying 50 items.
- A stochastic vehicle routing problem with travel time uncertainty: trade-off between cost and customer service (Q264279) (← links)
- A new novel local search integer-programming-based heuristic for PCB assembly on collect-and-place machines (Q266405) (← links)
- Optimal capacitated ring trees (Q286687) (← links)
- Approximation algorithms for solving the constrained arc routing problem in mixed graphs (Q297063) (← links)
- An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem (Q297272) (← links)
- Rich vehicle routing problems: from a taxonomy to a definition (Q299767) (← links)
- Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints (Q319021) (← links)
- On service consistency in multi-period vehicle routing (Q319190) (← links)
- The multiple vehicle pickup and delivery problem with LIFO constraints (Q319195) (← links)
- Stronger multi-commodity flow formulations of the capacitated vehicle routing problem (Q319445) (← links)
- The multi-compartment vehicle routing problem with flexible compartment sizes (Q319854) (← links)
- Thirty years of heterogeneous vehicle routing (Q320861) (← links)
- On-time delivery probabilistic models for the vehicle routing problem with stochastic demands and time windows (Q320889) (← links)
- Pro-active real-time routing in applications with multiple request patterns (Q323177) (← links)
- Local search heuristics for sectoring routing in a household waste collection context (Q323486) (← links)
- Approximability of the minimum-weight \(k\)-size cycle cover problem (Q330503) (← links)
- A hybrid approach for the vehicle routing problem with three-dimensional loading constraints (Q336326) (← links)
- Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services (Q336790) (← links)
- Paired cooperative reoptimization strategy for the vehicle routing problem with stochastic demands (Q337058) (← links)
- An iterated local search for the multi-commodity multi-trip vehicle routing problem with time windows (Q337147) (← links)
- Pricing routines for vehicle routing with time windows on road networks (Q337163) (← links)
- A vehicle routing problem with flexible time windows (Q337177) (← links)
- An effective tabu search approach with improved loading algorithms for the 3L-CVRP (Q337416) (← links)
- A decomposition-based heuristic for the multiple-product inventory-routing problem (Q337420) (← links)
- A heuristic algorithm for a supply chain's production-distribution planning (Q337603) (← links)
- A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows (Q339607) (← links)
- The min-max split delivery multi-depot vehicle routing problem with minimum service time requirement (Q342348) (← links)
- Lower and upper competitive bounds for online directed graph exploration (Q343923) (← links)
- Mixed-integer linear programming formulations for the software clustering problem (Q354618) (← links)
- Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework (Q363544) (← links)
- Using parallel \& distributed computing for real-time solving of vehicle routing problems with stochastic demands (Q367631) (← links)
- Special issue on vehicle routing and scheduling: recent trends and advances (Q375973) (← links)
- Modeling and solving the mixed capacitated general routing problem (Q375984) (← links)
- A worst-case analysis for the split delivery vehicle routing problem with minimum delivery amounts (Q376005) (← links)
- A min-max vehicle routing problem with split delivery and heterogeneous demand (Q376008) (← links)
- A simple model of optimal clearance of improvised explosive devices (Q378771) (← links)
- Dynamic fleet scheduling with uncertain demand and customer flexibility (Q395693) (← links)
- Partial-route inequalities for the multi-vehicle routing problem with stochastic demands (Q406333) (← links)
- Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing (Q421709) (← links)
- Multi-agent source seeking via discrete-time extremum seeking control (Q466471) (← links)
- Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees (Q489718) (← links)
- A reduction approach to the two-campus transport problem (Q490382) (← links)
- A polynomial-time approximation scheme for the Euclidean problem on a cycle cover of a graph (Q492282) (← links)
- A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing (Q494936) (← links)
- The vehicle routing problem with drones: several worst-case results (Q523161) (← links)
- An efficient column-generation-based algorithm for solving a pickup-and-delivery problem (Q547107) (← links)
- Routing problems with loading constraints (Q610992) (← links)
- A Branch-and-Cut method for the Capacitated Location-Routing Problem (Q622138) (← links)
- An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows (Q622144) (← links)
- Heuristic and exact algorithms for a min-max selective vehicle routing problem (Q622161) (← links)
