8 papers · ranked by Valyu relevance
Samar I. Farghaly, Hala M. Khayal, Ibrahim M. Algohary, Mahmoud A. Eissa + 5 more
As mobile communication systems continue to evolve to support higher data rates, ultra-low latency, and greater reliability, the effective management of Physical Cell Identities (PCI) becomes increasingly important. The pool of available identifiers is limited-504 in fourth-generation networks and 1008 in…
Zhuo Dai, Yefu Zhou, Bibhas Chandra Giri
In supply chain management, the location of facilities, inventory control, and vehicle routing are three key components. This paper incorporates a two-warehouse inventory system into the location- inventory-routing problems (LIRPs) and develops LIRP models with two warehouses in one-level, two-level, and three-level…
Patrik Waldmann, Michael DeGiorgio
SCIP (Solving Constraint Integer Programs) is a powerful and versatile optimization solver and framework that can handle mixed integer linear programs, mixed integer quadratic programs, and general mixed integer non-linear programs with a large range of constraints (). While SCIP can be configured in many ways, its…
Xuan Lin
This paper presents a comparative study of data-driven acceleration techniques for mixed-integer bilinear programs (MIBLPs) applied to robot motion planning. MIBLPs combine discrete decision variables and nonlinear constraints, making them computationally challenging for real-time robotics applications. We investigate…
Alejandro Arenas-Vasco, Juan Carlos Rivera, Maria Gulnara Baldoquín, Yangming Zhou
This paper presents a new formulation and valid constraints for a periodic capacitated vehicle routing problem with multiple depots, heterogeneous fleet, and hard time-windows (MDHFPCVRP-TW). The problem raises from a real-world application in the vending machine industry in Medellín, Colombia. Our main contribution is…
Parth Brahmbhatt, David L. Cole, Victor M. Zavala, Styliani Avraamidou
Using Graph Modeling and Multi-Parametric Programming Authors: Parth Brahmbhatt, David L. Cole, Victor M. Zavala, Styliani Avraamidou Benders decomposition is a widely used method for solving large and structured optimization problems, but its performance is affected by the repeated solution of subproblems. We propose…
Shuangyuan Shi, Chang Liu, Lvjiang Yin, Hegen Xiong + 3 more
While the static integrated process planning and scheduling (IPPS) problem is theoretically well-established, its practical application is limited in unpredictable manufacturing environments demanding dynamic adaptability. This paper proposes a dynamic IPPS problem considering stochastic rework (IPPS-SR), whose…
Adilanmu Sitahong, Zheng Lu, Yiping Yuan, Peiyin Mo + 2 more
The Line Balancing Problem (LBP) is a classic optimization topic in production management, aiming to improve efficiency through task allocation. With the transformation of the manufacturing industry towards intelligence, customization, and sustainability, its research scope has been significantly expanded. This study…