Two heuristic solution concepts for the vehicle selection problem in line haul transports
From MaRDI portal
(Redirected from Publication:439400)
Recommendations
- A Heuristic Algorithm for the Auto-Carrier Transportation Problem
- A heuristic for the routing and carrier selection problem
- The dynamic vehicle allocation problem with application in trucking companies in Brazil
- Heuristic and exact algorithms for a min-max selective vehicle routing problem
- Operations research and goods transportation
Cites work
- scientific article; zbMATH DE number 2089255 (Why is no real title available?)
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
- A genetic algorithm for the generalised assignment problem
- A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil
- A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem
- APX-hardness of domination problems in circle graphs
- An approximation algorithm for the generalized assignment problem
- Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
- Improving LTL truck load utilization on line
- Network hub location problems: The state of the art
- Tabu search for the multilevel generalized assignment problem
Cited in
(2)
This page was built for publication: Two heuristic solution concepts for the vehicle selection problem in line haul transports
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q439400)