A new variant of the full truckload vehicle routing problem is studied. In this problem there is more than one delivery point corresponding to the same pickup point, and one order is allowed to be served several times by the same vehicle or different vehicles. For the orders which cannot be assigned because of resource constraints, the logistics company outsources them to other logistics companies at a certain cost. To maximize its profits, a logistics company decides what is to be transported by private fleet and what is to be outsourced. The mathematical model is constructed for the problem. Since the problem is NP-hard and it is difficult to solve the large-scale problems with an exact algorithm, a hybrid genetic algorithm is proposed. Computational results show the effectiveness of the hybrid genetic algorithm.
Full Truckload Vehicle Routing Problem with Profits
14th COTA International Conference of Transportation Professionals ; 2014 ; Changsha, China
CICTP 2014 ; 864-875
24.06.2014
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
A set-covering model for a bidirectional multi-shift full truckload vehicle routing problem
Online Contents | 2015
|Multi-routing for Transport-Matching in Cooperative, Full Truckload, Relay Networks
British Library Conference Proceedings | 2017
|