Pub Date : 2013-05-29DOI: 10.1109/ICADLT.2013.6568480
H. Akrout, B. Jarboui, Abdelwaheb Rebaï, P. Siarry
Scheduling in a production workshop consists of assigning a number of different tasks to the existing machines with respect to the constraints of the problem in order to optimise the objective function. In this paper, we focus on the NoWait Flow Shop Scheduling Problem (NWFSSP) with the makespan objective. We present a new hybrid algorithm NEWGRASP-DE that combines Greedy Randomised Adaptive Search Procedure (GRASP) with Differential Evolution Algorithm (DEA). Furthermore, we used an Iterative Local Search (ILS) as an improvement phase in the GRASP method. Our algorithm is tested on instances that have been proposed in the literature. We compared our results with those of different authors. The experimental results show the effectiveness of our algorithm.
{"title":"New Greedy Randomized Adaptive Search Procedure based on differential evolution algorithm for solving no-wait flowshop scheduling problem","authors":"H. Akrout, B. Jarboui, Abdelwaheb Rebaï, P. Siarry","doi":"10.1109/ICADLT.2013.6568480","DOIUrl":"https://doi.org/10.1109/ICADLT.2013.6568480","url":null,"abstract":"Scheduling in a production workshop consists of assigning a number of different tasks to the existing machines with respect to the constraints of the problem in order to optimise the objective function. In this paper, we focus on the NoWait Flow Shop Scheduling Problem (NWFSSP) with the makespan objective. We present a new hybrid algorithm NEWGRASP-DE that combines Greedy Randomised Adaptive Search Procedure (GRASP) with Differential Evolution Algorithm (DEA). Furthermore, we used an Iterative Local Search (ILS) as an improvement phase in the GRASP method. Our algorithm is tested on instances that have been proposed in the literature. We compared our results with those of different authors. The experimental results show the effectiveness of our algorithm.","PeriodicalId":269509,"journal":{"name":"2013 International Conference on Advanced Logistics and Transport","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116750009","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-05-01DOI: 10.5220/0004832804250433
Younes Rahmani, A. Oulamara, Wahiba Ramdane-Chérif
An extended variant of Location-Routing Problem namely LRP with Multi-Product and Pickup and Delivery (LRPMPPD) is considered in this study. The proposed model deals with simultaneously selecting (locating) one or more facilities from a set of potential hub (locations), assigning customers to the selected hubs and defining routes of the vehicles for serving multi-product customers demand in such way that each selected hub must be visited once for delivering, though they can be visited many times for picking up. We propose a mixed integer linear programming formulation and a heuristic approach for this problem. Since there is not any instance compatible with LRP-MPPD in the literature, we have extended known LRP instances to evaluate the performance of the proposed approach. A comparison with CPLEX shows that the proposed algorithm is a viable approach to solve small and large size LRP-MPPD instances.
{"title":"Multi-products Location-Routing Problem with Pickup and Delivery","authors":"Younes Rahmani, A. Oulamara, Wahiba Ramdane-Chérif","doi":"10.5220/0004832804250433","DOIUrl":"https://doi.org/10.5220/0004832804250433","url":null,"abstract":"An extended variant of Location-Routing Problem namely LRP with Multi-Product and Pickup and Delivery (LRPMPPD) is considered in this study. The proposed model deals with simultaneously selecting (locating) one or more facilities from a set of potential hub (locations), assigning customers to the selected hubs and defining routes of the vehicles for serving multi-product customers demand in such way that each selected hub must be visited once for delivering, though they can be visited many times for picking up. We propose a mixed integer linear programming formulation and a heuristic approach for this problem. Since there is not any instance compatible with LRP-MPPD in the literature, we have extended known LRP instances to evaluate the performance of the proposed approach. A comparison with CPLEX shows that the proposed algorithm is a viable approach to solve small and large size LRP-MPPD instances.","PeriodicalId":269509,"journal":{"name":"2013 International Conference on Advanced Logistics and Transport","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130278644","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：