 |
International Society of Science and Applied Technologies |
| An Algorithm for Obtaining the Pareto-Optimal Solutions of the Reservation Frame Allocations in a Complete Reservation System | ||||
| Author | Hiroyuki Ichihara
|
|||
| Co-Author(s) | Satoshi Mizutani; Mitsutaka Kimura
|
|||
| Abstract | We propose an algorithm for obtaining the Pareto-optimal solutions for the optimization problem of [3]. In [3], we discuss an optimization model to obtain a reservation frame allocation which minimizes the waiting times for all customers and the idle times for all frames in a complete reservation system. The optimization model can be formulated as the multiobjective optimization problem. The typical solutions of the problem are listed as Pareto-optimal solutions. In this paper, we give the definitions of Pareto-dominance and of Paretooptimal solutions in the reservation frame allocation problem, and we propose an algorithm for obtaining the Pareto-optimal solutions based on these definitions. In addition, we show the effectiveness of the Pareto-optimal solution by comparing with the solution in [3].
|
|||
| Keywords | Scheduling, Multi-Objective Optimization, Pareto-Optimal Solutions, Simulation | |||
| Article #: RQD2025-198 | ||||
Proceedings of 30th ISSAT International Conference on Reliability & Quality in Design |