A new intuitional algorithm for solving heterogeneous fixed fleet routing problems: passenger pickup algorithm
From MaRDI portal
Publication:856161
Recommendations
- A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem
- A hybrid algorithm for the heterogeneous fleet vehicle routing problem
- A skewed general variable neighborhood search algorithm with fixed threshold for the heterogeneous fleet vehicle routing problem
- A tabu search heuristic for the heterogeneous fleet vehicle routing problem
- A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem.
Cites work
- A heuristic column generation method for the heterogeneous fleet VRP
- A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem.
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- Incorporating vehicle into the vehicle routing fleet composition problem
- The fleet size and mix vehicle routing problem
Cited in
(5)- Adaptive neighborhood simulated annealing for the heterogeneous fleet vehicle routing problem with multiple cross-docks
- Hybrid data mining heuristics for the heterogeneous fleet vehicle routing problem
- A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem
- Thirty years of heterogeneous vehicle routing
- Industrial aspects and literature survey: fleet composition and routing
This page was built for publication: A new intuitional algorithm for solving heterogeneous fixed fleet routing problems: passenger pickup algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856161)