To accommodate the production and manufacture of complex and customized marine components and to avoid the empirical nature of process planning, machining operations can be automatically sequenced and optimized using ant colony algorithms. However, traditional ant colony algorithms exhibit issues in the context of machining process planning. In this study, an improved ant colony algorithm is proposed to address these challenges. The introduction of a tiered distribution of initial pheromones mitigates the blindness of initial searches. By incorporating the number of iterations into the expectation heuristic function and introducing a ‘reward–penalty system’ for pheromones, the contradictions between convergence speed and the tendency to fall into local optima are avoided. Applying the improved ant colony algorithm to the process planning of large container ship propeller shaft machining, this study constructs a ‘distance’ model for each machining unit and develops a process constraint table. The results show significant improvements in initial search capabilities and convergence speed with the improved ant colony algorithm while also resolving the contradiction between convergence speed and optimal solutions. This verifies the feasibility and effectiveness of the improved ant colony algorithm in intelligent process planning for ships.