Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Checking the feasibility of a vehicle route in integrated supply chain transportation model

Checking the feasibility of a vehicle route in integrated supply chain transportation model 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Business Performance and Supply Chain Modelling Inderscience Publishers

Checking the feasibility of a vehicle route in integrated supply chain transportation model

Loading next page...
 
/lp/inderscience-publishers/checking-the-feasibility-of-a-vehicle-route-in-integrated-supply-chain-lxvsr5m1JT
Publisher
Inderscience Publishers
Copyright
Copyright © Inderscience Enterprises Ltd. All rights reserved
ISSN
1758-9401
eISSN
1758-941X
DOI
10.1504/IJBPSCM.2010.036202
Publisher site
See Article on Publisher Site

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.

Journal

International Journal of Business Performance and Supply Chain ModellingInderscience Publishers

Published: Jan 1, 2010

There are no references for this article.