An optimization algorithm for a capacitated vehicle routing problem with time windows
From MaRDI portal
Publication:2363743
Recommendations
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- Vehicle Routing with Time Windows: Two Optimization Algorithms
- scientific article; zbMATH DE number 4047423
- A way to optimally solve a time-dependent vehicle routing problem with time windows
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Polynomial-time approximation scheme for the capacitated vehicle routing problem with time windows
- scientific article; zbMATH DE number 3985132
- A GRASP for the Vehicle Routing Problem with Time Windows
- Formulations and exact algorithms for the vehicle routing problem with time windows
Cites work
- A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
- An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows and scheduled lines
- Maintenance scheduling in the electricity industry: a literature review
- Neural networks and physical systems with emergent collective computational abilities
- Optimization by simulated annealing
- Tabu Search—Part I
- Tabu Search—Part II
- The truck dispatching problem
- The vehicle routing problem: An overview of exact and approximate algorithms
- ``Neural computation of decisions in optimization problems
Cited in
(3)
This page was built for publication: An optimization algorithm for a capacitated vehicle routing problem with time windows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2363743)