Pub Date : 2017-09-01DOI: 10.1109/SOLI.2017.8120986
Asma Troudi, S. Addouche, S. Dellagi, A. E. Mhamedi
This paper treats a drone delivery parcel's problematic in an urban area. The civil application of drone has been developed during these last decades especially drone delivery applications. In this paper, we focus on drone delivery application in the urban area for last-mile parcel delivery. The new issue is not only the drone design but also the logistics support of a massive fleet of drones with a mission to deliver parcels in a dense urban area. We hereby treat problematic by focusing on Logistics Support System. In this context, the commercialized drone is a considered as a system on the shelf. we propose a Post-Production Logistics Support Analysis to cover the exploitation phase of a drone delivery operator.
{"title":"Post-production analysis approach for drone delivery fleet","authors":"Asma Troudi, S. Addouche, S. Dellagi, A. E. Mhamedi","doi":"10.1109/SOLI.2017.8120986","DOIUrl":"https://doi.org/10.1109/SOLI.2017.8120986","url":null,"abstract":"This paper treats a drone delivery parcel's problematic in an urban area. The civil application of drone has been developed during these last decades especially drone delivery applications. In this paper, we focus on drone delivery application in the urban area for last-mile parcel delivery. The new issue is not only the drone design but also the logistics support of a massive fleet of drones with a mission to deliver parcels in a dense urban area. We hereby treat problematic by focusing on Logistics Support System. In this context, the commercialized drone is a considered as a system on the shelf. we propose a Post-Production Logistics Support Analysis to cover the exploitation phase of a drone delivery operator.","PeriodicalId":190544,"journal":{"name":"2017 IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123782491","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 : 2017-09-01DOI: 10.1109/SOLI.2017.8120969
M. Koháni, J. Janáček
Crew scheduling is an important optimization problem in the railway industry. In last decades, the extension of computational resources made it feasible to address real-life problems generating large-scale set covering problems. Broadly used is the concept of shift frames, which is well suited current practice of several railway operators. In the case when the problem is described by one complete model, which covers all characteristics of the crew scheduling problem, it may lead to a large linear programming problem formulation, which can attack the limits of a common IP-solver. To overcome this obstacle, column generation technique can be used. Column generation technique can reduce the size of solved model. Despite the fact that it cannot find the optimal solution, it can enable to solve larger instances. In this contribution we explain the concept of frames used in design of periodic timetable and analyze the property of the particular frame networks. We explain the column generating principle in connection with the crew scheduling problem. We present improving methods to accelerate the column generation method that are able to find solution of the solved sub-problem faster and different strategies of producing the initial collections of columns, which enable to make the column generation process more effective. Although the computational time in the scheduling problems is not an critical issue, the reduce of the computational time can enable to use this method in the decision supporting tool for the crew schedule design under practical conditions, especially in large scale problems. To test proposed improvements we use various benchmarks of real problems from crew scheduling in railway transportation systems.
{"title":"Acceleration strategies of the column generation method for the crew scheduling problem","authors":"M. Koháni, J. Janáček","doi":"10.1109/SOLI.2017.8120969","DOIUrl":"https://doi.org/10.1109/SOLI.2017.8120969","url":null,"abstract":"Crew scheduling is an important optimization problem in the railway industry. In last decades, the extension of computational resources made it feasible to address real-life problems generating large-scale set covering problems. Broadly used is the concept of shift frames, which is well suited current practice of several railway operators. In the case when the problem is described by one complete model, which covers all characteristics of the crew scheduling problem, it may lead to a large linear programming problem formulation, which can attack the limits of a common IP-solver. To overcome this obstacle, column generation technique can be used. Column generation technique can reduce the size of solved model. Despite the fact that it cannot find the optimal solution, it can enable to solve larger instances. In this contribution we explain the concept of frames used in design of periodic timetable and analyze the property of the particular frame networks. We explain the column generating principle in connection with the crew scheduling problem. We present improving methods to accelerate the column generation method that are able to find solution of the solved sub-problem faster and different strategies of producing the initial collections of columns, which enable to make the column generation process more effective. Although the computational time in the scheduling problems is not an critical issue, the reduce of the computational time can enable to use this method in the decision supporting tool for the crew schedule design under practical conditions, especially in large scale problems. To test proposed improvements we use various benchmarks of real problems from crew scheduling in railway transportation systems.","PeriodicalId":190544,"journal":{"name":"2017 IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122008057","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 : 2017-09-01DOI: 10.1109/SOLI.2017.8120981
F. Basile, P. Chiacchio, E. D. Marino
Automated warehouse systems play a key role in manufacturing systems and are currently controlled using hierarchical and centralized control architectures. The Interface system between the picking and storage area represents the most critical subsystem in automated warehouse systems and needs breakdown robustness and scalability. These requirements suggests the development of decentralized control solutions. However, the development of effective decentralized control solutions for these systems, which requires the coordination of vehicles moving along a monodimensional guide-path, is still a complex task. At this aim, an agent based approach using a sealed-bid auction mechanism is proposed in this paper.
{"title":"An auction-based approach for the coordination of vehicles in automated warehouse systems","authors":"F. Basile, P. Chiacchio, E. D. Marino","doi":"10.1109/SOLI.2017.8120981","DOIUrl":"https://doi.org/10.1109/SOLI.2017.8120981","url":null,"abstract":"Automated warehouse systems play a key role in manufacturing systems and are currently controlled using hierarchical and centralized control architectures. The Interface system between the picking and storage area represents the most critical subsystem in automated warehouse systems and needs breakdown robustness and scalability. These requirements suggests the development of decentralized control solutions. However, the development of effective decentralized control solutions for these systems, which requires the coordination of vehicles moving along a monodimensional guide-path, is still a complex task. At this aim, an agent based approach using a sealed-bid auction mechanism is proposed in this paper.","PeriodicalId":190544,"journal":{"name":"2017 IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134402327","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}
We propose a novel distributed approach for the problem of scheduling a fleet of autonomous vehicles. Our distributed system avoids a single point of failure, is scalable, fault tolerant and robust. We describe an agent-based distributed system to conduct a set of procurement auctions. The vehicles are the “sellers” and the passengers are the “buyers” in the auction. Each vehicle bids for the passengers with a bid value which is an inverse function of the time it would take the vehicle to reach the passenger. In our agent based architecture, the various software agents reside on different systems and we describe distributed algorithms for their communication. We have performed simulations of a vehicle fleet in two different locations (Bangalore, India and Tyson's Corner, Virginia, USA) and compare the maximum and average waiting times of the passenger of our algorithm with a FIFO algorithm. We also compute the ratio of the time in which the vehicle is servicing a passenger to the total time to compute the fuel wastage. The results show that our system improves the maximum and average waiting times of the passengers, as well as the fuel costs for the vehicle fleet. Furthermore, we show that such a distributed system reduces the time it would take on average to respond to customer requests, as compared to a system which is not distributed.
{"title":"Online scheduling of a fleet of autonomous vehicles using agent-based procurement auctions","authors":"Meghana Madhyastha, Sriveda Chevuru Reddy, Shrisha Rao","doi":"10.1109/SOLI.2017.8120980","DOIUrl":"https://doi.org/10.1109/SOLI.2017.8120980","url":null,"abstract":"We propose a novel distributed approach for the problem of scheduling a fleet of autonomous vehicles. Our distributed system avoids a single point of failure, is scalable, fault tolerant and robust. We describe an agent-based distributed system to conduct a set of procurement auctions. The vehicles are the “sellers” and the passengers are the “buyers” in the auction. Each vehicle bids for the passengers with a bid value which is an inverse function of the time it would take the vehicle to reach the passenger. In our agent based architecture, the various software agents reside on different systems and we describe distributed algorithms for their communication. We have performed simulations of a vehicle fleet in two different locations (Bangalore, India and Tyson's Corner, Virginia, USA) and compare the maximum and average waiting times of the passenger of our algorithm with a FIFO algorithm. We also compute the ratio of the time in which the vehicle is servicing a passenger to the total time to compute the fuel wastage. The results show that our system improves the maximum and average waiting times of the passengers, as well as the fuel costs for the vehicle fleet. Furthermore, we show that such a distributed system reduces the time it would take on average to respond to customer requests, as compared to a system which is not distributed.","PeriodicalId":190544,"journal":{"name":"2017 IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133372948","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 : 2017-09-01DOI: 10.1109/SOLI.2017.8120960
Kohtaroh Miyamoto, Akira Koseki, Masaki Ohno
Frequently-asked-question (FAQ) systems are effective in operating and reducing costs of IT services. Basically, FAQ data preparation requires data curation of available heterogeneous question-and-answer (QA) data sets and creating FAQ clusters. We identified that the labor intensiveness of data curation is a major problem and that it strongly affects the final FAQ output quality. To deal with this problem, we designed a FAQ creation system with a strong focus on the effectiveness of its data-curation component. We conducted a field study by inspecting two sources: incident reports and a QA forum. The first source of incident reports showed a high F-score of 89.9% (precision: 82.5%, recall: 100%). We also applied the same set of parameters to 300 entries of the QA forum and achieved an F-score of 94.3% (precision: 94.9%, recall: 93.8%).
{"title":"Effective data curation for frequently asked questions","authors":"Kohtaroh Miyamoto, Akira Koseki, Masaki Ohno","doi":"10.1109/SOLI.2017.8120960","DOIUrl":"https://doi.org/10.1109/SOLI.2017.8120960","url":null,"abstract":"Frequently-asked-question (FAQ) systems are effective in operating and reducing costs of IT services. Basically, FAQ data preparation requires data curation of available heterogeneous question-and-answer (QA) data sets and creating FAQ clusters. We identified that the labor intensiveness of data curation is a major problem and that it strongly affects the final FAQ output quality. To deal with this problem, we designed a FAQ creation system with a strong focus on the effectiveness of its data-curation component. We conducted a field study by inspecting two sources: incident reports and a QA forum. The first source of incident reports showed a high F-score of 89.9% (precision: 82.5%, recall: 100%). We also applied the same set of parameters to 300 entries of the QA forum and achieved an F-score of 94.3% (precision: 94.9%, recall: 93.8%).","PeriodicalId":190544,"journal":{"name":"2017 IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129156169","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 : 2017-09-01DOI: 10.1109/SOLI.2017.8120963
G. Marchet, M. Melacini, S. Perotti, Monica Rasini, Elena Tappia
The growing importance of the online channel and the increased deployment of new technologies such as smart mobile devices and social networks create new opportunities and challenges for traditional retailers. The retailing industry is moving to a new phase, in which the distinctions between traditional and online channels disappear, namely omni-channel (OC) retailing. The new challenge is to understand how multiple channels can be synergistically managed to provide a seamless customer experience. In OC retailing, logistics represents a key success factor due to its impact on both customer service and total costs. Retailers need to define the distribution configuration for serving the online demand, making decisions on the integration level between online and traditional channels. Companies can set an ad hoc network for the online channel, or use the same network for both online and traditional channels at warehouse and/or transport levels. In this paper, we developed an assessment model of the operational costs for three distribution configurations in OC retailing. The model was also applied to a real Italian case operating in the consumer electronics industry. Results highlighted that the search for synergies between online and traditional flows in both warehouse and transport activities is important for the economic sustainability of OC systems.
{"title":"Logistics in omni-channel retailing: Modelling and analysis of three distribution configurations","authors":"G. Marchet, M. Melacini, S. Perotti, Monica Rasini, Elena Tappia","doi":"10.1109/SOLI.2017.8120963","DOIUrl":"https://doi.org/10.1109/SOLI.2017.8120963","url":null,"abstract":"The growing importance of the online channel and the increased deployment of new technologies such as smart mobile devices and social networks create new opportunities and challenges for traditional retailers. The retailing industry is moving to a new phase, in which the distinctions between traditional and online channels disappear, namely omni-channel (OC) retailing. The new challenge is to understand how multiple channels can be synergistically managed to provide a seamless customer experience. In OC retailing, logistics represents a key success factor due to its impact on both customer service and total costs. Retailers need to define the distribution configuration for serving the online demand, making decisions on the integration level between online and traditional channels. Companies can set an ad hoc network for the online channel, or use the same network for both online and traditional channels at warehouse and/or transport levels. In this paper, we developed an assessment model of the operational costs for three distribution configurations in OC retailing. The model was also applied to a real Italian case operating in the consumer electronics industry. Results highlighted that the search for synergies between online and traditional flows in both warehouse and transport activities is important for the economic sustainability of OC systems.","PeriodicalId":190544,"journal":{"name":"2017 IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114230024","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 : 2017-09-01DOI: 10.1109/SOLI.2017.8120964
R. Mangiaracina, A. Tumino, G. Miragliotta, G. Salvadori
Today cities are responsible for more than 75% of waste production, 80% of emissions, and 75% of energy utilization. With regard to Europe, road transportation produces about 20% of the total CO2 emissions, out of which 40% is generated by urban mobility. It is estimated that vehicles cruising for free parking spaces cause 30% of the daily traffic congestion in an urban downtown area. In this article we attempt to show, through a simulation and an assessment model, how ITS may impact on urban parking management considering both people and freight transportation, and quantified the economic and social benefits which can be obtained. Although some benefits have been already examined by previous authors (e.g. in terms of reduction of time spent in searching a free parking spot), there is still a general lack of quantitative models able to assess the impacts of ITS technologies for urban parking. In this regard, one distinctive contribution of this article is that it combines people and freight transportation modes in a single model. First, we developed a model in order to simulate the urban parking system before and after the adoption of the Smart Parking solution. The output of the simulation model consists in the percentage reduction of the time spent by drivers of cars and vans in searching a free parking spot. Then, this percentage has been used to assess the economic and social benefits of a Smart Parking application in the City of Milan (Italy), in which the “pay and display” parking spots are provided with sensors able to communicate if the space is free or not. The analysis considers two perspectives: on the one hand the parking operator company, which can increase its revenue due to the reduction of people that do not pay for parking. On the other hand, the city-users (i.e. citizens, tourists, off-site students, etc.), who can reduce the time spent for searching a free parking spot, thus reducing fuel consumption and CO2 emissions. The results obtained showed that these technologies would help each driver to save an average of 77.2 hours every year, 86.5 euros in fuel costs, and the entire city of Milan could reduce CO2 emissions by 44,470 tons per year (out of a total of 4,144,000 tons annually produced by road traffic in the area of Milan). In addition, these technologies help the parking operator company in improving the total revenue of around 9 million euros per year. If considering the required costs to implement the Smart Parking solution, the Discounted Payback Period for the parking operator is lower than 2 years.
{"title":"Smart parking management in a smart city: Costs and benefits","authors":"R. Mangiaracina, A. Tumino, G. Miragliotta, G. Salvadori","doi":"10.1109/SOLI.2017.8120964","DOIUrl":"https://doi.org/10.1109/SOLI.2017.8120964","url":null,"abstract":"Today cities are responsible for more than 75% of waste production, 80% of emissions, and 75% of energy utilization. With regard to Europe, road transportation produces about 20% of the total CO2 emissions, out of which 40% is generated by urban mobility. It is estimated that vehicles cruising for free parking spaces cause 30% of the daily traffic congestion in an urban downtown area. In this article we attempt to show, through a simulation and an assessment model, how ITS may impact on urban parking management considering both people and freight transportation, and quantified the economic and social benefits which can be obtained. Although some benefits have been already examined by previous authors (e.g. in terms of reduction of time spent in searching a free parking spot), there is still a general lack of quantitative models able to assess the impacts of ITS technologies for urban parking. In this regard, one distinctive contribution of this article is that it combines people and freight transportation modes in a single model. First, we developed a model in order to simulate the urban parking system before and after the adoption of the Smart Parking solution. The output of the simulation model consists in the percentage reduction of the time spent by drivers of cars and vans in searching a free parking spot. Then, this percentage has been used to assess the economic and social benefits of a Smart Parking application in the City of Milan (Italy), in which the “pay and display” parking spots are provided with sensors able to communicate if the space is free or not. The analysis considers two perspectives: on the one hand the parking operator company, which can increase its revenue due to the reduction of people that do not pay for parking. On the other hand, the city-users (i.e. citizens, tourists, off-site students, etc.), who can reduce the time spent for searching a free parking spot, thus reducing fuel consumption and CO2 emissions. The results obtained showed that these technologies would help each driver to save an average of 77.2 hours every year, 86.5 euros in fuel costs, and the entire city of Milan could reduce CO2 emissions by 44,470 tons per year (out of a total of 4,144,000 tons annually produced by road traffic in the area of Milan). In addition, these technologies help the parking operator company in improving the total revenue of around 9 million euros per year. If considering the required costs to implement the Smart Parking solution, the Discounted Payback Period for the parking operator is lower than 2 years.","PeriodicalId":190544,"journal":{"name":"2017 IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125371194","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 : 2017-09-01DOI: 10.1109/SOLI.2017.8120984
Peter Hillmann, Bastian Kuhnel, Tobias Uhlig, G. Rodosek, O. Rose
Members of international organizations often meet in person at a common location for discussions. There is frequently disagreement over the place and time of the meeting due to the different travel efforts of the members. They usually travel by plane and their travel expenses depend on the flight connections. This paper presents an approach to calculate the optimized location and time, where and when distributed partners should meet. The presented system considers the requirements and specifications of each individual member. It respects earliest starting time of an event and non night flights. The optimized result is evaluated with regard to multiple objectives. We focus on the minimization of costs and travel time. Our search algorithm identifies individual travel data for all members for a potential event. The output provides recommendations for the global best appointments and offers further information for the partners. Our system saves expenses and time for all members and allows adjustment as well as compensation.
{"title":"Optimized travel to meetings on a common location of geographical distributed participants","authors":"Peter Hillmann, Bastian Kuhnel, Tobias Uhlig, G. Rodosek, O. Rose","doi":"10.1109/SOLI.2017.8120984","DOIUrl":"https://doi.org/10.1109/SOLI.2017.8120984","url":null,"abstract":"Members of international organizations often meet in person at a common location for discussions. There is frequently disagreement over the place and time of the meeting due to the different travel efforts of the members. They usually travel by plane and their travel expenses depend on the flight connections. This paper presents an approach to calculate the optimized location and time, where and when distributed partners should meet. The presented system considers the requirements and specifications of each individual member. It respects earliest starting time of an event and non night flights. The optimized result is evaluated with regard to multiple objectives. We focus on the minimization of costs and travel time. Our search algorithm identifies individual travel data for all members for a potential event. The output provides recommendations for the global best appointments and offers further information for the partners. Our system saves expenses and time for all members and allows adjustment as well as compensation.","PeriodicalId":190544,"journal":{"name":"2017 IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128548703","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 : 2017-09-01DOI: 10.1109/SOLI.2017.8120966
Xixi Wang, F. Yalaoui, Frédéric Dugardin
The Resource Constraint Project Scheduling Problem (RCPSP) is one of the most challenged scheduling topics. Compared to the other scheduling problems, the RCPSP pays special attention to the consumable resources with limited capacities, which is the major issue that industry has to cope with. In our study, we tackle a Multi-Objective RCPSP with minimization of the makespan, the total job tardiness and maximization of the workload balance level. Non-dominated Sorting Genetic Algorithm II (NSGAII) and NSGAIII are applied at first to find approximated Pareto fronts. In particular circumstances, decision makers would prefer preselected propositions than the whole Pareto front. For this reason, we have integrated in our study, the Self Controlling Dominance Area of Solutions (SCDAS) in our algorithms find more fine-grained Pareto fronts, and solutions with good qualities on all objectives. Small, medium and large size instances, featured by different parameters of jobs and resources are tested. A comparative study is carried out where the hypervolume and the metric-C are used to evaluate the performances of different methods. The improvements brought by the SCDAS are proved regarding both metrics.
{"title":"Genetic algorithms hybridized with the self controlling dominance to solve a multi-objective resource constraint project scheduling problem","authors":"Xixi Wang, F. Yalaoui, Frédéric Dugardin","doi":"10.1109/SOLI.2017.8120966","DOIUrl":"https://doi.org/10.1109/SOLI.2017.8120966","url":null,"abstract":"The Resource Constraint Project Scheduling Problem (RCPSP) is one of the most challenged scheduling topics. Compared to the other scheduling problems, the RCPSP pays special attention to the consumable resources with limited capacities, which is the major issue that industry has to cope with. In our study, we tackle a Multi-Objective RCPSP with minimization of the makespan, the total job tardiness and maximization of the workload balance level. Non-dominated Sorting Genetic Algorithm II (NSGAII) and NSGAIII are applied at first to find approximated Pareto fronts. In particular circumstances, decision makers would prefer preselected propositions than the whole Pareto front. For this reason, we have integrated in our study, the Self Controlling Dominance Area of Solutions (SCDAS) in our algorithms find more fine-grained Pareto fronts, and solutions with good qualities on all objectives. Small, medium and large size instances, featured by different parameters of jobs and resources are tested. A comparative study is carried out where the hypervolume and the metric-C are used to evaluate the performances of different methods. The improvements brought by the SCDAS are proved regarding both metrics.","PeriodicalId":190544,"journal":{"name":"2017 IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134025291","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 : 2017-09-01DOI: 10.1109/SOLI.2017.8120996
Hector Jalil Desirena Lopez, Mario Siller, Ivan Huerta Casado
Some of the mobility challenges in the cities can be approached with the Internet of Things, Cloud Computing, and Fog Computing. In this work we consider the city as a system of systems and focus on the interaction of those entities with the mobility systems. A key element that allows this interaction is a vehicle on-board unit. In this work we address the interconnection, enabling technologies, interoperability, scalability, geo-distribution and time constrains aspects in the architectural design of mobility systems. For this we propose the On-Board Unit architecture and cover three different levels of technification in information and communication technologies. Based on this differentiation we are able to include Cloud and Fog Computing into our proposed designs.
{"title":"Internet of vehicles: Cloud and fog computing approaches","authors":"Hector Jalil Desirena Lopez, Mario Siller, Ivan Huerta Casado","doi":"10.1109/SOLI.2017.8120996","DOIUrl":"https://doi.org/10.1109/SOLI.2017.8120996","url":null,"abstract":"Some of the mobility challenges in the cities can be approached with the Internet of Things, Cloud Computing, and Fog Computing. In this work we consider the city as a system of systems and focus on the interaction of those entities with the mobility systems. A key element that allows this interaction is a vehicle on-board unit. In this work we address the interconnection, enabling technologies, interoperability, scalability, geo-distribution and time constrains aspects in the architectural design of mobility systems. For this we propose the On-Board Unit architecture and cover three different levels of technification in information and communication technologies. Based on this differentiation we are able to include Cloud and Fog Computing into our proposed designs.","PeriodicalId":190544,"journal":{"name":"2017 IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI)","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121771789","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
扫码关注我们
求助内容：
应助结果提醒方式：