Pages that link to "Item:Q1198313"

The following pages link to The vehicle routing problem: An overview of exact and approximate algorithms (Q1198313):

Displaying 50 items.

• Memetic heuristic approach for solving truck and trailer routing problems with stochastic demands and time windows (Q264330) (← links)
• An ant colony system for responsive dynamic vehicle routing (Q319660) (← links)
• Network repair crew scheduling and routing for emergency relief distribution problem (Q320672) (← links)
• A service network design model for multimodal municipal solid waste transport (Q323286) (← links)
• A biased-randomised large neighbourhood search for the two-dimensional vehicle routing problem with backhauls (Q323548) (← links)
• A column-and-cut generation algorithm for planning of Canadian armed forces tactical logistics distribution (Q336705) (← links)
• The vehicle rescheduling problem (Q336901) (← links)
• Vehicle routing problem with stochastic travel times including soft time windows and service costs (Q339568) (← links)
• A robust optimization approach to dispatching technicians under stochastic service times (Q375999) (← links)
• Multi-depot vessel routing problem in a direction dependent wavefield (Q405664) (← links)
• Risky traveling salesman problem (Q418099) (← 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)
• Capacitated lot-sizing and scheduling with sequence-dependent, period-overlapping and non-triangular setups (Q539458) (← links)
• A model and two heuristic approaches for a forage Harvester planning problem: a case study (Q611002) (← links)
• Models, relaxations and exact approaches for the capacitated vehicle routing problem (Q697581) (← links)
• A tabu search algorithm for the open vehicle routing problem (Q703907) (← links)
• The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times (Q706984) (← links)
• Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem (Q709128) (← links)
• Part logistics in the automotive industry: decision problems, literature review and research agenda (Q726233) (← links)
• A constant approximation algorithm for the uniform a priori capacitated vehicle routing problem with unit demands (Q783689) (← links)
• The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations (Q814246) (← links)
• The multiple traveling salesman problem on spiders (Q831830) (← links)
• A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows (Q853026) (← links)
• Comparison of agent-based scheduling to look-ahead heuristics for real-time transportation problems (Q872241) (← links)
• Synchronized routing of seasonal products through a production/distribution network (Q926350) (← links)
• Real-time split-delivery pickup and delivery time window problems with transfers (Q940817) (← links)
• An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts (Q948965) (← links)
• Solving the truck and trailer routing problem based on a simulated annealing heuristic (Q959516) (← links)
• A path relinking approach for the team orienteering problem (Q975993) (← links)
• Vehicle routing with stochastic time-dependent travel times (Q976985) (← links)
• Randomized gravitational emulation search algorithm for symmetric traveling salesman problem (Q990542) (← links)
• Planning for agricultural forage harvesters and trucks: model, heuristics, and case study (Q993459) (← links)
• An assignment-based heuristic for vehicle routing with time windows (Q1001380) (← links)
• An algorithm for the capacitated vehicle routing problem with route balancing (Q1022391) (← links)
• Simultaneously scheduling multiple turns for steel color-coating production (Q1042046) (← links)
• The traveling salesman problem: An overview of exact and approximate algorithms (Q1194761) (← links)
• Practical aspects of route planning for magazine and newspaper wholesalers (Q1266509) (← links)
• Stochastic vehicle routing (Q1266554) (← links)
• A heuristic algorithm for the asymmetric capacitated vehicle routing problem (Q1266654) (← links)
• Planning models for freight transportation (Q1278638) (← links)
• A multi-level composite heuristic for the multi-depot vehicle fleet mix problem (Q1280120) (← links)
• The many-to-many location-routing problem (Q1284602) (← links)
• Combined location-routing problems: A synthesis and future research directions (Q1295989) (← links)
• Vehicle routing with split deliveries (Q1327209) (← links)
• A robust strategy approach to a strategic mobility problem (Q1342065) (← links)
• An adaptive memory heuristic for a class of vehicle routing problems with minmax objective (Q1362944) (← links)
• Modeling rolling batch planning as vehicle routing problem with time windows. (Q1406729) (← links)
• Design of an IT-driven decision support system for vehicle routing and scheduling. (Q1412738) (← links)
• Resource planning and a depot location model for electric power restoration. (Q1428043) (← links)