Discretization of the Firefly Algorithm for Home Care

IF 1.7 Q2 Engineering

Canadian Journal of Electrical and Computer Engineering-Revue Canadienne De Genie Electrique et Informatique Pub Date : 2019-04-02 DOI:10.1109/CJECE.2018.2883030

L. Dekhici, R. Redjem, K. Belkadi, A. E. Mhamedi

{"title":"Discretization of the Firefly Algorithm for Home Care","authors":"L. Dekhici, R. Redjem, K. Belkadi, A. E. Mhamedi","doi":"10.1109/CJECE.2018.2883030","DOIUrl":null,"url":null,"abstract":"This paper aims to solve the problem of home-care routing by using a metaheuristic inspired by nature which is the firefly (FF) algorithm. A good discretization and correction of the solution was provided to maintain the advantages of such an algorithm on this combinatorial problem. Even if the problem is only an extension of the vehicle routing problem with time windows (TWVRP), the human aspect hardens it so that any abuse of a constraint can destroy the feasibility or reduce the services quality. Hard constraints concern the precedence between cares and a patient cares synchronization, while soft constraints concern time windows preferences. The problem in this paper also takes into account overtime and the painfulness of home workers. The main purpose is to minimize the routing total duration and to maximize the constraints satisfaction. The results on two examples show that the discrete version of the FF algorithm gives a better total travel time and better satisfies the constraints.","PeriodicalId":55287,"journal":{"name":"Canadian Journal of Electrical and Computer Engineering-Revue Canadienne De Genie Electrique et Informatique","volume":null,"pages":null},"PeriodicalIF":1.7000,"publicationDate":"2019-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/CJECE.2018.2883030","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Canadian Journal of Electrical and Computer Engineering-Revue Canadienne De Genie Electrique et Informatique","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CJECE.2018.2883030","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Engineering","Score":null,"Total":0}

引用次数: 10

Abstract

This paper aims to solve the problem of home-care routing by using a metaheuristic inspired by nature which is the firefly (FF) algorithm. A good discretization and correction of the solution was provided to maintain the advantages of such an algorithm on this combinatorial problem. Even if the problem is only an extension of the vehicle routing problem with time windows (TWVRP), the human aspect hardens it so that any abuse of a constraint can destroy the feasibility or reduce the services quality. Hard constraints concern the precedence between cares and a patient cares synchronization, while soft constraints concern time windows preferences. The problem in this paper also takes into account overtime and the painfulness of home workers. The main purpose is to minimize the routing total duration and to maximize the constraints satisfaction. The results on two examples show that the discrete version of the FF algorithm gives a better total travel time and better satisfies the constraints.

查看原文本刊更多论文

居家护理萤火虫算法的离散化

本文旨在利用自然界启发的元启发式算法——萤火虫算法(FF)来解决居家护理路径问题。为了保持该算法在组合问题上的优势，对解进行了良好的离散化和校正。即使该问题只是带时间窗车辆路径问题的扩展，人为因素也会使其变得更加复杂，任何约束的滥用都可能破坏可行性或降低服务质量。硬约束涉及护理和患者护理同步之间的优先级，而软约束涉及时间窗口偏好。本文的问题还考虑了加班和家庭工作者的痛苦。其主要目的是最小化路由总时间和最大化约束满足。两个算例的结果表明，离散版本的FF算法得到了更好的总行程时间，并且更好地满足了约束条件。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Canadian Journal of Electrical and Computer Engineering-Revue Canadienne De Genie Electrique et Informatique 工程技术-工程：电子与电气

自引率

0.00%

发文量

期刊介绍： The Canadian Journal of Electrical and Computer Engineering (ISSN-0840-8688), issued quarterly, has been publishing high-quality refereed scientific papers in all areas of electrical and computer engineering since 1976