Pages that link to "Item:Q4355334"
From MaRDI portal
The following pages link to A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows (Q4355334):
Displaying 50 items.
- A stochastic vehicle routing problem with travel time uncertainty: trade-off between cost and customer service (Q264279) (← links)
- Branch-and-price and constraint programming for solving a real-life technician dispatching problem (Q296755) (← links)
- An ant colony system for responsive dynamic vehicle routing (Q319660) (← links)
- On-time delivery probabilistic models for the vehicle routing problem with stochastic demands and time windows (Q320889) (← links)
- The vehicle-routing problem with time windows and driver-specific times (Q322409) (← links)
- A hybrid metaheuristic approach for the rollon-rolloff vehicle routing problem (Q336415) (← links)
- A hybrid algorithm for a class of vehicle routing problems (Q336559) (← links)
- A note on the time travel approach for handling time windows in vehicle routing problems (Q336572) (← links)
- Location-arc routing problem: heuristic approaches and test instances (Q336937) (← links)
- A vehicle routing problem with flexible time windows (Q337177) (← links)
- A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows (Q337225) (← 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)
- A sequential GRASP for the therapist routing and scheduling problem (Q398907) (← links)
- The tree representation for the pickup and delivery traveling salesman problem with LIFO loading (Q421561) (← links)
- LS(graph): a constraint-based local search for constraint optimization on trees and paths (Q487640) (← links)
- A column generation algorithm for the vehicle routing problem with soft time windows (Q538287) (← links)
- Routing problems with loading constraints (Q610992) (← links)
- An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows (Q622144) (← links)
- Online vehicle routing and scheduling with dynamic travel times (Q622167) (← links)
- A heterogeneous cooperative parallel search of branch-and-bound method and tabu search algorithm (Q652663) (← links)
- Heuristic and exact algorithms for the multi-pile vehicle routing problem (Q657060) (← links)
- A two-phase hybrid metaheuristic for the vehicle routing problem with time windows (Q707148) (← links)
- Heuristics for the multi-period orienteering problem with multiple time windows (Q732904) (← links)
- Metaheuristics in combinatorial optimization (Q817206) (← links)
- An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup (Q833542) (← links)
- An optimization approach for communal home meal delivery service: A case study (Q837090) (← links)
- A goal programming approach to vehicle routing problems with soft time windows (Q857306) (← links)
- A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling (Q857328) (← links)
- A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows (Q858260) (← links)
- CLOVES: a cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up (Q859684) (← links)
- The vehicle routing problem with flexible time windows and traveling times (Q860386) (← links)
- Optimizing the periodic pick-up of raw materials for a manufacturer of auto parts (Q863988) (← links)
- Scheduling periodic customer visits for a traveling salesperson (Q863999) (← links)
- Arc routing problems with time-dependent service costs (Q872235) (← links)
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems (Q875422) (← links)
- A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows (Q892384) (← links)
- Dynamic VRP in pharmaceutical distribution -- a case study (Q926346) (← links)
- A neural-tabu search heuristic for the real time vehicle routing problem (Q928694) (← links)
- An iterated local search algorithm for the vehicle routing problem with convex time penalty functions (Q943841) (← links)
- An iterated local search algorithm for the time-dependent vehicle routing problem with time windows (Q951117) (← links)
- A variable neighborhood search for the capacitated arc routing problem with intermediate facilities (Q953311) (← links)
- Ant colony optimization for the two-dimensional loading vehicle routing problem (Q955597) (← links)
- A tabu search approach to an urban transport problem in northern Spain (Q955629) (← links)
- Solving the mobile mapping van problem: a hybrid metaheuristic for capacitated arc routing with soft time windows (Q975995) (← links)
- A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery (Q976005) (← links)
- The multi-shift vehicle routing problem with overtime (Q976019) (← links)
- Adaptive granular local search heuristic for a dynamic vehicle routing problem (Q1025242) (← links)
- Solving a manpower scheduling problem for airline catering using metaheuristics (Q1041027) (← links)
- Local search with annealing-like restarts to solve the VRPTW (Q1400662) (← links)
