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

► A mathematical model for vehicle selection for line haul in hub-and-spoke networks is developed. ► Two different heuristic solution concepts are proposed based on real life problem properties. ► Their efficiency for different generated problems is analyzed. ► Conditions are stated in which cases s...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research 2012-03, Vol.217 (2), p.448-458
Main Authors: Zäpfel, Günther, Bögl, Michael
Format: Article
Language:English
Subjects:
Applied sciences
Approximation
Assignment problem
Decision theory. Utility theory
Exact sciences and technology
Flows in networks. Combinatorial problems
Freight
Heuristic
Heuristics
Integer programming
Leasing
Logistics
Mathematical models
Operational research
Operational research and scientific management
Operational research. Management science
Optimization
Planning model for line haul transport
Studies
Transport
Vehicle selection in networks
Vehicles
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:► A mathematical model for vehicle selection for line haul in hub-and-spoke networks is developed. ► Two different heuristic solution concepts are proposed based on real life problem properties. ► Their efficiency for different generated problems is analyzed. ► Conditions are stated in which cases such heuristic solution concepts lead to good results. In this article we will develop a mathematical model for a cost-efficient selection of vehicles with varying capacities for line haul transports with leasing options. For this integer optimization problem, which is a variant of the generalized assignment problem known as NP-hard, we will compare two heuristic solution concepts and try to answer the question in which cases a user should choose an exact or approximate solution concept depending on different data instances of the problem.
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2011.09.010