본문 바로가기
  • Home

Vehicle Routing for Maximizing Interlibrary-Loan Requests under Time Constraints

Heejong Lim 1 Sangbok Lee ORD ID 2 Park, Sung Jae ORD ID 2

1서울시립대학교
2한성대학교

Accredited

ABSTRACT

There are many systematic approaches to manage Interlibrary loan (ILL) efficiently. In this paper, we propose an operating method reducing user-waiting in ILL. Users are usually informed to wait around two to three days in a regional ILL service. The reason of the waiting is that there is inefficiency in running material-delivery vehicles. A mixed integer programming is employed to resolve this issue. It provides an optimal vehicle-route maximizing material-deliveries subject to time availability. We used an actual data of a regional ILL system to provide optimal vehicle routes under different time settings.

Journal Copyright Policy

BY-NC-ND 아이콘

This license enables reusers to copy and distribute the material in any medium or format in unadapted form only, for noncommercial purposes only, and only if attribution is given to the creator.

Citation status

* References for papers published after 2025 are currently being built.