Pages that link to "Item:Q3028709"
From MaRDI portal
The following pages link to Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints (Q3028709):
Displayed 50 items.
- A new multi-objective competitive open vehicle routing problem solved by particle swarm optimization (Q264238) (← links)
- A new formulation approach for location-routing problems (Q264241) (← links)
- A stochastic vehicle routing problem with travel time uncertainty: trade-off between cost and customer service (Q264279) (← links)
- Heuristic solutions for the vehicle routing problem with time windows and synchronized visits (Q279819) (← links)
- Workforce scheduling and routing problems: literature survey and computational study (Q284388) (← links)
- A review of recent research on green road freight transportation (Q296573) (← links)
- A priori orienteering with time windows and stochastic wait times at customers (Q297061) (← links)
- Evaluating two new heuristics for constructing customer clusters in a VRPTW with multiple service workers (Q301906) (← links)
- Tabu search for the real-world carpooling problem (Q306096) (← links)
- A matheuristic approach for the pollution-routing problem (Q319140) (← links)
- On service consistency in multi-period vehicle routing (Q319190) (← links)
- The multiple vehicle pickup and delivery problem with LIFO constraints (Q319195) (← links)
- Optimal routing for electric vehicle service systems (Q320027) (← links)
- The fleet size and mix location-routing problem with time windows: formulations and a heuristic algorithm (Q320620) (← links)
- Satisficing measure approach for vehicle routing problem with time windows under uncertainty (Q320689) (← links)
- Thirty years of heterogeneous vehicle routing (Q320861) (← links)
- A priori optimization with recourse for the vehicle routing problem with hard time windows and stochastic service times (Q320872) (← links)
- On-time delivery probabilistic models for the vehicle routing problem with stochastic demands and time windows (Q320889) (← links)
- Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows (Q320995) (← links)
- The vehicle-routing problem with time windows and driver-specific times (Q322409) (← links)
- Vehicle routing to minimize time-dependent emissions in urban areas (Q322706) (← links)
- Measures of dynamism and urgency in logistics (Q323225) (← links)
- An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization (Q323288) (← links)
- Orienteering problem: a survey of recent variants, solution approaches and applications (Q323527) (← links)
- A branch-and-price based heuristic for the stochastic vehicle routing problem with hard time windows (Q325476) (← links)
- Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling (Q336343) (← links)
- A memetic algorithm for the travelling salesperson problem with hotel selection (Q336356) (← links)
- An adaptive evolutionary approach for real-time vehicle routing and dispatching (Q336366) (← links)
- Using the primal-dual interior point algorithm within the branch-price-and-cut method (Q336429) (← links)
- Metaheuristic algorithms for solving two interconnected vehicle routing problems in a hospital complex (Q336558) (← links)
- A note on the time travel approach for handling time windows in vehicle routing problems (Q336572) (← links)
- Nested simulated annealing approach to periodic routing problem of a retail distribution system (Q336657) (← 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)
- A knowledge-based evolutionary algorithm for the multiobjective vehicle routing problem with time windows (Q336957) (← links)
- The dynamic multiperiod vehicle routing problem with probabilistic information (Q337038) (← 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)
- A vehicle routing problem with flexible time windows (Q337177) (← links)
- Scheduled penalty variable neighborhood search (Q337204) (← links)
- A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows (Q337225) (← links)
- Solving the orienteering problem with time windows via the pulse framework (Q337360) (← links)
- Battery swap station location-routing problem with capacitated electric vehicles (Q337428) (← links)
- Minimum cost VRP with time-dependent speed data and congestion charge (Q337447) (← links)
- Dynamic design of sales territories (Q337456) (← links)
- Testing local search move operators on the vehicle routing problem with split deliveries and time windows (Q337460) (← links)
- Ambulance routing for disaster response with patient groups (Q337463) (← links)
- A tabu search algorithm for the multi-period inspector scheduling problem (Q337536) (← links)
- A decomposition based memetic algorithm for multi-objective vehicle routing problem with time windows (Q337630) (← links)
- Vehicle routing problem with stochastic travel times including soft time windows and service costs (Q339568) (← links)