Pub Date : 2011-07-05DOI: 10.1109/LOGISTIQUA.2011.5939302
Vesela Dryankova, H. Abouaissa, D. Jolly, H. Haj-Salem
Freeway traffic control is achieved using High Order Sliding Mode Control (HOSMC) and the concept of differentially flat systems. The main objective of this paper, which follows the work in [22] is to evaluate the impact of the traffic ramp metering on the freeway network using real field data of the French motorway A6.
{"title":"Traffic network ramp metering based on High Order Sliding Mode and flatness approaches: A case study","authors":"Vesela Dryankova, H. Abouaissa, D. Jolly, H. Haj-Salem","doi":"10.1109/LOGISTIQUA.2011.5939302","DOIUrl":"https://doi.org/10.1109/LOGISTIQUA.2011.5939302","url":null,"abstract":"Freeway traffic control is achieved using High Order Sliding Mode Control (HOSMC) and the concept of differentially flat systems. The main objective of this paper, which follows the work in [22] is to evaluate the impact of the traffic ramp metering on the freeway network using real field data of the French motorway A6.","PeriodicalId":324478,"journal":{"name":"2011 4th International Conference on Logistics","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126550158","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 : 2011-07-05DOI: 10.1109/LOGISTIQUA.2011.5939408
Younes Mounir, Ouafae Zerouli Ouariti
The works in literature related to collaboration in the supply chain were interested on the explanation of the relationship framework without focusing on modes, processes and tools. As a result, the question that arises is: How to define the type of information to share as well as service elements associated to establish a collaborative process?
{"title":"Logistics collaboration in the pharmaceutical sector in Morocco: What information to share? Study of the relation Laboratory - Distributor","authors":"Younes Mounir, Ouafae Zerouli Ouariti","doi":"10.1109/LOGISTIQUA.2011.5939408","DOIUrl":"https://doi.org/10.1109/LOGISTIQUA.2011.5939408","url":null,"abstract":"The works in literature related to collaboration in the supply chain were interested on the explanation of the relationship framework without focusing on modes, processes and tools. As a result, the question that arises is: How to define the type of information to share as well as service elements associated to establish a collaborative process?","PeriodicalId":324478,"journal":{"name":"2011 4th International Conference on Logistics","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122761180","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 : 2011-07-05DOI: 10.1109/LOGISTIQUA.2011.5939454
R. Bouabda, B. Jarboui, A. Rebai
This paper addresses the permutation flowline manufacturing cell with sequence dependent family setup times problem with the objective to minimize the makespan criterion. We propose a new way of hybridizing iterated local search. It consists in using Branch and Bound algorithm as the embedded local search algorithm inside an iterated local search algorithm. Moreover, the application of the branch and bound algorithm is based upon the decomposition of the problem into subproblems. The performance of the proposed method is tested by numerical experiments on a large number of representative problems.
{"title":"A nested iterated local search algorithm for scheduling a flowline manufacturing cell with sequence dependent family setup times","authors":"R. Bouabda, B. Jarboui, A. Rebai","doi":"10.1109/LOGISTIQUA.2011.5939454","DOIUrl":"https://doi.org/10.1109/LOGISTIQUA.2011.5939454","url":null,"abstract":"This paper addresses the permutation flowline manufacturing cell with sequence dependent family setup times problem with the objective to minimize the makespan criterion. We propose a new way of hybridizing iterated local search. It consists in using Branch and Bound algorithm as the embedded local search algorithm inside an iterated local search algorithm. Moreover, the application of the branch and bound algorithm is based upon the decomposition of the problem into subproblems. The performance of the proposed method is tested by numerical experiments on a large number of representative problems.","PeriodicalId":324478,"journal":{"name":"2011 4th International Conference on Logistics","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121466809","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 : 2011-07-05DOI: 10.1109/LOGISTIQUA.2011.5939419
I. Zidi, K. Mesghouni, K. Zidi, K. Ghédira
The paper describes a multi-objective mathematical model for the Dial a Ride Problem (DRP) and an application of the Multi-Objective Simulated Annealing (MOSA) to solve the dynamic DRP. Indeed, different versions of the dynamic Dial a Ride Problem are found in every day practice; transportation of people in low-density areas, transportation of the handicapped and elderly persons and parcel pick-up and delivery service in urban areas. The problem is to affect every new passenger request to one of the vehicles and to design a new route and schedule for this vehicle. This affectation must be done in real time. In this work, we offer our contribution to the study and solving the dynamic DRP in the application using the MOSA algorithm. Numerical results show the benefits of this algorithm in a real-time context.
{"title":"A new approach based on the Multi-Objective Simulated Annealing to solving the dynamic Dial a Ride Problem","authors":"I. Zidi, K. Mesghouni, K. Zidi, K. Ghédira","doi":"10.1109/LOGISTIQUA.2011.5939419","DOIUrl":"https://doi.org/10.1109/LOGISTIQUA.2011.5939419","url":null,"abstract":"The paper describes a multi-objective mathematical model for the Dial a Ride Problem (DRP) and an application of the Multi-Objective Simulated Annealing (MOSA) to solve the dynamic DRP. Indeed, different versions of the dynamic Dial a Ride Problem are found in every day practice; transportation of people in low-density areas, transportation of the handicapped and elderly persons and parcel pick-up and delivery service in urban areas. The problem is to affect every new passenger request to one of the vehicles and to design a new route and schedule for this vehicle. This affectation must be done in real time. In this work, we offer our contribution to the study and solving the dynamic DRP in the application using the MOSA algorithm. Numerical results show the benefits of this algorithm in a real-time context.","PeriodicalId":324478,"journal":{"name":"2011 4th International Conference on Logistics","volume":"27 28","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132274571","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 : 2011-07-05DOI: 10.1109/LOGISTIQUA.2011.5939402
Serigne Gueye, S. Michel, A. Yassine
The Berth Allocation Problem (BAP) is the problem of allocating berthing spaces and scheduling container vessels on these spaces so as to minimize total weighted time. We study a version of BAP in which containers are moved between vessels and berth space is abundant. Thus, the problem reduces to optimally assign vessels to berths.We call it the Berth Assignment Problem (BASP). (BASP) is an NP-Complete problem. We formulate it as a non standard Quadratic Assignment Problem, from which a 0–1 linear formulation is derived. Some valid inequalities of the resulting integer programming model are found. Numerical results are shown.
{"title":"A 0–1 linear programming formulation for the Berth Assignment Problem","authors":"Serigne Gueye, S. Michel, A. Yassine","doi":"10.1109/LOGISTIQUA.2011.5939402","DOIUrl":"https://doi.org/10.1109/LOGISTIQUA.2011.5939402","url":null,"abstract":"The Berth Allocation Problem (BAP) is the problem of allocating berthing spaces and scheduling container vessels on these spaces so as to minimize total weighted time. We study a version of BAP in which containers are moved between vessels and berth space is abundant. Thus, the problem reduces to optimally assign vessels to berths.We call it the Berth Assignment Problem (BASP). (BASP) is an NP-Complete problem. We formulate it as a non standard Quadratic Assignment Problem, from which a 0–1 linear formulation is derived. Some valid inequalities of the resulting integer programming model are found. Numerical results are shown.","PeriodicalId":324478,"journal":{"name":"2011 4th International Conference on Logistics","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114612156","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 : 2011-07-05DOI: 10.1109/LOGISTIQUA.2011.5939452
H. Derbel, B. Jarboui, H. Chabchoub, S. Hanafi, N. Mladenović
In this work, we present a variable neighborhood search for solving a capacitated location routing problem with capacitated depots and a capacitated homogenous vehicle fleet in order to minimize the location and routing cost. We present the basic elements for this purpose and implement the variable neighborhood search algorithm using the variable neighborhood descent as the local search. We tested our heuristic approach on a large number of instances and the results were compared with the literature.
{"title":"A variable neighborhood search for the capacitated location-routing problem","authors":"H. Derbel, B. Jarboui, H. Chabchoub, S. Hanafi, N. Mladenović","doi":"10.1109/LOGISTIQUA.2011.5939452","DOIUrl":"https://doi.org/10.1109/LOGISTIQUA.2011.5939452","url":null,"abstract":"In this work, we present a variable neighborhood search for solving a capacitated location routing problem with capacitated depots and a capacitated homogenous vehicle fleet in order to minimize the location and routing cost. We present the basic elements for this purpose and implement the variable neighborhood search algorithm using the variable neighborhood descent as the local search. We tested our heuristic approach on a large number of instances and the results were compared with the literature.","PeriodicalId":324478,"journal":{"name":"2011 4th International Conference on Logistics","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128469494","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 : 2011-07-05DOI: 10.1109/LOGISTIQUA.2011.5939399
Ennouri Wissem, Frikha Ahmed, Benaissa Mounir
Location choice is one of the most important problems in the supply chain. In this paper, we consider a real problem of new hospital localization in Sfax. The site selection of this hospital is based on several incommensurable and conflicting objectives. Several approaches are developed to determine the best location for instance the Goal Programming. However, in the standard formulation of this method, the decision-maker does not participate interactively in the decision process. In this work, a Goal programming model based on satisfaction functions is proposed to take into account the decision maker's preferences.
{"title":"Multicriteria method for a site selection of a new hospital in Sfax","authors":"Ennouri Wissem, Frikha Ahmed, Benaissa Mounir","doi":"10.1109/LOGISTIQUA.2011.5939399","DOIUrl":"https://doi.org/10.1109/LOGISTIQUA.2011.5939399","url":null,"abstract":"Location choice is one of the most important problems in the supply chain. In this paper, we consider a real problem of new hospital localization in Sfax. The site selection of this hospital is based on several incommensurable and conflicting objectives. Several approaches are developed to determine the best location for instance the Goal Programming. However, in the standard formulation of this method, the decision-maker does not participate interactively in the decision process. In this work, a Goal programming model based on satisfaction functions is proposed to take into account the decision maker's preferences.","PeriodicalId":324478,"journal":{"name":"2011 4th International Conference on Logistics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128878105","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 : 2011-07-05DOI: 10.1109/LOGISTIQUA.2011.5939442
F. Bacha, K. Oliveira, M. Abed
Model Driven Architecture (MDA) is being largely explored for the development of computer systems thanks to its capability of code generation from abstract models and transformations. The Human-Computer Interaction community is also profiting from this technology to generate interface for different technologies (e.g. tablets, mobile, desktop, etc.) using the conceptual models. This paper presents a MDA approach to generate transport systems interfaces with personalized information. To do so, context model and domain ontology are used as the core of the interface design. The interface designing models can be therefore reused to generate software application for different platforms providing the pertinent information when the system is used.
{"title":"Providing personalized information in transport systems: A Model Driven Architecture approach","authors":"F. Bacha, K. Oliveira, M. Abed","doi":"10.1109/LOGISTIQUA.2011.5939442","DOIUrl":"https://doi.org/10.1109/LOGISTIQUA.2011.5939442","url":null,"abstract":"Model Driven Architecture (MDA) is being largely explored for the development of computer systems thanks to its capability of code generation from abstract models and transformations. The Human-Computer Interaction community is also profiting from this technology to generate interface for different technologies (e.g. tablets, mobile, desktop, etc.) using the conceptual models. This paper presents a MDA approach to generate transport systems interfaces with personalized information. To do so, context model and domain ontology are used as the core of the interface design. The interface designing models can be therefore reused to generate software application for different platforms providing the pertinent information when the system is used.","PeriodicalId":324478,"journal":{"name":"2011 4th International Conference on Logistics","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126203038","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 : 2011-07-05DOI: 10.1109/LOGISTIQUA.2011.5939397
J. Clarhaut, S. Hayat, Hamza Tahiri
The concept of a smart railroad wagon including train communication systems is proposed in this paper. This smart wagon is based on the concept of smart sensors and could increase the railroad safety level. Indeed, adding new functions and communication systems to a wagon reduces the risk of freight railroad accidents. In this paper, a model of this railroad wagon is presented and is illustrated.
{"title":"Integration of communication systems for a railroad smart wagon","authors":"J. Clarhaut, S. Hayat, Hamza Tahiri","doi":"10.1109/LOGISTIQUA.2011.5939397","DOIUrl":"https://doi.org/10.1109/LOGISTIQUA.2011.5939397","url":null,"abstract":"The concept of a smart railroad wagon including train communication systems is proposed in this paper. This smart wagon is based on the concept of smart sensors and could increase the railroad safety level. Indeed, adding new functions and communication systems to a wagon reduces the risk of freight railroad accidents. In this paper, a model of this railroad wagon is presented and is illustrated.","PeriodicalId":324478,"journal":{"name":"2011 4th International Conference on Logistics","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114759335","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 : 2011-07-05DOI: 10.1109/LOGISTIQUA.2011.5939316
R. Benmansour, H. Allaoui, A. Artiba
In this work we discusses the deterministic single machine scheduling problem in a just in time environment. We study the non regular objective of minimizing the earliness-tardiness cost, which is consistent with the just-in-time environment, when processing times and the common due date are known in advance. This problem is known to be NP-hard, so we propose a heuristic that do well for small restrictive due date compared to existing benchmarks. In addition to present methods for solving this classical problem, we discuss also the problem with periodic preventive maintenance and present a mixed integer linear program to solve it to optimality.
{"title":"Single machine scheduling problem in a Just-in-time environment","authors":"R. Benmansour, H. Allaoui, A. Artiba","doi":"10.1109/LOGISTIQUA.2011.5939316","DOIUrl":"https://doi.org/10.1109/LOGISTIQUA.2011.5939316","url":null,"abstract":"In this work we discusses the deterministic single machine scheduling problem in a just in time environment. We study the non regular objective of minimizing the earliness-tardiness cost, which is consistent with the just-in-time environment, when processing times and the common due date are known in advance. This problem is known to be NP-hard, so we propose a heuristic that do well for small restrictive due date compared to existing benchmarks. In addition to present methods for solving this classical problem, we discuss also the problem with periodic preventive maintenance and present a mixed integer linear program to solve it to optimality.","PeriodicalId":324478,"journal":{"name":"2011 4th International Conference on Logistics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125802212","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
扫码关注我们
求助内容：
应助结果提醒方式：