Fast heuristics for a combined production planning and vehicle routing problem

Fast heuristics for a combined production planning and vehicle routing problem

0.00 Avg rating0 Votes
Article ID: iaor20091081
Country: United Kingdom
Volume: 19
Issue: 2
Start Page Number: 85
End Page Number: 96
Publication Date: Mar 2008
Journal: Production Planning and Control
Authors: , ,
Keywords: heuristics, distribution, production
Abstract:

This paper studies a problem of production and distribution of one product on a multi-period horizon. The value of co-ordinating production and distribution planning is investigated. The particular scenario addressed here concerns a plant that manufactures one product that can be stored at the plant or shipped to customers who can also store it. The product is distributed by a limited fleet of vehicles to the customers whose demands are known for each period of the planning horizon. The objective is to determine, for each period, the amount produced and the delivery trips, in order to minimise the total cost of production and distribution over the whole horizon. Two greedy heuristics followed by two local search procedures are proposed for this difficult problem.

Reviews

Required fields are marked *. Your email address will not be published.