Rodrigo Lankaites Pinheiro, Dario Landa Silva, W. Laesanklang, A. A. Constantino
{"title":"An Efficient Application of Goal Programming to Tackle Multiobjective Problems with Recurring Fitness Landscapes","authors":"Rodrigo Lankaites Pinheiro, Dario Landa Silva, W. Laesanklang, A. A. Constantino","doi":"10.1007/978-3-030-16035-7_8","DOIUrl":"https://doi.org/10.1007/978-3-030-16035-7_8","url":null,"abstract":"","PeriodicalId":235376,"journal":{"name":"International Conference on Operations Research and Enterprise Systems","volume":"319 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132735384","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}
{"title":"Solving the Flight Radius Problem","authors":"A. Idrissi, Arnaud Malapert, R. Jolin","doi":"10.5220/0006654003040311","DOIUrl":"https://doi.org/10.5220/0006654003040311","url":null,"abstract":"In this article, we present the flight radius problem on the condensed network. This problem consists of locating in the network what routes represent business opportunities that are attractive regarding time or cost criteria, and passing through a specific flight. We introduce a regret function to model the regret compared to the optimal value of such criteria. We work with a startup company specialized in air transportation. The company has developed a decision tool for airline managers to analyze and simulate a new market. Our problem is derived from this application. Thus, we start by formulating the problem as finding a maximal sub-graph such as for each node, there exists a valid path by the regret function. Then, we propose two methods for solving the problem. One using procedures of the graph database Neo4j where the condensed network is stored. The second one is a new algorithm based on Dijkstra algorithm. Finally, we have been able to report results on a set of real-world instances, based on different (OD) pairs and various values of the regret, studying the impact of considering different combinaison of node's type: Hub & Spoke.","PeriodicalId":235376,"journal":{"name":"International Conference on Operations Research and Enterprise Systems","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125576864","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}
{"title":"Data Clustering Method based on Mixed Similarity Measures","authors":"Doaa S. Ali, Ayman Ghoneim, M. Saleh","doi":"10.5220/0006245601920199","DOIUrl":"https://doi.org/10.5220/0006245601920199","url":null,"abstract":"Data clustering aims to organize data and concisely summarize it according to cluster prototypes. There are different types of data (e.g., ordinal, nominal, binary, continuous), and each has an appropriate similarity measure. However when dealing with mixed data set (i.e., a dataset that contains at least two types of data.), clustering methods use a unified similarity measure. In this study, we propose a novel clustering method for mixed datasets. The proposed mixed similarity measure (MSM) method uses a specific similarity measure for each type of data attribute. When computing distances and updating clusters’ centers, the MSM method merges between the advantages of k-modes and K-means algorithms. The proposed MSM method is tested using benchmark real life datasets obtained from the UCI Machine Learning Repository. The MSM method performance is compared against other similarity methods whether in a non-evolutionary clustering setting or an evolutionary clustering setting (using differential evolution). Based on the experimental results, the MSM method proved its efficiency in dealing with mixed datasets, and achieved significant improvement in the clustering performance in 80% of the tested datasets in the non-evolutionary clustering setting and in 90% of the tested datasets in the evolutionary clustering setting. The time and space complexity of our proposed method is analyzed, and the comparison with the other methods demonstrates the effectiveness of our method.","PeriodicalId":235376,"journal":{"name":"International Conference on Operations Research and Enterprise Systems","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126731430","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}
{"title":"K-modes and Entropy Cluster Centers Initialization Methods","authors":"Doaa S. Ali, Ayman Ghoneim, M. Saleh","doi":"10.5220/0006245504470454","DOIUrl":"https://doi.org/10.5220/0006245504470454","url":null,"abstract":"Data clustering is an important unsupervised technique in data mining which aims to extract the natural partitions in a dataset without a priori class information. Unfortunately, every clustering model is very sensitive to the set of randomly initialized centers, since such initial clusters directly influence the formation of final clusters. Thus, determining the initial cluster centers is an important issue in clustering models. Previous work has shown that using multiple clustering validity indices in a multiobjective clustering model (e.g., MODEK-Modes model) yields more accurate results than using a single validity index. In this study, we enhance the performance of MODEK-Modes model by introducing two new initialization methods. The two proposed methods are the K-Modes initialization method and the entropy initialization method. The two proposed methods are tested using ten benchmark real life datasets obtained from the UCI Machine Learning Repository. Experimental results show that the two initialization methods achieve significant improvement in the clustering performance compared to other existing initialization methods.","PeriodicalId":235376,"journal":{"name":"International Conference on Operations Research and Enterprise Systems","volume":"58 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128009121","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}
{"title":"Integrated Production and Imperfect Preventive Maintenance Planning - An Effective MILP-based Relax-and-Fix/Fix-and-Optimize Method","authors":"P. L. Tam, E. Aghezzaf, A. Khatab, C. Le","doi":"10.5220/0006285504830490","DOIUrl":"https://doi.org/10.5220/0006285504830490","url":null,"abstract":"This paper investigates the integrated production and imperfect preventive maintenance planning problem. The main objective is to determine an optimal combined production and maintenance strategy that concurrently minimizes production as well as maintenance costs during a given finite planning horizon. To enhance the quality of the solution and improve the computational time, we reconsider the reformulation of the problem proposed in (Aghezzaf et al., 2016) and then solved it with an effective MILP-based Relax-and-Fix/Fix-andOptimize method (RFFO). The results of this Relax-and-Fix/Fix-and-Optimize technique were also compared to those obtained by a Dantzig-Wolfe Decomposition (DWD) technique applied to this same reformulation of the problem. The results of this analysis show that the RFFO technique provides quite good solutions to the test problems with a noticeable improvement in computational time. DWD on the other hand exhibits a good improvement in terms of computational times, however, the quality of the solution still requires some more improvements.","PeriodicalId":235376,"journal":{"name":"International Conference on Operations Research and Enterprise Systems","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126949871","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}
H. Algethami, Dario Landa Silva, A. Martínez-Gavara
{"title":"Selecting Genetic Operators to Maximise Preference Satisfaction in a Workforce Scheduling and Routing Problem","authors":"H. Algethami, Dario Landa Silva, A. Martínez-Gavara","doi":"10.5220/0006203304160423","DOIUrl":"https://doi.org/10.5220/0006203304160423","url":null,"abstract":"The Workforce Scheduling and Routing Problem (WSRP) is a combinatorial optimisation problem that involves scheduling and routing of workforce. Tackling this type of problem often requires handling a considerable number of requirements, including customers and workers preferences while minimising both operational costs and travelling distance. This study seeks to determine effective combinations of genetic operators combined with heuristics that help to find good solutions for this constrained combinatorial optimisation problem. In particular, it aims to identify the best set of operators that help to maximise customers and workers preferences satisfaction. This paper advances the understanding of how to effectively employ different operators within two variants of genetic algorithms to tackle WSRPs. To tackle infeasibility, an initialisation heuristic is used to generate a conflict-free initial plan and a repair heuristic is used to ensure the satisfaction of constraints. Experiments are conducted using three sets of real-world Home Health Care (HHC) planning problem instances.","PeriodicalId":235376,"journal":{"name":"International Conference on Operations Research and Enterprise Systems","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131037620","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}
{"title":"Operations Research and Voting Theory","authors":"O. Hudry","doi":"10.1007/978-3-319-94767-9_2","DOIUrl":"https://doi.org/10.1007/978-3-319-94767-9_2","url":null,"abstract":"","PeriodicalId":235376,"journal":{"name":"International Conference on Operations Research and Enterprise Systems","volume":"3336 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127495580","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}
{"title":"Application of the Six Sigma Method for Improving Maintenance Processes - Case Study","authors":"M. Zasadzień","doi":"10.5220/0006184703140320","DOIUrl":"https://doi.org/10.5220/0006184703140320","url":null,"abstract":"The article presents an implementation attempt of the DMAIC method used in the Six Sigma concept for the improvement of production processes connected with maintenance. Thanks to the tools included therein (process map, FMEA, SIPOC chart) we were able to define the: problem, i.e. which types of breakdowns cause the most machine stoppage; precise structure of the failure removal process and its needs, owners, resources, client-supplier relationships in particular sub-processes; source causes for overly long stoppages.\u0000Learning the process and the causes of malfunctions allowed us to develop improvement procedures aimed at minimising the fault removal times. The procedures developed have been implemented in the company alongside a control plan, which will ensure supervision and their efficient functioning in the future.","PeriodicalId":235376,"journal":{"name":"International Conference on Operations Research and Enterprise Systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126431458","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}
{"title":"Mathematical Modeling Approaches to Solve the Line Balancing Problem","authors":"S. Salama, Alyaa Abdelhalim, A. Eltawil","doi":"10.5220/0006199404010408","DOIUrl":"https://doi.org/10.5220/0006199404010408","url":null,"abstract":"The assembly line balancing problem belongs to the class of NP-hard combinatorial optimisation problem.\u0000For several decades’ line balancing took attention of researchers who are trying to find the solutions for real\u0000world applications. Although tremendous works have been done, the gap still exists between the research and\u0000the real problems. This paper provides analysis of about 50 papers that used mathematical modeling in solving\u0000line balancing problems. Thereafter, a framework is proposed for future work.","PeriodicalId":235376,"journal":{"name":"International Conference on Operations Research and Enterprise Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125523959","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}
Timothy Curtois, W. Laesanklang, Dario Landa Silva, M. Mesgarpour, Yi Qu
{"title":"Towards Collaborative Optimisation in a Shared-logistics Environment for Pickup and Delivery Operations","authors":"Timothy Curtois, W. Laesanklang, Dario Landa Silva, M. Mesgarpour, Yi Qu","doi":"10.5220/0006291004770482","DOIUrl":"https://doi.org/10.5220/0006291004770482","url":null,"abstract":"This paper gives an overview of research work in progress within the COSLE (Collaborative Optimisation in a Shared Logistics Environment) project between the University of Nottingham and Microlise Ltd. This is an R&D project that seeks to develop optimisation technology to enable more efficient collaboration in transportation, particularly real-world operational environments involving pickup and delivery problems. The overall aim of the project is to integrate various optimisation techniques into a framework that facilitates collaboration in a shared freight transport logistics environment with the overall goal of reducing empty mileage.","PeriodicalId":235376,"journal":{"name":"International Conference on Operations Research and Enterprise Systems","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127248464","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}