Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 235, Issue 3, Pages 530-539Publisher
ELSEVIER
DOI: 10.1016/j.ejor.2013.10.038
Keywords
Integer programming; Pickup-and-delivery; Vehicle routing; Transshipment; Transportation-on-demand; Modeling
Funding
- FCT (Fundacao para a Cienciae a Tecnologia - Portugal) [PTDC/EIA-EIA/100645/2008]
- Fundação para a Ciência e a Tecnologia [PTDC/EIA-EIA/100645/2008] Funding Source: FCT
Ask authors/readers for more resources
In recent years, many important real-world applications are studied as rich vehicle routing problems that are variants and generalizations of the well-known vehicle routing problem. In this paper we address the pickup-and-delivery version of this problem and consider further generalization by allowing transshipment in the network. Moreover, we allow heterogenous vehicles and flexible fleet size. We describe mixed integer-programming formulations for the problem with and without time windows for services. The number of constraints and variables in the models are bounded by polynomial size of the problem. We discuss several problem variants that are either captured by our models or can be easily captured through simple modifications. Computational work gave promising results and confirms that transshipment in network can indeed enhance optimization. (C) 2013 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available