Two heuristic solution concepts for the vehicle selection problem in line haul transports
DOI10.1016/J.EJOR.2011.09.010zbMATH Open1244.90250OpenAlexW2164452911MaRDI QIDQ439400FDOQ439400
Authors: G. Zäpfel, Michael Bögl
Publication date: 16 August 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2011.09.010
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
Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06)
Cites Work
- An approximation algorithm for the generalized assignment problem
- Title not available (Why is that?)
- A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
- Network hub location problems: The state of the art
- A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
- A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem
- Tabu search for the multilevel generalized assignment problem
- A genetic algorithm for the generalised assignment problem
- APX-hardness of domination problems in circle graphs
- Title not available (Why is that?)
- Improving LTL truck load utilization on line
Cited In (2)
Uses Software
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)