Eine Plattform für die Wissenschaft: Bauingenieurwesen, Architektur und Urbanistik
Eine Plattform für die Wissenschaft: Bauingenieurwesen, Architektur und Urbanistik
Optimization on Ready-Mixed Concrete Dispatching Problem via Sliding Time Window Searching
https://orcid.org/http://orcid.org/0000-0001-8873-8437
https://orcid.org/http://orcid.org/0000-0002-1948-782X
https://orcid.org/http://orcid.org/0000-0001-6490-4365
https://orcid.org/http://orcid.org/0000-0001-9249-9264
The dispatching of ready-mixed concrete (RMC) is usually scheduled manually and difficult to meet the demand of construction sites. The inefficient dispatching plan causes concrete defects of discontinuous casting (cold joint formation) or long on-site queuing (concrete early hardening inside RMC truck). The RMC dispatching literature focus on optimizing the dispatching intervals to minimize RMC truck on-site queuing, system operation costs of RMC plant and construction sites, or tradeoff. The previous research methods include mixed-integer linear programming (MILP) and evolutionary algorithms. They have the limitations of providing optimal solutions or computation efficiency. This paper develops a Binary Linear programming with Sliding Time-Window (BLSTW) to overcome these limitations. The BLSTW model subtly determines the dispatch of RMC trucks through binary variables incorporated into sliding time window search approach. Two perspectives, from the RMC plant supplier and construction site demanders, are discussed respectively. Three case studies are conducted to verify the efficiency improvement of the developed model including one largescale example of 25 sites. The comparisons made with two cited results shows the superior of the developed model.
Optimization on Ready-Mixed Concrete Dispatching Problem via Sliding Time Window Searching
https://orcid.org/http://orcid.org/0000-0001-8873-8437
https://orcid.org/http://orcid.org/0000-0002-1948-782X
https://orcid.org/http://orcid.org/0000-0001-6490-4365
https://orcid.org/http://orcid.org/0000-0001-9249-9264
The dispatching of ready-mixed concrete (RMC) is usually scheduled manually and difficult to meet the demand of construction sites. The inefficient dispatching plan causes concrete defects of discontinuous casting (cold joint formation) or long on-site queuing (concrete early hardening inside RMC truck). The RMC dispatching literature focus on optimizing the dispatching intervals to minimize RMC truck on-site queuing, system operation costs of RMC plant and construction sites, or tradeoff. The previous research methods include mixed-integer linear programming (MILP) and evolutionary algorithms. They have the limitations of providing optimal solutions or computation efficiency. This paper develops a Binary Linear programming with Sliding Time-Window (BLSTW) to overcome these limitations. The BLSTW model subtly determines the dispatch of RMC trucks through binary variables incorporated into sliding time window search approach. Two perspectives, from the RMC plant supplier and construction site demanders, are discussed respectively. Three case studies are conducted to verify the efficiency improvement of the developed model including one largescale example of 25 sites. The comparisons made with two cited results shows the superior of the developed model.
Optimization on Ready-Mixed Concrete Dispatching Problem via Sliding Time Window Searching
https://orcid.org/http://orcid.org/0000-0001-8873-8437
https://orcid.org/http://orcid.org/0000-0002-1948-782X
https://orcid.org/http://orcid.org/0000-0001-6490-4365
https://orcid.org/http://orcid.org/0000-0001-9249-9264
The dispatching of ready-mixed concrete (RMC) is usually scheduled manually and difficult to meet the demand of construction sites. The inefficient dispatching plan causes concrete defects of discontinuous casting (cold joint formation) or long on-site queuing (concrete early hardening inside RMC truck). The RMC dispatching literature focus on optimizing the dispatching intervals to minimize RMC truck on-site queuing, system operation costs of RMC plant and construction sites, or tradeoff. The previous research methods include mixed-integer linear programming (MILP) and evolutionary algorithms. They have the limitations of providing optimal solutions or computation efficiency. This paper develops a Binary Linear programming with Sliding Time-Window (BLSTW) to overcome these limitations. The BLSTW model subtly determines the dispatch of RMC trucks through binary variables incorporated into sliding time window search approach. Two perspectives, from the RMC plant supplier and construction site demanders, are discussed respectively. Three case studies are conducted to verify the efficiency improvement of the developed model including one largescale example of 25 sites. The comparisons made with two cited results shows the superior of the developed model.
Optimization on Ready-Mixed Concrete Dispatching Problem via Sliding Time Window Searching
KSCE J Civ Eng
Hsie, Machine (Autor:in) / Huang, Chun Yen (Autor:in) / Hsiao, Wen-Ta (Autor:in) / Wu, Ming-Yen (Autor:in) / Liu, YuanChi (Autor:in)
KSCE Journal of Civil Engineering ; 26 ; 3173-3187
01.08.2022
15 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Using Lagrangian Relaxation to Solve Ready Mixed Concrete Dispatching Problems
| British Library Online Contents | 2015
Research on Dispatching Ready Mixed Concrete Based on Simulated Annealing Algorithm
| British Library Online Contents | 2011
Ready Mix Concrete Truck Dispatching Optimization on a Mobile Application
| Springer Verlag | 2023
Assessing the Accuracy of Expert-Based Decisions in Dispatching Ready Mixed Concrete
| British Library Online Contents | 2014