Pub Date : 2013-05-29DOI: 10.1109/ICADLT.2013.6568513
Haiqing Zhang, Y. Ouzrout, A. Bouras, Vincenzo Della Selva, M. Savino
Adopting right PLM components and making proper strategy investment decisions enlarge business benefits. Evaluation and selection of PLM components require analyzing the PLM functionalities. These functionalities could be extracted from the company PLM maturity and PLM benefits, based on its capabilities in terms of specific features such as technology, information, management, organization, sustainability, etc. In this paper we propose a framework called TIFOS (TechnoWare, InforWare, FunctionWare, OrgaWare, SustainWare) to collect these main PLM components. The paper also provides a development approach based on the Analytical Hierarchy Process (AHP) method to better handle these components. AHP is a multi-criteria, multi-objectives decision-making method that employs pair-wise comparison matrix among the criteria to obtain optimal alternatives.
{"title":"Selection of product lifecycle management components based on AHP methodologies","authors":"Haiqing Zhang, Y. Ouzrout, A. Bouras, Vincenzo Della Selva, M. Savino","doi":"10.1109/ICADLT.2013.6568513","DOIUrl":"https://doi.org/10.1109/ICADLT.2013.6568513","url":null,"abstract":"Adopting right PLM components and making proper strategy investment decisions enlarge business benefits. Evaluation and selection of PLM components require analyzing the PLM functionalities. These functionalities could be extracted from the company PLM maturity and PLM benefits, based on its capabilities in terms of specific features such as technology, information, management, organization, sustainability, etc. In this paper we propose a framework called TIFOS (TechnoWare, InforWare, FunctionWare, OrgaWare, SustainWare) to collect these main PLM components. The paper also provides a development approach based on the Analytical Hierarchy Process (AHP) method to better handle these components. AHP is a multi-criteria, multi-objectives decision-making method that employs pair-wise comparison matrix among the criteria to obtain optimal alternatives.","PeriodicalId":269509,"journal":{"name":"2013 International Conference on Advanced Logistics and Transport","volume":"11 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":"121755443","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-29DOI: 10.1109/ICADLT.2013.6568456
P. Avella, M. Boccia, S. Mattia
Several Mixed Integer Linear Programming problems present a formulation based on a great number of knapsack constraints. Problems widely addressed in literature with this structure are, among others, Generalized Assignment, Multiple Knapsack, Bin Packing, Capacitated P-median and Single Source Capacitated Facility Location. In general knapsack constraints make these problems very hard to solve. The state of the art on these problems requires to use approaches besed on Lagrangean Relaxation or decomposition approaches like Dantzig-Wolfe and Column Generation tenchniques. In this paper, we present an approach based on the generation of general cutting planes of the polyhedron associated with each knapsack constraints. This approach yields a lower bound for the LP-relaxation that is the same obtained by the Dantzig-Wolfe decomposition and henceforth stronger than the LP-relaxation. We use this approach in the solution of the Single Source Capacitated Facility Location problem (SSCFLP) using a Branch-and-Cut algorithm. Computational experience is reported on a large set of test instances available in literature.
{"title":"A Branch-and-Cut algorithm for the Single Source Capacitated Facility Location problem","authors":"P. Avella, M. Boccia, S. Mattia","doi":"10.1109/ICADLT.2013.6568456","DOIUrl":"https://doi.org/10.1109/ICADLT.2013.6568456","url":null,"abstract":"Several Mixed Integer Linear Programming problems present a formulation based on a great number of knapsack constraints. Problems widely addressed in literature with this structure are, among others, Generalized Assignment, Multiple Knapsack, Bin Packing, Capacitated P-median and Single Source Capacitated Facility Location. In general knapsack constraints make these problems very hard to solve. The state of the art on these problems requires to use approaches besed on Lagrangean Relaxation or decomposition approaches like Dantzig-Wolfe and Column Generation tenchniques. In this paper, we present an approach based on the generation of general cutting planes of the polyhedron associated with each knapsack constraints. This approach yields a lower bound for the LP-relaxation that is the same obtained by the Dantzig-Wolfe decomposition and henceforth stronger than the LP-relaxation. We use this approach in the solution of the Single Source Capacitated Facility Location problem (SSCFLP) using a Branch-and-Cut algorithm. Computational experience is reported on a large set of test instances available in literature.","PeriodicalId":269509,"journal":{"name":"2013 International Conference on Advanced Logistics and Transport","volume":"235 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":"116954029","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-29DOI: 10.1109/ICADLT.2013.6568436
A. Derbel, A. Frikha
During the last decades, many accidents occurred when reversing vehicles, our objective is to find a system that reduces the damages in case of backtrack (reducing accidents child injuries, avoiding hitting poles or walls, improving the appreciation of distance). Also this application aims at increasing the vigilance of the driver on the presence an object mostly nearby. The interest of this application is to combine several sources, since the sensor give us different kind of information, so with merging these data with the belief function theory we should decide which objects represent a danger for the vehicle in reverse.
{"title":"Data fusion applied in a back warning system","authors":"A. Derbel, A. Frikha","doi":"10.1109/ICADLT.2013.6568436","DOIUrl":"https://doi.org/10.1109/ICADLT.2013.6568436","url":null,"abstract":"During the last decades, many accidents occurred when reversing vehicles, our objective is to find a system that reduces the damages in case of backtrack (reducing accidents child injuries, avoiding hitting poles or walls, improving the appreciation of distance). Also this application aims at increasing the vigilance of the driver on the presence an object mostly nearby. The interest of this application is to combine several sources, since the sensor give us different kind of information, so with merging these data with the belief function theory we should decide which objects represent a danger for the vehicle in reverse.","PeriodicalId":269509,"journal":{"name":"2013 International Conference on Advanced Logistics and Transport","volume":"32 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":"123985992","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-29DOI: 10.1109/ICADLT.2013.6568449
Fethi Matoui, A. Zouinkhi, M. Abdelkrim
The monotoring of the warehouse for the chemical product is a delicate operation, since it passes by a well knowing of nature for each storing products, behind their localization, their possible interaction and behind the action that must be taking in consideration in case of alert. In order to facilitate this management stockage, this paper proposed to use the ambient concept, where the product posses his proper information system and a wireless communication, in a manner to be intelligent and autonomous. This article proposed and developed a model of internal behavior for the active product that facilitates a distributed approach for the active security by the wireless sensors network. This may able to lead a communication protocol for wireless sensors network application level. This protocol is implemented in Castalia/Omnet ++ simulator. We used the experimental design method to obtain the optimal parameters. The results mention the interest and the feasibility of active product concept by the use of wireless sensors network.
{"title":"Concept of active communicative product by wireless sensors network","authors":"Fethi Matoui, A. Zouinkhi, M. Abdelkrim","doi":"10.1109/ICADLT.2013.6568449","DOIUrl":"https://doi.org/10.1109/ICADLT.2013.6568449","url":null,"abstract":"The monotoring of the warehouse for the chemical product is a delicate operation, since it passes by a well knowing of nature for each storing products, behind their localization, their possible interaction and behind the action that must be taking in consideration in case of alert. In order to facilitate this management stockage, this paper proposed to use the ambient concept, where the product posses his proper information system and a wireless communication, in a manner to be intelligent and autonomous. This article proposed and developed a model of internal behavior for the active product that facilitates a distributed approach for the active security by the wireless sensors network. This may able to lead a communication protocol for wireless sensors network application level. This protocol is implemented in Castalia/Omnet ++ simulator. We used the experimental design method to obtain the optimal parameters. The results mention the interest and the feasibility of active product concept by the use of wireless sensors network.","PeriodicalId":269509,"journal":{"name":"2013 International Conference on Advanced Logistics and Transport","volume":"64 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":"130624189","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-29DOI: 10.1109/ICADLT.2013.6568489
Kallel Lobna, Benaissa Mounir, Kamoun Hichem
Continuously improving performance is a needed strategic service in any production context. It can be used to improve supply chain effectiveness, efficiency, reactiveness and flexibility. Moreover, some companies have used different performance, management tools to support their supply chain strategies.Therefore evaluation, monitoring and improvement of performance of a supply chain have become an increasingly important task. In this paper we present an ECOGRAI method of performance evaluation applied in a maintenance process at the end we implement a system performance indicators.
{"title":"Using the ECOGRAI method for performance evaluation in maintenance process","authors":"Kallel Lobna, Benaissa Mounir, Kamoun Hichem","doi":"10.1109/ICADLT.2013.6568489","DOIUrl":"https://doi.org/10.1109/ICADLT.2013.6568489","url":null,"abstract":"Continuously improving performance is a needed strategic service in any production context. It can be used to improve supply chain effectiveness, efficiency, reactiveness and flexibility. Moreover, some companies have used different performance, management tools to support their supply chain strategies.Therefore evaluation, monitoring and improvement of performance of a supply chain have become an increasingly important task. In this paper we present an ECOGRAI method of performance evaluation applied in a maintenance process at the end we implement a system performance indicators.","PeriodicalId":269509,"journal":{"name":"2013 International Conference on Advanced Logistics and Transport","volume":"105 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":"132954372","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-29DOI: 10.1109/ICADLT.2013.6568428
Florent Perronnet, A. Abbas-Turki, A. El-Moudni, J. Buisson, Renan Zeo
Traffic lights are used worldwide for over 100 years. This solution has proved its efficiency especially in urban areas. Nevertheless the complexity of resource sharing problem grows with the increasing number of personal vehicles and the rise of emerging mobility systems. Traffic lights suffer from a lack of flexibility and are not anymore adapted to modern cities. Fortunately the evolution of technology offers efficient positioning and communication systems which permit to imagine a new way to control traffic, the Cooperative Intersection Management (CIM). We have defined a precise protocol named Cooperative Vehicle-Actuator System (CVAS). Real tests have proved the feasibility of the protocol. In this paper we present a sequence-based algorithm based on dynamic programming which aims to find the optimal solution for an isolated intersection. The goal is to have a tool for evaluating real-time policies in simulations. We use a 3D simulator in order to check the efficiency of the algorithm by a comparison with classical traffic lights.
{"title":"Cooperative Vehicle-Actuator System: A sequence-based optimal solution algorithm as tool for evaluating policies","authors":"Florent Perronnet, A. Abbas-Turki, A. El-Moudni, J. Buisson, Renan Zeo","doi":"10.1109/ICADLT.2013.6568428","DOIUrl":"https://doi.org/10.1109/ICADLT.2013.6568428","url":null,"abstract":"Traffic lights are used worldwide for over 100 years. This solution has proved its efficiency especially in urban areas. Nevertheless the complexity of resource sharing problem grows with the increasing number of personal vehicles and the rise of emerging mobility systems. Traffic lights suffer from a lack of flexibility and are not anymore adapted to modern cities. Fortunately the evolution of technology offers efficient positioning and communication systems which permit to imagine a new way to control traffic, the Cooperative Intersection Management (CIM). We have defined a precise protocol named Cooperative Vehicle-Actuator System (CVAS). Real tests have proved the feasibility of the protocol. In this paper we present a sequence-based algorithm based on dynamic programming which aims to find the optimal solution for an isolated intersection. The goal is to have a tool for evaluating real-time policies in simulations. We use a 3D simulator in order to check the efficiency of the algorithm by a comparison with classical traffic lights.","PeriodicalId":269509,"journal":{"name":"2013 International Conference on Advanced Logistics and Transport","volume":"22 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":"132112965","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-29DOI: 10.1109/ICADLT.2013.6568443
Anicia Jaegler, N. Gondran
Rendering the supply chain more carbon-friendly is an innovative idea progressively adopted by industry. Transport accounts for one-fifth of the carbon emissions that are generated on French territory. Among the different transport modes, road transport is the one responsible for the majority of transport emissions. Our research focuses on the CO2 emissions along the supply chain due to road freight transport. Accordingly, we conduct a greenhouse gas (GHG) emissions assessment of a transport company. The main objectives of the study are twofold: identifying the main emission sources and improving green supply chains.
{"title":"How to reduce the carbon footprint of road freight on supply chains?","authors":"Anicia Jaegler, N. Gondran","doi":"10.1109/ICADLT.2013.6568443","DOIUrl":"https://doi.org/10.1109/ICADLT.2013.6568443","url":null,"abstract":"Rendering the supply chain more carbon-friendly is an innovative idea progressively adopted by industry. Transport accounts for one-fifth of the carbon emissions that are generated on French territory. Among the different transport modes, road transport is the one responsible for the majority of transport emissions. Our research focuses on the CO2 emissions along the supply chain due to road freight transport. Accordingly, we conduct a greenhouse gas (GHG) emissions assessment of a transport company. The main objectives of the study are twofold: identifying the main emission sources and improving green supply chains.","PeriodicalId":269509,"journal":{"name":"2013 International Conference on Advanced Logistics and Transport","volume":"71 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":"132243451","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-29DOI: 10.1109/ICADLT.2013.6568466
M. Di Francesco, M. Lai, P. Zuddas
This paper investigates the maritime repositioning of empty containers under uncertain demand. In order to consider data uncertainty, the problem is addressed by a stochastic programming approach, in which different scenarios are included in a multi-scenario optimization model and linked by non-anticipativity conditions. Numerical experiments show the benefits of multi-scenario solutions with respect to deterministic approaches, which consider only a single point forecast for each uncertain parameter.
{"title":"A multi-scenario model for empty container repositioning under uncertain demand","authors":"M. Di Francesco, M. Lai, P. Zuddas","doi":"10.1109/ICADLT.2013.6568466","DOIUrl":"https://doi.org/10.1109/ICADLT.2013.6568466","url":null,"abstract":"This paper investigates the maritime repositioning of empty containers under uncertain demand. In order to consider data uncertainty, the problem is addressed by a stochastic programming approach, in which different scenarios are included in a multi-scenario optimization model and linked by non-anticipativity conditions. Numerical experiments show the benefits of multi-scenario solutions with respect to deterministic approaches, which consider only a single point forecast for each uncertain parameter.","PeriodicalId":269509,"journal":{"name":"2013 International Conference on Advanced Logistics and Transport","volume":"18 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":"114465368","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-29DOI: 10.1109/ICADLT.2013.6568448
Kais Mekki, A. Zouinkhi, M. Abdelkrim
One of the most important issues in Wireless Sensor Networks (WSN) is collecting and processing data perceived from the environment and sending that data to be processed and evaluated. So routing data towards the destination node is a fundamental task in WSN. However, the sensor nodes have a limited transmission range, and their processing and storage capabilities as well as their energy resources are also limited. Therefore, different routing protocols have been developed for WSN. In this paper, we evaluate the performance of FELGossiping routing protocol for active security system of dangerous chemical products warehouse. We compare its performance with AODV, SPEED and EQSR protocols in terms of packet delivery ratio, end to end delay and energy consumption. Simulation results using Castalia/OMNeT++ show that FELGossiping has good packet delivery ratio and energy consumption performances, and medium average end to end delay.
{"title":"Simulation Study of FELGossiping protocol performance for active security system","authors":"Kais Mekki, A. Zouinkhi, M. Abdelkrim","doi":"10.1109/ICADLT.2013.6568448","DOIUrl":"https://doi.org/10.1109/ICADLT.2013.6568448","url":null,"abstract":"One of the most important issues in Wireless Sensor Networks (WSN) is collecting and processing data perceived from the environment and sending that data to be processed and evaluated. So routing data towards the destination node is a fundamental task in WSN. However, the sensor nodes have a limited transmission range, and their processing and storage capabilities as well as their energy resources are also limited. Therefore, different routing protocols have been developed for WSN. In this paper, we evaluate the performance of FELGossiping routing protocol for active security system of dangerous chemical products warehouse. We compare its performance with AODV, SPEED and EQSR protocols in terms of packet delivery ratio, end to end delay and energy consumption. Simulation results using Castalia/OMNeT++ show that FELGossiping has good packet delivery ratio and energy consumption performances, and medium average end to end delay.","PeriodicalId":269509,"journal":{"name":"2013 International Conference on Advanced Logistics and Transport","volume":"18 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":"124813313","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-29DOI: 10.1109/ICADLT.2013.6568493
Jean-Yves Colin, A. S. O. Cheikh, Moustafa Nakechbandi
In this paper, we study weakly dynamic undirected graphs, and we propose an efficient polynomial algorithm that computes in advance alternative shortest paths for all possible configurations. No additional computation is then needed after any change in the problem because shortest paths are already known in all cases. We use these results to compute critical values for the traversal duration and to pre-compute best paths, and we apply this result to one delivery problem for trucks from one regional storehouse to several local stores when one possible point has a variable traversal duration.
{"title":"Route planning in a weakly dynamic undirected graph","authors":"Jean-Yves Colin, A. S. O. Cheikh, Moustafa Nakechbandi","doi":"10.1109/ICADLT.2013.6568493","DOIUrl":"https://doi.org/10.1109/ICADLT.2013.6568493","url":null,"abstract":"In this paper, we study weakly dynamic undirected graphs, and we propose an efficient polynomial algorithm that computes in advance alternative shortest paths for all possible configurations. No additional computation is then needed after any change in the problem because shortest paths are already known in all cases. We use these results to compute critical values for the traversal duration and to pre-compute best paths, and we apply this result to one delivery problem for trucks from one regional storehouse to several local stores when one possible point has a variable traversal duration.","PeriodicalId":269509,"journal":{"name":"2013 International Conference on Advanced Logistics and Transport","volume":"341 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113958493","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
扫码关注我们
求助内容：
应助结果提醒方式：