Pages that link to "Item:Q869003"

The following pages link to A general heuristic for vehicle routing problems (Q869003):

Displaying 50 items.

• A stochastic vehicle routing problem with travel time uncertainty: trade-off between cost and customer service (Q264279) (← links)
• Elective course student sectioning at Danish high schools (Q284401) (← links)
• A stochastic local search algorithm with adaptive acceptance for high-school timetabling (Q284406) (← links)
• Effective learning hyper-heuristics for the course timetabling problem (Q296691) (← links)
• Branch-and-price and constraint programming for solving a real-life technician dispatching problem (Q296755) (← links)
• A bi-objective home care scheduling problem: analyzing the trade-off between costs and client inconvenience (Q320696) (← links)
• The vehicle-routing problem with time windows and driver-specific times (Q322409) (← links)
• A two-stage solution method for the annual dairy transportation problem (Q322617) (← links)
• Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests (Q322826) (← links)
• An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization (Q323288) (← links)
• Large neighborhood search for multi-trip vehicle routing (Q323545) (← links)
• The synchronized arc and node routing problem: application to road marking (Q336355) (← links)
• A hybrid metaheuristic approach for the rollon-rolloff vehicle routing problem (Q336415) (← links)
• Lifted and local reachability cuts for the vehicle routing problem with time windows (Q336427) (← links)
• Single string planning problem arising in liner shipping industries: a heuristic approach (Q336521) (← links)
• A hybrid algorithm for a class of vehicle routing problems (Q336559) (← links)
• The dial-A-ride problem with transfers (Q336745) (← links)
• The multi-district team orienteering problem (Q336760) (← links)
• An adaptive large neighborhood search for a vehicle routing problem with multiple routes (Q336781) (← links)
• Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services (Q336790) (← links)
• The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation (Q337237) (← links)
• Battery swap station location-routing problem with capacitated electric vehicles (Q337428) (← links)
• Dynamic design of sales territories (Q337456) (← links)
• Hybrid metaheuristics for the clustered vehicle routing problem (Q337513) (← links)
• Fast machine reassignment (Q338866) (← links)
• A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows (Q339607) (← links)
• Non-myopic vehicle and route selection in dynamic DARP with travel time and workload objectives (Q339640) (← links)
• Multi-directional local search (Q339654) (← links)
• Lower and upper bounds for the two-echelon capacitated location-routing problem (Q339668) (← links)
• An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics (Q339671) (← links)
• A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows (Q342060) (← links)
• An adaptive large neighborhood search for an E-grocery delivery routing problem (Q342326) (← links)
• An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows and scheduled lines (Q342360) (← links)
• A parallel matheuristic for the technician routing and scheduling problem (Q375996) (← links)
• Multi-depot vessel routing problem in a direction dependent wavefield (Q405664) (← links)
• Stochastic single vehicle routing problem with delivery and Pick up and a predefined customer sequence (Q421576) (← links)
• Optimizing yard assignment in an automotive transshipment terminal (Q421631) (← links)
• A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times (Q439552) (← links)
• A rich vehicle routing problem dealing with perishable food: a case study (Q456914) (← links)
• The capacitated vehicle routing problem with stochastic demands and time windows (Q547129) (← links)
• Vehicle routing with compartments: applications, modelling and heuristics (Q657053) (← links)
• Scheduling technicians and tasks in a telecommunications company (Q707696) (← links)
• An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows (Q709143) (← links)
• Bilevel model for production-distribution planning solved by using ant colony optimization (Q709146) (← links)
• A large neighbourhood search heuristic for ship routing and scheduling with split loads (Q709186) (← links)
• Shipper collaboration in forward and reverse logistics (Q781076) (← links)
• Urban regional logistics distribution path planning considering road characteristics (Q782070) (← links)
• Simultaneous product and service delivery vehicle routing problem with time windows and order release dates (Q822105) (← links)
• An optimization approach for communal home meal delivery service: A case study (Q837090) (← links)
• A general heuristic for vehicle routing problems (Q869003) (← links)