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...

The planning problems confronting logistics service providers frequently involve complex decisions. Motivated by a real-life case study, this paper considers short-range weekly planning on the part of postal companies that must decide about pickup tours and delivery tours for fluctuating volume...

Preliminaries -- The Knapsack Problem and Straightforward Optimization Methods -- Search Heuristics -- Metaheuristics -- Metaheuristics in General -- Metaheuristics Based on Solution Construction -- Metaheuristics Based on Solution Modification -- Metaheuristics Based on Solution Recombination...