Modelling and solving for ready-mixed concrete scheduling problems with time dependence
by Guo-Chen Zhang; Jian-Chao Zeng
International Journal of Computing Science and Mathematics (IJCSM), Vol. 4, No. 2, 2013

Abstract: In this paper, we present a formulation for the ready-mixed concrete scheduling problems with time-dependent travel time. Traffic congestion is a major problem for the business of delivering RMC. It may lead to late deliveries of RMC to construction sites, and because RMC is perishable, late deliveries also mean large additional costs for both batch plants and the construction companies. Additional costs caused by traffic congestion can be reduced by taking predictable traffic congestion into account in the process of scheduling. For this purpose we develop a model with consideration of traffic congestion of RMC which uses a heuristic approach based on local search algorithm to solve. A detailed case study based on industrial data is used to illustrate the potential of the proposed approach.

Online publication date: Sat, 10-May-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Computing Science and Mathematics (IJCSM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your 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