Aiming at the problems of sharp path turning points, weak search directionality, and excessive number of calculation nodes in the traditional star algorithm when planning paths, the angle constraint, the way guide strategy, and the path search step size of the A star algorithm are improved....

This paper studies an extension of the rural postman problem with multiple depots and rechargeable and reusable vehicles capable of multiple trips with capacity constraints. This paper presents a new Mixed Integer Linear Programming (MILP) formulation to find optimal solutions to the problem....

The traffic assignment problem (TAP) with nonadditive path cost can only be solved by path-based algorithms owing to the characteristics of its cost structure. These algorithms generally decompose the TAP into subproblems with path flow as the variable by OD pairs and solve them sequentially. In...

The transit network design problem (TNDP) takes the form of bi-level programming and falls into the category of nondeterministic polynomial time-hard (NP-hard) problems that cannot be solved in a practical amount of computing time as the problem size increases. The upper-level objective is to...

Background: Order picking is a critical activity in end-product warehouses, particularly using the picker-to-part system, entail substantial manual labor, representing approximately 60% of warehouse work. Methods: This study develops a new linear model to perform batching, which allows for...

Background: This paper discusses the optimization of a novel fuzzy hierarchical location- routing problem, taking into consideration reliability. The mathematical model presented aims to determine the optimal locations of production centers and warehouses, as well as the optimal routing of...