Checking the feasibility of a vehicle route in integrated supply chain transportation model Online publication date: Fri, 29-Oct-2010
by Y. Gajpal, P.L. Abad
International Journal of Business Performance and Supply Chain Modelling (IJBPSCM), Vol. 2, No. 3/4, 2010
Abstract: The paper presents the variant of vehicle routing problem that considers the optimal integration of forward flow of materials from manufacturer to customers with a backward flow of materials from customers to specialised warehouses or recycling sites. The problem is called vehicle routing problem with simultaneous pickup and delivery (VRPSPD). In VRPSPD, a customer requires a given shipment to be delivered as well as a given load to be picked up simultaneously. Complete service (i.e., delivery and pickup) to the customer is provided by a vehicle in a single visit and thus the load of a vehicle fluctuates over the route. Given that the load fluctuates over the route, an important issue of VRPSPD is checking the feasibility of a route during local search. In this paper, we present the cumulative net-pickup approach for checking the feasibility of a vehicle route while performing neighbourhood search in local search schemes.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Business Performance and Supply Chain Modelling (IJBPSCM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook