Minimize the Route Length Using Heuristic Method Aided with Simulated Annealing to Reinforce Lean Management Sustainability

Abstract

Cost reduction is a cornerstone of the Lean administration’s sustainability through modify its algorithms scheme to become multi-useful. This paper focuses on control “movement” waste, to minimize pipeline, cabling and sewerage network deployments time, to avoid demurrages (i.e., constructor sectors) and quickens planning through two stages. The first belongs to the build constrained hybridization of published heuristic routing methods (e.g., S-Shape, Mid-point, Largest-Gap, Return, Ascending, FLA-5, FLA-6 [Flow Line Analysis], and Composite) to select the shortest path that serves many locations (i.e., Plan-A), while allowing for the modification of these locations during service (i.e., Plan-B). The new locations are grouped into two clusters, the first of which lay on the shortest preferred path, while the second cluster contains locations that do not lay on the preferred path and are therefore moved on the backlogs-list, then use Simulated Annealing when to serve them. Finally, the impact of the selected performance is investigated after studying its correlation with another published effective one under cost considerations. The computational results of proposed Minimize-Route-Length aided with simulated annealing (MRL-SA) significantly outperform others in terms of the performance of the routing heuristics and total costs and develop the Last Planner System, which has a good reputation in construction projects and approve the proposed algorithm to maintain its competitiveness sustainability.