Pages that link to "Item:Q5937017"
From MaRDI portal
The following pages link to A heuristic for the vehicle routing problem with time windows (Q5937017):
Displaying 21 items.
- Modelization of time-dependent urban freight problems by using a multiple number of distribution centers (Q262919) (← links)
- Memetic heuristic approach for solving truck and trailer routing problems with stochastic demands and time windows (Q264330) (← links)
- Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem (Q548680) (← links)
- Metaheuristics in combinatorial optimization (Q817206) (← links)
- A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows (Q953316) (← links)
- An effective memetic algorithm for the cumulative capacitated vehicle routing problem (Q975996) (← links)
- Metaheuristic approaches for solving truck and trailer routing problems with stochastic demands: a case study in dairy industry (Q1665815) (← links)
- Active guided evolution strategies for large-scale vehicle routing problems with time windows (Q1764768) (← links)
- A heuristic approach to the overnight security service problem (Q1868811) (← links)
- A multi-start local search algorithm for the vehicle routing problem with time windows (Q1887956) (← links)
- A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems (Q2488912) (← links)
- A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints (Q2503082) (← links)
- A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows (Q2506187) (← links)
- Fast local search algorithms for the handicapped persons transportation problem (Q2573013) (← links)
- An Heuristic Method for Solving Time-Sensitive Routeing Problems (Q3315236) (← links)
- Solution Improvement Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints (Q3767114) (← links)
- On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints (Q3783831) (← links)
- Intime - A New Heuristic Approach to the Vehicle Routing Problem with Time Windows, with a Bakery Fleet Case (Q4305483) (← links)
- A unified tabu search heuristic for vehicle routing problems with time windows (Q4658480) (← links)
- (Q4900606) (← links)
- Secure and efficient routing on nodes, edges, and arcs of simple‐graphs and of multi‐graphs (Q6092634) (← links)