861. Simultaneous production scheduling and transportation problem with knapsack constraints in a mobile 3D printer
Invited abstract in session WB-15: Discrete, continuous or stochastic optimization and control in networks, transportation and design 2, stream Combinatorial Optimization.
Wednesday, 10:30-12:00Room: Esther Simpson 1.08
Authors (first author is the speaker)
| 1. | Enyuan Fu
|
| College of Management and Economics, Tianjin University | |
| 2. | Zhaofang Mao
|
| Tianjin University | |
| 3. | Kan Fang
|
| Management and Economics, Tianjin University | |
| 4. | Yida Xu
|
| Tianjin University |
Abstract
This paper addresses a simultaneous production scheduling and transportation problem with a mobile 3D printer, which operates as a vehicle installed with a mobile smart factory required for the simultaneous production and transportation of products to be delivered to the customer with the minimization of delivery time. Considering the variability of road transportation conditions, this study explores scenarios where continuous processing of products across nodes is not permitted. To solve this problem, a mixed integer linear programming model is formulated, and an exact algorithm based on Benders decomposition method is proposed, followed by an adaptive large neighborhood algorithm and several accelerating strategies. A comprehensive computational study is conducted to evaluate the effectiveness of the proposed algorithm, yielding managerial insights into route selection and the allocation of products for processing along arcs.
Keywords
- Combinatorial Optimization
- Programming, Mixed-Integer
- Algorithms
Status: accepted
Back to the list of papers