首页 | 本学科首页   官方微博 | 高级检索  
     检索      


An integer programming approach to the bloodmobile routing problem
Institution:1. Department of Computer and Communication, Southwest Jiaotong University, Emei Campus, Emeishan 614202, China;2. Institute for Logistics and Emergency Management, School of Economics and Management, Southwest Jiaotong University, Chengdu 610031, China;1. Department of Information Systems and Business Analytics, Deakin University, Melbourne, Australia;2. School of Business IT and Logistics, RMIT University, Melbourne, Australia;1. Department of Operations Management & Strategy, School of Management, State University of New York at Buffalo, Buffalo, NY, USA;2. School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran;3. IMT Atlantique, Lab-STICC, UBL, F-29238 Brest, France;1. School of Industrial Engineering, Iran University of Science and Technology, University Ave, Narmak 16846, Tehran, Iran;2. School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran;1. National School of Public Health, Athens, Greece;2. National Blood Centre (EKEA), Athens, Greece
Abstract:Every day, a blood center must determine a set of locations among a group of potential sites to route their vehicles for blood collection so as to avoid shortfalls. In this study, a vehicle routing problem is modeled using an integer programming approach to simultaneously identify number of bloodmobiles to operate and minimize the distance travelled. Additionally, the model is extended to incorporate uncertainty in blood potentials and variable durations in bloodmobile visits. Optimal routings are determined using CPLEX solver and branch-and-price algorithm. Results show that proposed algorithm solve the problem to optimality up to 30 locations within 3600 s.
Keywords:Vehicle routing problem  Health care application  Mobile blood collection  Branch-and-price algorithm  Robust optimization  Operations research
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号