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

Authors:
Huey-Kuo Chen;Che-Fu Hsueh;Mei-Shiang Chang
Affiliations:
Department of Civil Engineering, National Central University, Taoyuan 32001, Taiwan;Department of Marketing and Distribution Management, Ching Yun University, Taoyuan 32097, Taiwan;Department of Civil Engineering, Chung Yuan Christian University, Taoyuan 32023, Taiwan
Venue:
Computers and Operations Research
Year:
2009

Citing 5
Cited 3

Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research
Optimal pricing and lot-sizing under conditions of perishability and partial backordering

Management Science
A three-dimensional matching model for perishable production scheduling

Discrete Applied Mathematics
A food distribution model for famine relief

Computers and Industrial Engineering
Commentary---Optimal Pricing and Return Policies for Perishable Commodities

Marketing Science

A distribution network optimization problem for third party logistics service providers

Expert Systems with Applications: An International Journal
DEABC algorithm for perishable goods vehicle routing problem

ICIC'13 Proceedings of the 9th international conference on Intelligent Computing Theories and Technology
The impact of food perishability issues in the vehicle routing problem

Computers and Industrial Engineering

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.