A modular algorithm for an extended vehicle scheduling problem
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3685191 (Why is no real title available?)
- scientific article; zbMATH DE number 3526435 (Why is no real title available?)
- A Heuristic Algorithm for the Vehicle-Dispatch Problem
- A heuristic routine for solving large loading problems
- A note on determining operating strategies for probabilistic vehicle routing
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Computer Solutions of the Traveling Salesman Problem
- Fast algorithms for bin packing
- Implementing vehicle routing algorithms
- Printer graphics for clustering
- Technical Note—An Effective Heuristic for the M-Tour Traveling Salesman Problem with Some Side Conditions
Cited in
(9)- A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem
- Experimentation in optimization
- Combining biased randomization with iterated local search for solving the multidepot vehicle routing problem
- Solving the multidepot vehicle routing problem with limited depot capacity and stochastic demands
- A New Heuristic for the Multi-Depot Vehicle Routing Problem that Improves upon Best-Known Solutions
- Fleet-sizing for multi-depot and periodic vehicle routing problems using a modular heuristic algorithm
- The multi-depot vehicle routing problem with inter-depot routes
- A multi-level composite heuristic for the multi-depot vehicle fleet mix problem
- A tabu search heuristic for the multi-depot vehicle routing problem
This page was built for publication: A modular algorithm for an extended vehicle scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1162919)
