Task selection and routing problems in collaborative truckload transportation

Ran Liu, Zhibin Jiang, Xiao Liu and Feng Chen

Transportation Research Part E: Logistics and Transportation Review, 2010, vol. 46, issue 6, 1071-1085

Abstract: This paper introduces the task selection and routing problem in collaborative transportation in which a truckload carrier receives tasks from shippers and other partners and makes a selection between a private vehicle and an external carrier to serve each task. The objective is to minimize the variable and fixed costs for operating the private fleet plus the total costs charged by the external carrier. The mathematical formulation and the lower bound are established. A memetic algorithm is developed to solve the problem. The computational results show that the proposed algorithm is effective and efficient.

Keywords: Collaborative; transportation; Full; truckload; Task; selection; Routing; Memetic; algorithm (search for similar items in EconPapers)
Date: 2010
References: Add references at CitEc
Citations: View citations in EconPapers (16)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S1366554510000554
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:transe:v:46:y:2010:i:6:p:1071-1085

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/bibliographic
http://www.elsevier. ... 600244/bibliographic

Access Statistics for this article

Transportation Research Part E: Logistics and Transportation Review is currently edited by W. Talley

More articles in Transportation Research Part E: Logistics and Transportation Review from Elsevier
Bibliographic data for series maintained by Catherine Liu ().