Production scheduling and vehicle routing with time windows for perishable food products

We propose a nonlinear mathematical model to consider production scheduling and vehicle routing with time windows for perishable food products in the same framework. The demands at retailers are assumed stochastic and perishable goods will deteriorate once they were produced. Thus the revenue of the...

Full description

Saved in:
Bibliographic Details
Published in:Computers & operations research 2009-07, Vol.36 (7), p.2311-2319
Main Authors: Chen, Huey-Kuo, Hsueh, Che-Fu, Chang, Mei-Shiang
Format: Article
Language:English
Subjects:
Applied sciences
Exact sciences and technology
Food products
Heuristic
Inventory control, production control. Distribution
Operational research and scientific management
Operational research. Management science
Optimization algorithms
Perishable
Production scheduling
Routing
Stochastic models
Studies
Time windows
Vehicle routing
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We propose a nonlinear mathematical model to consider production scheduling and vehicle routing with time windows for perishable food products in the same framework. The demands at retailers are assumed stochastic and perishable goods will deteriorate once they were produced. Thus the revenue of the supplier is uncertain and depends on the value and the transaction quantity of perishable products when they are carried to retailers. The objective of this model is to maximize the expected total profit of the supplier. The optimal production quantities, the time to start producing and the vehicle routes can be determined in the model simultaneously. Furthermore, we elaborate a solution algorithm composed of the constrained Nelder–Mead method and a heuristic for the vehicle routing with time windows to solve the complex problem. Computational results indicate our algorithm is effective and efficient.
ISSN:0305-0548
1873-765X
0305-0548
DOI:10.1016/j.cor.2008.09.010