The following pages link to The truck dispatching problem (Q2768987):
Displaying 50 items.
- A stochastic vehicle routing problem with travel time uncertainty: trade-off between cost and customer service (Q264279) (← links)
- Memetic heuristic approach for solving truck and trailer routing problems with stochastic demands and time windows (Q264330) (← links)
- Rich vehicle routing problems: from a taxonomy to a definition (Q299767) (← links)
- Evaluating two new heuristics for constructing customer clusters in a VRPTW with multiple service workers (Q301906) (← links)
- Stronger multi-commodity flow formulations of the capacitated vehicle routing problem (Q319445) (← links)
- An ant colony system for responsive dynamic vehicle routing (Q319660) (← links)
- Optimal routing for electric vehicle service systems (Q320027) (← links)
- A long-haul freight transportation problem: synchronizing resources to deliver requests passing through multiple transshipment locations (Q320708) (← 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)
- An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints (Q322469) (← links)
- Measures of dynamism and urgency in logistics (Q323225) (← links)
- A multi-agent based cooperative approach to scheduling and routing (Q323308) (← 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)
- A two phase variable neighborhood search for the multi-product inventory routing problem (Q337230) (← links)
- Fleet-sizing for multi-depot and periodic vehicle routing problems using a modular heuristic algorithm (Q337247) (← links)
- A branch-and-price approach for a multi-period vehicle routing problem (Q337422) (← links)
- The min-max split delivery multi-depot vehicle routing problem with minimum service time requirement (Q342348) (← links)
- Approximation schemes for Euclidean vehicle routing problems with time windows (Q346518) (← 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)
- Bilevel programming and the separation problem (Q403662) (← links)
- Multi-depot vessel routing problem in a direction dependent wavefield (Q405664) (← 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)
- 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)
- 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)
- Coalition-based metaheuristic: a self-adaptive metaheuristic using reinforcement learning and mimetism (Q604940) (← links)
- Routing problems with loading constraints (Q610992) (← links)
- Comments on: Routing Problems with loading constraints (Q610994) (← links)
- Deterministic optimizational problems of transportation logistics (Q612223) (← links)
- A hybrid search method for the vehicle routing problem with time windows (Q613770) (← links)
- The transit route arc-node service maximization problem (Q621660) (← 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)
- Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model (Q635160) (← links)
- An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows (Q709143) (← links)
- Urban regional logistics distribution path planning considering road characteristics (Q782070) (← links)
- Tourenplanung für zwei Depots bei offenen Touren (Q788646) (← links)
- Dispatching a fishing trawler fleet in the Canadian Atlantic groundfish industry (Q807381) (← links)
- Solving the petroleum replenishment and routing problem with variable demands and time windows (Q827236) (← links)
- Computing nine new best-so-far solutions for capacitated VRP with a cellular genetic algorithm (Q844205) (← links)
- Using clustering analysis in a capacitated location-routing problem (Q864016) (← links)
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems (Q875422) (← links)
- On constructing a family of student delivery routes in minimal time (Q893919) (← links)
- A new bi-objective location-routing problem for distribution of perishable products: evolutionary computation approach (Q894544) (← links)
