Pub Date : 2021-02-26DOI: 10.1007/s10732-021-09468-y
Renata Turkeš, K. Sörensen, D. Cuervo
{"title":"A matheuristic for the stochastic facility location problem","authors":"Renata Turkeš, K. Sörensen, D. Cuervo","doi":"10.1007/s10732-021-09468-y","DOIUrl":"https://doi.org/10.1007/s10732-021-09468-y","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"27 1","pages":"649 - 694"},"PeriodicalIF":2.7,"publicationDate":"2021-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-021-09468-y","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49018211","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-02-23DOI: 10.1007/s10732-021-09467-z
Stephen J. Maher
{"title":"Enhancing large neighbourhood search heuristics for Benders’ decomposition","authors":"Stephen J. Maher","doi":"10.1007/s10732-021-09467-z","DOIUrl":"https://doi.org/10.1007/s10732-021-09467-z","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"27 1","pages":"615 - 648"},"PeriodicalIF":2.7,"publicationDate":"2021-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-021-09467-z","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49462992","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-02-19DOI: 10.1007/s10732-021-09470-4
M. Abouhawwash, K. Deb
{"title":"Reference point based evolutionary multi-objective optimization algorithms with convergence properties using KKTPM and ASF metrics","authors":"M. Abouhawwash, K. Deb","doi":"10.1007/s10732-021-09470-4","DOIUrl":"https://doi.org/10.1007/s10732-021-09470-4","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"27 1","pages":"575 - 614"},"PeriodicalIF":2.7,"publicationDate":"2021-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-021-09470-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45000607","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-02-06DOI: 10.1007/s10732-021-09469-x
M. Martins, Mohamed El Yafrani, M. Delgado, R. Lüders, Roberto Santana, H. Siqueira, H. G. Akcay, B. Ahiod
{"title":"Analysis of Bayesian Network Learning Techniques for a Hybrid Multi-objective Bayesian Estimation of Distribution Algorithm: a case study on MNK Landscape","authors":"M. Martins, Mohamed El Yafrani, M. Delgado, R. Lüders, Roberto Santana, H. Siqueira, H. G. Akcay, B. Ahiod","doi":"10.1007/s10732-021-09469-x","DOIUrl":"https://doi.org/10.1007/s10732-021-09469-x","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"27 1","pages":"549 - 573"},"PeriodicalIF":2.7,"publicationDate":"2021-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-021-09469-x","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48946169","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-01-31DOI: 10.1007/s10732-020-09465-7
P. Moscato, Luke Mathieson, Mohammad Nazmul Haque
{"title":"Augmented intuition: a bridge between theory and practice","authors":"P. Moscato, Luke Mathieson, Mohammad Nazmul Haque","doi":"10.1007/s10732-020-09465-7","DOIUrl":"https://doi.org/10.1007/s10732-020-09465-7","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"27 1","pages":"497 - 547"},"PeriodicalIF":2.7,"publicationDate":"2021-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-020-09465-7","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41626874","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-01-30DOI: 10.1007/s10732-021-09466-0
Filipe Rodrigues, A. Agra, L. M. Hvattum, C. Requejo
{"title":"Weighted proximity search","authors":"Filipe Rodrigues, A. Agra, L. M. Hvattum, C. Requejo","doi":"10.1007/s10732-021-09466-0","DOIUrl":"https://doi.org/10.1007/s10732-021-09466-0","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"27 1","pages":"459 - 496"},"PeriodicalIF":2.7,"publicationDate":"2021-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-021-09466-0","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48924990","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-01-13DOI: 10.1007/s10732-020-09463-9
Pengfei Zhou, Li Lin, Kap-Hwan Kim
{"title":"Anisotropic Q-learning and waiting estimation based real-time routing for automated guided vehicles at container terminals","authors":"Pengfei Zhou, Li Lin, Kap-Hwan Kim","doi":"10.1007/s10732-020-09463-9","DOIUrl":"https://doi.org/10.1007/s10732-020-09463-9","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"29 1","pages":"207 - 228"},"PeriodicalIF":2.7,"publicationDate":"2021-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-020-09463-9","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42298565","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-01-06DOI: 10.1007/s10732-020-09464-8
Hoang Huu Viet, Nguyen Thi Uyen, SeungGwan Lee, TaeChoong Chung, Le Hong Trang
In this paper, we propose a heuristic search algorithm based on maximum conflicts to find a weakly stable matching of maximum size for the stable marriage problem with ties and incomplete lists. The key idea of our approach is to define a heuristic function based on the information extracted from undominated blocking pairs from the men’s point of view. By choosing a man corresponding to the maximum value of the heuristic function, we aim to not only remove all the blocking pairs formed by the man but also reject as many blocking pairs as possible for an unstable matching from the women’s point of view to obtain a solution of the problem as quickly as possible. Experiments show that our algorithm is efficient in terms of both execution time and solution quality for solving the problem.
{"title":"A max-conflicts based heuristic search for the stable marriage problem with ties and incomplete lists","authors":"Hoang Huu Viet, Nguyen Thi Uyen, SeungGwan Lee, TaeChoong Chung, Le Hong Trang","doi":"10.1007/s10732-020-09464-8","DOIUrl":"https://doi.org/10.1007/s10732-020-09464-8","url":null,"abstract":"<p>In this paper, we propose a heuristic search algorithm based on maximum conflicts to find a weakly stable matching of maximum size for the stable marriage problem with ties and incomplete lists. The key idea of our approach is to define a heuristic function based on the information extracted from undominated blocking pairs from the men’s point of view. By choosing a man corresponding to the maximum value of the heuristic function, we aim to not only remove all the blocking pairs formed by the man but also reject as many blocking pairs as possible for an unstable matching from the women’s point of view to obtain a solution of the problem as quickly as possible. Experiments show that our algorithm is efficient in terms of both execution time and solution quality for solving the problem.\u0000</p>","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"4 4","pages":""},"PeriodicalIF":2.7,"publicationDate":"2021-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138527656","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-01-01Epub Date: 2021-06-07DOI: 10.1007/s10732-021-09480-2
Andrei M Bandalouski, Natalja G Egorova, Mikhail Y Kovalyov, Erwin Pesch, S Armagan Tarim
In this paper we present a novel approach to the dynamic pricing problem for hotel businesses. It includes disaggregation of the demand into several categories, forecasting, elastic demand simulation, and a mathematical programming model with concave quadratic objective function and linear constraints for dynamic price optimization. The approach is computationally efficient and easy to implement. In computer experiments with a hotel data set, the hotel revenue is increased by about 6% on average in comparison with the actual revenue gained in a past period, where the fixed price policy was employed, subject to an assumption that the demand can deviate from the suggested elastic model. The approach and the developed software can be a useful tool for small hotels recovering from the economic consequences of the COVID-19 pandemic.
{"title":"Dynamic pricing with demand disaggregation for hotel revenue management.","authors":"Andrei M Bandalouski, Natalja G Egorova, Mikhail Y Kovalyov, Erwin Pesch, S Armagan Tarim","doi":"10.1007/s10732-021-09480-2","DOIUrl":"10.1007/s10732-021-09480-2","url":null,"abstract":"<p><p>In this paper we present a novel approach to the dynamic pricing problem for hotel businesses. It includes disaggregation of the demand into several categories, forecasting, elastic demand simulation, and a mathematical programming model with concave quadratic objective function and linear constraints for dynamic price optimization. The approach is computationally efficient and easy to implement. In computer experiments with a hotel data set, the hotel revenue is increased by about 6% on average in comparison with the actual revenue gained in a past period, where the fixed price policy was employed, subject to an assumption that the demand can deviate from the suggested elastic model. The approach and the developed software can be a useful tool for small hotels recovering from the economic consequences of the COVID-19 pandemic.</p>","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"27 1","pages":"869-885"},"PeriodicalIF":1.1,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8183332/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46985415","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-01-01Epub Date: 2021-04-28DOI: 10.1007/s10732-021-09474-0
Fredrik Ødegaard, Sudipendra Nath Roy
Platelets are valuable, but highly perishable, blood components used in the treatment of, among others, viral dengue fever, blood-related illness, and post-chemotherapy following cancer. Given the short shelf-life of 3-5 days and a highly volatile supply and demand pattern, platelet inventory allocation is a challenging task. This is especially prevalent in emerging economies where demand variability is more pronounced due to neglected tropical diseases, and a perpetual shortage of supply. The consequences of which have given rise to an illegal 'red market'. Motivated by experience at a regional hospital in India, we investigate the problem of platelet allocation among three priority-differentiated demand streams. Specifically we consider a central hospital which, in addition to internal emergency and non-emergency requests, faces external demand from local clinics. We analyze the platelet allocation decision from a social planner's perspective and propose an allocation heuristic based on revenue management (RM) principles. The objective is to maximize total social benefit in a highly supply-constrained environment. Using data from the aforementioned Indian hospital as a case study, we conduct a numerical simulation and sensitivity analysis to evaluate the allocation heuristic. The performance of the RM-based policy is evaluated against the current sequential first come, first serve policy and two fixed proportion-based rationing policies. It is shown that the RM-based policy overall dominates, serves patients with the highest medical urgency better, and can curtail patients' need to procure platelets from commercial sources.
{"title":"Heuristic-based allocation of supply constrained blood platelets in emerging economies.","authors":"Fredrik Ødegaard, Sudipendra Nath Roy","doi":"10.1007/s10732-021-09474-0","DOIUrl":"10.1007/s10732-021-09474-0","url":null,"abstract":"<p><p>Platelets are valuable, but highly perishable, blood components used in the treatment of, among others, viral dengue fever, blood-related illness, and post-chemotherapy following cancer. Given the short shelf-life of 3-5 days and a highly volatile supply and demand pattern, platelet inventory allocation is a challenging task. This is especially prevalent in emerging economies where demand variability is more pronounced due to neglected tropical diseases, and a perpetual shortage of supply. The consequences of which have given rise to an illegal 'red market'. Motivated by experience at a regional hospital in India, we investigate the problem of platelet allocation among three priority-differentiated demand streams. Specifically we consider a central hospital which, in addition to internal emergency and non-emergency requests, faces external demand from local clinics. We analyze the platelet allocation decision from a social planner's perspective and propose an allocation heuristic based on revenue management (RM) principles. The objective is to maximize total social benefit in a highly supply-constrained environment. Using data from the aforementioned Indian hospital as a case study, we conduct a numerical simulation and sensitivity analysis to evaluate the allocation heuristic. The performance of the RM-based policy is evaluated against the current sequential first come, first serve policy and two fixed proportion-based rationing policies. It is shown that the RM-based policy overall dominates, serves patients with the highest medical urgency better, and can curtail patients' need to procure platelets from commercial sources.</p>","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"27 1","pages":"719-745"},"PeriodicalIF":1.1,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8079886/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43445389","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
扫码关注我们
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号