This paper concentrates on a new framework for a post-market reassignment of requests in a Collaborative Carrier Network (CCN). While the framework was applied to a pickup and delivery scenario in the literature the authors now use it for the vehicle routing of a carrier network offering LTL pickup services leading to a set of interdependent capacitated traveling salesman tours. In contrast to this previous research, the authors' approach relies on true operation costs by integrating algorithms for transportation planning within an auction-based exchange mechanism. This allows collaboration strategies in transportation markets to be assessed on a numerical basis.
The collaborative carrier vehicle routing problem for capacitated traveling salesman tours
Informatik trifft Logistik, INFORMATIK, Jahrestagung der Gesellschaft für Informatik e.V., 37 ; 75-78
2007
4 Seiten, 6 Quellen
Conference paper
English
Generalized Traveling Salesman Problem for Carrier-Vehicle Systems
Online Contents | 2014
|Exact Solutions for the Carrier—Vehicle Traveling Salesman Problem
British Library Online Contents | 2018
|Traveling-Salesman Problem for a Class of Carrier-Vehicle Systems
Online Contents | 2011
|