The following pages link to The vehicle routing problem (Q2772085):
Displaying 50 items.
- Exact methods for solving the elementary shortest and longest path problems (Q512936) (← links)
- Optimizing departure times in vehicle routes (Q541710) (← links)
- An efficient column-generation-based algorithm for solving a pickup-and-delivery problem (Q547107) (← links)
- Analysis of the maximum level policy in a production-distribution system (Q547123) (← links)
- A single machine scheduling problem with availability constraints and sequence-dependent setup costs (Q552454) (← 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)
- Tabu search with path relinking for an integrated production-distribution problem (Q632656) (← links)
- A GRASP with evolutionary path relinking for the truck and trailer routing problem (Q632678) (← links)
- Lower and upper bounds for the \(m\)-peripatetic vehicle routing problem (Q633484) (← links)
- Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model (Q635160) (← links)
- Vehicle routing with compartments: applications, modelling and heuristics (Q657053) (← links)
- A set partitioning reformulation of a school bus scheduling problem (Q657252) (← links)
- Min-max tree covers of graphs. (Q703232) (← links)
- An integrated approach to the vehicle routing and container loading problems (Q841582) (← links)
- Reverse logistics: simultaneous design of delivery routes and returns strategies (Q850304) (← links)
- Adaptive memory programming for the vehicle routing problem with multiple trips (Q850308) (← links)
- Vehicle routing concepts in the closed-loop container network of ARN -- a case study (Q850642) (← links)
- Location-routing: issues, models and methods (Q856260) (← links)
- A goal programming approach to vehicle routing problems with soft time windows (Q857306) (← links)
- Scheduling periodic customer visits for a traveling salesperson (Q863999) (← links)
- Using mixed integer programming for solving the capacitated arc routing problem with vehicle/site dependencies with an application to the routing of residential sanitation collection vehicles (Q867538) (← links)
- A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal (Q872238) (← links)
- Comparison of agent-based scheduling to look-ahead heuristics for real-time transportation problems (Q872241) (← links)
- A reactive GRASP and path relinking for a combined production-distribution problem (Q883304) (← links)
- Comparing backhauling strategies in vehicle routing using ant colony optimization (Q926337) (← links)
- Creating lasso-solutions for the traveling salesman problem with pickup and delivery by tabu search (Q926338) (← links)
- The vehicle routing problem with coupled time windows (Q926344) (← links)
- Synchronized routing of seasonal products through a production/distribution network (Q926350) (← links)
- Recent advances in vehicle routing exact algorithms (Q926561) (← links)
- An efficient generalized network-simplex-based algorithm for manufacturing network flows (Q927190) (← links)
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts (Q948965) (← links)
- Combined route capacity and route length models for unit demand vehicle routing problems (Q951110) (← links)
- Ant colony optimization for the two-dimensional loading vehicle routing problem (Q955597) (← links)
- Solving the truck and trailer routing problem based on a simulated annealing heuristic (Q959516) (← links)
- A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery (Q959519) (← links)
- The undirected capacitated arc routing problem with profits (Q975994) (← links)
- On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm (Q976404) (← links)
- Adaptive demand peak management in online transport process planning (Q989614) (← links)
- Heuristic-based truck scheduling for inland container transportation (Q989618) (← links)
- Industrial aspects and literature survey: fleet composition and routing (Q991360) (← links)
- An ILP improvement procedure for the open vehicle routing problem (Q991364) (← links)
- An optimisation-oriented model of distributed supply-chain (Q1010005) (← links)
- Lasso solution strategies for the vehicle routing problem with pickups and deliveries (Q1011218) (← links)
- A computer-enabled solution procedure for food wholesalers' distribution decision in cities with a circular transportation infrastructure (Q1013397) (← links)
- Stochastic single vehicle routing with a predefined customer sequence and multiple depot returns (Q1014953) (← links)
- Single-commodity vehicle routing problem with pickup and delivery service (Q1023173) (← links)
- An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem (Q1025258) (← links)
- The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches (Q1027598) (← links)
