Pages that link to "Item:Q4367240"
From MaRDI portal
The following pages link to Vehicle Routing with Time Windows: Two Optimization Algorithms (Q4367240):
Displaying 16 items.
- Urban regional logistics distribution path planning considering road characteristics (Q782070) (← links)
- A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows (Q853026) (← links)
- Local search with annealing-like restarts to solve the VRPTW (Q1400662) (← links)
- A route-neighborhood-based metaheuristic for vehicle routing problem with time windows (Q1806612) (← links)
- Approximate and robust bounded job start scheduling for Royal Mail delivery offices (Q2061143) (← links)
- Approximation algorithms for some extensions of the maximum profit routing problem (Q2105889) (← links)
- Routing optimization with time windows under uncertainty (Q2414906) (← links)
- New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP (Q2466786) (← links)
- Formulations and exact algorithms for the vehicle routing problem with time windows (Q2468488) (← links)
- Scatter search for the vehicle routing problem with time windows (Q2570159) (← links)
- A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows (Q2571182) (← links)
- A two-echelon inventory optimization model with demand time window considerations (Q2574100) (← links)
- Survey of research in the design and control of automated guided vehicle systems (Q2575559) (← links)
- A reactive MILP approach to the multidepot heterogeneous fleet vehicle routing problem with time windows (Q3422371) (← links)
- The Vehicle Routing Problem with Floating Targets: Formulation and Solution Approaches (Q5136080) (← links)
- A branch-and-bound approach for a vehicle routing problem with customer costs (Q6114901) (← links)
