Pub Date : 2017-09-01DOI: 10.1109/SOLI.2017.8120975
Zuzana Borčinová, S. Pesko
The objective of the Capacitated Vehicle Routing Problem is to find routes with minimal cost for a homogeneous fleet of vehicles to serve all the customers, without violating the capacity of the vehicles. Usually, in the basic version of the problem a set of identical vehicles, with a known capacity, is available at the depot and additional objective requiring the minimization of the number of used vehicles. If the number of vehicles to be used is fixed, we may require to minimize the maximum load of vehicles. In this paper we examine the CVRP with fixed number of vehicles with equal capacity and two main goals: the first is to minimize the capacity of the vehicles and the second is to minimize the total travel cost. This variant of the CVRP we call the Lexicographical Capacitated Vehicle Routing Problem.
{"title":"The lexicographical capacitated vehicle routing problem","authors":"Zuzana Borčinová, S. Pesko","doi":"10.1109/SOLI.2017.8120975","DOIUrl":"https://doi.org/10.1109/SOLI.2017.8120975","url":null,"abstract":"The objective of the Capacitated Vehicle Routing Problem is to find routes with minimal cost for a homogeneous fleet of vehicles to serve all the customers, without violating the capacity of the vehicles. Usually, in the basic version of the problem a set of identical vehicles, with a known capacity, is available at the depot and additional objective requiring the minimization of the number of used vehicles. If the number of vehicles to be used is fixed, we may require to minimize the maximum load of vehicles. In this paper we examine the CVRP with fixed number of vehicles with equal capacity and two main goals: the first is to minimize the capacity of the vehicles and the second is to minimize the total travel cost. This variant of the CVRP we call the Lexicographical Capacitated Vehicle Routing Problem.","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":"129556556","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.8120968
M. Janackova, A. Szendreyova
In this article, a hypothesis about the suitable number of the Emergency medical stations (EMS) is pronounced. The hypothesis says, that addition or building another EMS station is meaningful only when the benefit does not fall below the average contribution which is calculated from the various options. To increase the availability of the intervention of the EMS, a larger number of the Emergency medical services stations is necessary. But mainly for the economic perspective, it is not possible arbitrarily to increase their number. The aim of this article is to test some parameter settings that have an impact on the calculation of the suitable number of the Emergency medical services stations in regions of the Slovak Republic.
{"title":"Appropriate number of emergency medical service stations","authors":"M. Janackova, A. Szendreyova","doi":"10.1109/SOLI.2017.8120968","DOIUrl":"https://doi.org/10.1109/SOLI.2017.8120968","url":null,"abstract":"In this article, a hypothesis about the suitable number of the Emergency medical stations (EMS) is pronounced. The hypothesis says, that addition or building another EMS station is meaningful only when the benefit does not fall below the average contribution which is calculated from the various options. To increase the availability of the intervention of the EMS, a larger number of the Emergency medical services stations is necessary. But mainly for the economic perspective, it is not possible arbitrarily to increase their number. The aim of this article is to test some parameter settings that have an impact on the calculation of the suitable number of the Emergency medical services stations in regions of the Slovak Republic.","PeriodicalId":190544,"journal":{"name":"2017 IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI)","volume":"30 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":"131956187","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.8120985
M. Mnif, Sadok Bouamama
Multimodal transport offers an advanced platform for more efficient, reliable, flexible and sustainable freight transport. In order to achieve sustainable planning in a complicated transport system, it is very interesting to use methods include in the fields of operational research. In this article, we propose a mathematical model to solve the multi-objective optimization problem applied in the multimodal transport network. In this paper, we will start with a brief description of the existing literature works that interested in the optimization problem as well as the planning of the multimodal transport network. The goal of this study will be helping to propose an efficient mathematical model. Indeed, the main proposal of the article is a multi-objective programming model with linear and nonlinear constraints. Computational experiments are carried out to test the effectiveness of the proposed model, which has been proved by a comparison with the literature model.
{"title":"A multi-objective formulation for multimodal transportation network's planning problems","authors":"M. Mnif, Sadok Bouamama","doi":"10.1109/SOLI.2017.8120985","DOIUrl":"https://doi.org/10.1109/SOLI.2017.8120985","url":null,"abstract":"Multimodal transport offers an advanced platform for more efficient, reliable, flexible and sustainable freight transport. In order to achieve sustainable planning in a complicated transport system, it is very interesting to use methods include in the fields of operational research. In this article, we propose a mathematical model to solve the multi-objective optimization problem applied in the multimodal transport network. In this paper, we will start with a brief description of the existing literature works that interested in the optimization problem as well as the planning of the multimodal transport network. The goal of this study will be helping to propose an efficient mathematical model. Indeed, the main proposal of the article is a multi-objective programming model with linear and nonlinear constraints. Computational experiments are carried out to test the effectiveness of the proposed model, which has been proved by a comparison with the literature model.","PeriodicalId":190544,"journal":{"name":"2017 IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI)","volume":"8 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":"132373592","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.8120988
M. P. Fanti, G. Pedroncelli, M. Roccotelli, S. Mininel, G. Stecco, W. Ukovich
The standardization of services in the European electromobility network is becoming one of the main goal of researchers and practitioners. In this context, the objective of the paper is proposing a general view of the main needs and functions of the involved actors and stakeholders, and to state their interactions within the electromobility network. In particular, actors and stakeholders are grouped in so called macro-areas, and the interoperability and cooperation at both macro-areas and actors levels are provided by means of Unified Modeling Language (UML) diagrams.
{"title":"Actors interactions and needs in the European electromobility network","authors":"M. P. Fanti, G. Pedroncelli, M. Roccotelli, S. Mininel, G. Stecco, W. Ukovich","doi":"10.1109/SOLI.2017.8120988","DOIUrl":"https://doi.org/10.1109/SOLI.2017.8120988","url":null,"abstract":"The standardization of services in the European electromobility network is becoming one of the main goal of researchers and practitioners. In this context, the objective of the paper is proposing a general view of the main needs and functions of the involved actors and stakeholders, and to state their interactions within the electromobility network. In particular, actors and stakeholders are grouped in so called macro-areas, and the interoperability and cooperation at both macro-areas and actors levels are provided by means of Unified Modeling Language (UML) diagrams.","PeriodicalId":190544,"journal":{"name":"2017 IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI)","volume":"116 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":"124604887","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.8120967
Kugamoorthy Gajananan, Aly Megahed, Shubhi Asthana, V. Becker, Taiga Nakamura, Mark A. Smith
Highly valued Information technology (IT) service contracts involve the delivery of complex IT services, such as migrating the client's IT infrastructure to the Cloud, Mainframes, among others. IT service providers usually compete to win these IT service contracts. In order to bid on such deals, IT service providers need to price/quote the solution that they propose to the client, trying to convince him to use their services. A few analytical methods in the literature have been provided for pricing these deals. However, these methods ignore an important characteristic of these services; that is they are typically characterized by a decreasing cost profile in subsequent years to the first year. Typically, these methods require solutioners to manually input these annual cost reductions. In this paper, we present an analytical way for calculating this cost reduction, if applicable, via mining historical data. We show that using our methodology could achieve significant increase in the accuracy of estimating the costs and prices of IT service deals.
{"title":"A method for estimating annual cost reduction of IT service deals","authors":"Kugamoorthy Gajananan, Aly Megahed, Shubhi Asthana, V. Becker, Taiga Nakamura, Mark A. Smith","doi":"10.1109/SOLI.2017.8120967","DOIUrl":"https://doi.org/10.1109/SOLI.2017.8120967","url":null,"abstract":"Highly valued Information technology (IT) service contracts involve the delivery of complex IT services, such as migrating the client's IT infrastructure to the Cloud, Mainframes, among others. IT service providers usually compete to win these IT service contracts. In order to bid on such deals, IT service providers need to price/quote the solution that they propose to the client, trying to convince him to use their services. A few analytical methods in the literature have been provided for pricing these deals. However, these methods ignore an important characteristic of these services; that is they are typically characterized by a decreasing cost profile in subsequent years to the first year. Typically, these methods require solutioners to manually input these annual cost reductions. In this paper, we present an analytical way for calculating this cost reduction, if applicable, via mining historical data. We show that using our methodology could achieve significant increase in the accuracy of estimating the costs and prices of IT service deals.","PeriodicalId":190544,"journal":{"name":"2017 IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI)","volume":"25 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":"125382968","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.8120976
M. dell’Amico, Stefano Novellani
In this paper we present a two-echelon facility location problem with stochastic demands for the introduction of consolidation centers in the construction supply chain in urban areas. We describe the state of the art and propose a 2-stage model solved with L-shaped algorithms where several novel features are treated all together. The study is part of simulations performed during the European project SUCCESS (Sustainable Urban Consolidation CentrES for construction).
{"title":"A two-echelon facility location problem with stochastic demands for urban construction logistics: An application within the SUCCESS project","authors":"M. dell’Amico, Stefano Novellani","doi":"10.1109/SOLI.2017.8120976","DOIUrl":"https://doi.org/10.1109/SOLI.2017.8120976","url":null,"abstract":"In this paper we present a two-echelon facility location problem with stochastic demands for the introduction of consolidation centers in the construction supply chain in urban areas. We describe the state of the art and propose a 2-stage model solved with L-shaped algorithms where several novel features are treated all together. The study is part of simulations performed during the European project SUCCESS (Sustainable Urban Consolidation CentrES for construction).","PeriodicalId":190544,"journal":{"name":"2017 IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI)","volume":"15 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":"122228374","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.8121001
Angelo Parchitelli, Francesco Nocera, G. Iacobellis, M. Mongiello, T. D. Noia, E. Sciascio
Modern cities produce larger amounts of waste causing profound negative impacts on our natural environment. For this reason, processes related to waste collection, transportation, transformation and final disposal have increased their importance and major adequacy is desirable. Several Waste Management (WM) problems have to be solved in order to obtain efficient related services. Traditional Vehicle Routing Problem and Waste Collection Problem solution approaches presented in the literature are not suitable to face problems related to specific topology of the city, districts, street dimension and shape of the clusters. In this paper we propose a pre-process cluster solution in order to take into account different information such as street names, street dimension and civic number in order to create cluster more acceptable by the final users. In order to show the effectiveness of the proposed methodology, we compare hierarchical and spectral clustering-based algorithms. Finally, we apply our proposal in a real case study based on a data set extracted from a city in the north-east of Italy.
{"title":"A pre-process clustering methods for the waste collection problem","authors":"Angelo Parchitelli, Francesco Nocera, G. Iacobellis, M. Mongiello, T. D. Noia, E. Sciascio","doi":"10.1109/SOLI.2017.8121001","DOIUrl":"https://doi.org/10.1109/SOLI.2017.8121001","url":null,"abstract":"Modern cities produce larger amounts of waste causing profound negative impacts on our natural environment. For this reason, processes related to waste collection, transportation, transformation and final disposal have increased their importance and major adequacy is desirable. Several Waste Management (WM) problems have to be solved in order to obtain efficient related services. Traditional Vehicle Routing Problem and Waste Collection Problem solution approaches presented in the literature are not suitable to face problems related to specific topology of the city, districts, street dimension and shape of the clusters. In this paper we propose a pre-process cluster solution in order to take into account different information such as street names, street dimension and civic number in order to create cluster more acceptable by the final users. In order to show the effectiveness of the proposed methodology, we compare hierarchical and spectral clustering-based algorithms. Finally, we apply our proposal in a real case study based on a data set extracted from a city in the north-east of Italy.","PeriodicalId":190544,"journal":{"name":"2017 IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI)","volume":"15 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":"114100141","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.8120971
Raffaele Carli, M. Dotoli
This paper proposes a novel decentralized control strategy for the optimal charging of a large-scale fleet of Electric Vehicles (EVs). The scheduling problem aims at ensuring a cost-optimal profile of the aggregated energy demand and at satisfying the resource constraints depending both on power grid components capacity and EV locations in the distribution network. The resulting optimization problem is formulated as a quadratic programming problem with a coupling of decision variables both in the objective function and in the inequality constraints. The solution approach relies on a decentralized optimization algorithm that is based on a variant of ADMM (Alternating Direction Method of Multipliers), adapted to take into account the inequality constraints and the non-separated objective function. A simulated case study demonstrates that the approach allows achieving both the overall fleet and individual EV goals, while complying with the power grid congestion limits.
{"title":"A decentralized control strategy for optimal charging of electric vehicle fleets with congestion management","authors":"Raffaele Carli, M. Dotoli","doi":"10.1109/SOLI.2017.8120971","DOIUrl":"https://doi.org/10.1109/SOLI.2017.8120971","url":null,"abstract":"This paper proposes a novel decentralized control strategy for the optimal charging of a large-scale fleet of Electric Vehicles (EVs). The scheduling problem aims at ensuring a cost-optimal profile of the aggregated energy demand and at satisfying the resource constraints depending both on power grid components capacity and EV locations in the distribution network. The resulting optimization problem is formulated as a quadratic programming problem with a coupling of decision variables both in the objective function and in the inequality constraints. The solution approach relies on a decentralized optimization algorithm that is based on a variant of ADMM (Alternating Direction Method of Multipliers), adapted to take into account the inequality constraints and the non-separated objective function. A simulated case study demonstrates that the approach allows achieving both the overall fleet and individual EV goals, while complying with the power grid congestion limits.","PeriodicalId":190544,"journal":{"name":"2017 IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI)","volume":"4 33","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120926176","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.8120997
F. Vasconcelos, L. Figueiredo, A. Almeida, J. Ferreira
This paper proposes a system to monitor, through the internet, the data of a logistics distribution truck. For this, it was implemented a reliable and flexible wireless sensor network with low energy consumption. The technology used for the radio system was Bluetooth Low Energy (BLE). Each node in the network contains one type of sensor. The sensors information together with GPS and On-Board Diagnostics (OBD) data collected by the central unit, and later transmitted to the cloud by GSM or Wi-Fi.
{"title":"SMART sensor network: With Bluetooth low energy and CAN-BUS","authors":"F. Vasconcelos, L. Figueiredo, A. Almeida, J. Ferreira","doi":"10.1109/SOLI.2017.8120997","DOIUrl":"https://doi.org/10.1109/SOLI.2017.8120997","url":null,"abstract":"This paper proposes a system to monitor, through the internet, the data of a logistics distribution truck. For this, it was implemented a reliable and flexible wireless sensor network with low energy consumption. The technology used for the radio system was Bluetooth Low Energy (BLE). Each node in the network contains one type of sensor. The sensors information together with GPS and On-Board Diagnostics (OBD) data collected by the central unit, and later transmitted to the cloud by GSM or Wi-Fi.","PeriodicalId":190544,"journal":{"name":"2017 IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI)","volume":"38 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":"125745852","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.8120972
G. Daugherty, S. Reveliotis, G. Mohler
This paper overviews a research program of ours that concerns the routing of a number of traveling agents over a transportation medium that is abstracted as a “zone”-controlled guidepath network. From an application standpoint, this class of problems arise in the real-time management of the traffic that takes place in many contemporary material handling systems. But quite interestingly, the same problems also arise in the routing of the ionized atoms that are the elementary information carriers in the context of quantum computing. The paper provides a conceptual description and some motivational applications for the aforementioned problems, places these problems in the context of the existing literature, and outlines the methodological base and the key results that have been developed in the presented research; detailed expositions of these technical developments can be found in the provided references.
{"title":"Optimized multi-agent routing in shared guidepath networks","authors":"G. Daugherty, S. Reveliotis, G. Mohler","doi":"10.1109/SOLI.2017.8120972","DOIUrl":"https://doi.org/10.1109/SOLI.2017.8120972","url":null,"abstract":"This paper overviews a research program of ours that concerns the routing of a number of traveling agents over a transportation medium that is abstracted as a “zone”-controlled guidepath network. From an application standpoint, this class of problems arise in the real-time management of the traffic that takes place in many contemporary material handling systems. But quite interestingly, the same problems also arise in the routing of the ionized atoms that are the elementary information carriers in the context of quantum computing. The paper provides a conceptual description and some motivational applications for the aforementioned problems, places these problems in the context of the existing literature, and outlines the methodological base and the key results that have been developed in the presented research; detailed expositions of these technical developments can be found in the provided references.","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":"129442975","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
扫码关注我们
求助内容：
应助结果提醒方式：