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...

Packing problems are a type of fundamental global optimization problem with many real-world applications. In this paper, we propose a new variant of three-dimensional (3D) packing problem, called the Single Cylindrical Packing Problem with Cylindrical Items (SCPP-CI), which involves packing as...

This study deals with the scheduling problem to minimize makespan at a wet clean station in semiconductor fabrication. The wet clean station is comprised of sequential chemical and rinsing baths for cleaning wafer lots and multiple robot arms for lot handling. In the station, wafer lots are...

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...

The implementation of a framework for a fixed deposit system using smart contract in Remix IDE provides a secure and efficient method for managing fixed deposit accounts. This system utilizes the Ethereum blockchain, which ensures transparency, security, and immutability of data. The Smart...

Algorithmic trading enables the execution of orders using a set of rules determined by a computer program. Orders are submitted based on an asset’s expected price in the future, an approach well suited for high-volatility markets, such as those trading in cryptocurrencies. The goal of this...

Single-period dynamic assortment planning involves the retailer's decision of selecting a set of products to offer and determining their initial inventory levels, considering stochastic demand and dynamic substitution. The objective is to maximize the expected revenue, subject to a capacity...