Two heuristic solution concepts for the vehicle selection problem in line haul transports

DOI10.1016/j.ejor.2011.09.010zbMath1244.90250OpenAlexW2164452911MaRDI QIDQ439400

Günther 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

zbMATH Keywords

heuristicslogisticsplanning model for line haul transportvehicle selection in networks

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Improving LTL truck load utilization on line
• 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
• A genetic algorithm for the generalised assignment problem
• Tabu search for the multilevel generalized assignment problem
• Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
• Network hub location problems: The state of the art
• A Branch-and-Price Algorithm for the Generalized Assignment Problem
• A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem

This page was built for publication: Two heuristic solution concepts for the vehicle selection problem in line haul transports