A Hybrid MIP/Heuristic Model for Experience Based Driver Assignment

H. Lau, R. Thangarajoo, K. Ng
{"title":"A Hybrid MIP/Heuristic Model for Experience Based Driver Assignment","authors":"H. Lau, R. Thangarajoo, K. Ng","doi":"10.1109/ICTAI.2006.12","DOIUrl":null,"url":null,"abstract":"In this paper, we describe an interesting driver assignment problem that is computationally intensive to solve due to its combinatorial nature. A hybrid approach involving mixed integer programming (MIP) and a heuristic is used to give good solutions to the problem within reasonable computation time. This approach attempts to utilize the strengths of MIP to search for an optimal solution, while letting the heuristic component address the complexity involved in the driver assignment problem so as to improve the time required to obtain a solution. Computational results are used to illustrate the performance of the approach","PeriodicalId":169424,"journal":{"name":"2006 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'06)","volume":"103 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTAI.2006.12","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

In this paper, we describe an interesting driver assignment problem that is computationally intensive to solve due to its combinatorial nature. A hybrid approach involving mixed integer programming (MIP) and a heuristic is used to give good solutions to the problem within reasonable computation time. This approach attempts to utilize the strengths of MIP to search for an optimal solution, while letting the heuristic component address the complexity involved in the driver assignment problem so as to improve the time required to obtain a solution. Computational results are used to illustrate the performance of the approach
基于经验的驾驶员分配混合MIP/启发式模型
在本文中,我们描述了一个有趣的驱动分配问题,由于其组合性质,它的计算强度很大。采用混合整数规划(MIP)与启发式算法相结合的混合方法,在合理的计算时间内给出了较好的解。这种方法试图利用MIP的优势来搜索最优解,同时让启发式组件解决驱动分配问题中涉及的复杂性,从而缩短获得解所需的时间。计算结果说明了该方法的有效性
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信