A single vehicle routing problem with fixed delivery and optional collections

G. Gutiérrez-Jarpa, V. Marianov and C. Obreque

IISE Transactions, 2009, vol. 41, issue 12, 1067-1079

Abstract: The Single-Vehicle Routing Problem with Fixed Delivery and Optional Collections considers a set of delivery customers receiving goods from a depot and a set of collection customers sending goods to the same depot. All delivery customers must be visited by the vehicle, while a collection customer is visited only if the capacity of the vehicle is large enough to fit the collected load and the visit reduces collection costs that would be otherwise incurred. The goal is to minimize the transportation and collection costs. A model is proposed and solved utilizing a branch-and-cut method. Efficient new cuts are proposed. Computational experience is offered on two sets of test problems. It is proved possible to solve instances that previous methods were unable to solve. The method was tested on larger instances.

Date: 2009
References: Add references at CitEc
Citations: View citations in EconPapers (10)

Downloads: (external link)
http://hdl.handle.net/10.1080/07408170903113771 (text/html)
Access to full text is restricted to subscribers.

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:taf:uiiexx:v:41:y:2009:i:12:p:1067-1079

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/uiie20

DOI: 10.1080/07408170903113771

Access Statistics for this article

IISE Transactions is currently edited by Jianjun Shi

More articles in IISE Transactions from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().