The following pages link to The Vehicle Routing Problem (Q2772085):
Displaying 50 items.
- A stochastic vehicle routing problem with travel time uncertainty: trade-off between cost and customer service (Q264279) (← links)
- Fleet design optimisation from historical data using constraint programming and large neighbourhood search (Q265693) (← links)
- An iterated local search algorithm for the single-vehicle cyclic inventory routing problem (Q296579) (← 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)
- Two-phase branch-and-cut for the mixed capacitated general routing problem (Q319006) (← links)
- Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints (Q319021) (← links)
- The multiple vehicle pickup and delivery problem with LIFO constraints (Q319195) (← links)
- A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints (Q319206) (← links)
- An ant colony system for responsive dynamic vehicle routing (Q319660) (← links)
- An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: application to the MDPVRP (Q319782) (← links)
- Network repair crew scheduling and routing for emergency relief distribution problem (Q320672) (← 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)
- A branch-and-price based heuristic for the stochastic vehicle routing problem with hard time windows (Q325476) (← links)
- A memetic algorithm for the travelling salesperson problem with hotel selection (Q336356) (← links)
- Single string planning problem arising in liner shipping industries: a heuristic approach (Q336521) (← links)
- Nested simulated annealing approach to periodic routing problem of a retail distribution system (Q336657) (← links)
- A column-and-cut generation algorithm for planning of Canadian armed forces tactical logistics distribution (Q336705) (← links)
- Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services (Q336790) (← links)
- An exact algorithm for solving the economic lot and supply scheduling problem using a power-of-two policy (Q337106) (← 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)
- Fleet-sizing for multi-depot and periodic vehicle routing problems using a modular heuristic algorithm (Q337247) (← links)
- Model-based automatic neighborhood design by unsupervised learning (Q337347) (← links)
- A branch-and-price approach for a multi-period vehicle routing problem (Q337422) (← links)
- Hybrid metaheuristics for the clustered vehicle routing problem (Q337513) (← links)
- A tabu search algorithm for the multi-period inspector scheduling problem (Q337536) (← links)
- Models and hybrid methods for the onshore wells maintenance problem (Q339625) (← links)
- A multi-shift vehicle routing problem with windows and cycle times (Q360503) (← links)
- Special issue on vehicle routing and scheduling: recent trends and advances (Q375973) (← links)
- A robust optimization approach to dispatching technicians under stochastic service times (Q375999) (← links)
- A min-max vehicle routing problem with split delivery and heterogeneous demand (Q376008) (← links)
- Partial-route inequalities for the multi-vehicle routing problem with stochastic demands (Q406333) (← links)
- An ILP-refined tabu search for the directed profitable rural postman problem (Q406489) (← links)
- Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem (Q421467) (← links)
- Stochastic single vehicle routing problem with delivery and Pick up and a predefined customer sequence (Q421576) (← links)
- A lookahead partitioning heuristic for a new assignment and scheduling problem in a distribution system (Q421661) (← links)
- Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing (Q421709) (← links)
- Optimised crossover genetic algorithm for capacitated vehicle routing problem (Q438026) (← links)
- Optimally routing and scheduling tow trains for JIT-supply of mixed-model assembly lines (Q439371) (← links)
- Single vehicle routing problems with a predefined customer sequence, compartmentalized load and stochastic demands (Q439377) (← links)
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints (Q439444) (← links)
- Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW (Q439557) (← links)
- Multi-agent source seeking via discrete-time extremum seeking control (Q466471) (← links)
- An improved ant colony algorithm and its application in vehicle routing problem (Q474637) (← links)
- Decision support for hospital evacuation and emergency response (Q478035) (← links)
- Exact methods for solving the elementary shortest and longest path problems (Q512936) (← links)
- Optimizing departure times in vehicle routes (Q541710) (← links)
