OFFRE DE THESE AU LORIA, NANCY
Forum 'Emplois' - Sujet créé le 2011-05-14 par Ammar Oulamara
OFFRE DE THESE AU LORIA, NANCY
Équipe : ORCHIDS, LORIA UMR 7503, Nancy
Encadrants : A. Oulamara et W. Ramdane Cherif
Contacts : oulamara@loria.fr, ramdanec@loria.fr
Title : Towards efficient models and methods for allocation and routing problems
In this project, the aim is the coordination of decisions for routing and allocation of products to distribution centers. Thus the areas covered by this project are location, allocation and transportation.
Location or facility location problems and models are largely considered in the operations research literature and the number of model variants is important. Several surveys of location models exist, for instance, [1-6].
Facility location is a typical problem in which decisions (the location of the facilities) are important in the sense that they greatly affect the level of services for customers and the total logistic system cost. In fact, facility location decisions are based on customer demand, but when locations of facilities are fixed they cannot be changed again without important costs. Because of this changing, many extensions to the standard facility location problem have been proposed in order to incorporate one or more aspects of transportation or routing. One of these extensions is the location-routing problem. The location-routing problems can be defined as vehicle routing problems in which the optimal number and locations of the facilities are to be determined simultaneously with the vehicle schedules and the distribution routes so as to minimize the total system costs. Survey of location-routing problems can be found in [7]. Research on location-routing problems is quite limited, compared with the extensive literature on pure location problems, vehicle routing problems and their variants.
Despite the development of new models such as location-routing problems and significant advances in formulations and algorithms optimization, there are still many issues, which need to be addressed to enhance the optimization aspect. To the best of our knowledge, models of location - routing treated in the literature considers only one type of product to model client demands. Or, in real application the customers demand is generally composed of several types of product. Moreover, in this field, research in literature supposes that at tactical decision level the allocation of products has already fixed. In that case, the allocation of product is considered as constraint by estimating the transportation and inventory costs.
In this project we will focus on allocation routing problems combining the optimization of routing and allocation of mono or multi-products in a multilevel logistic network. We consider a set of suppliers, of distribution centers and of customers. Each customer has a request for one or several types of products, which are known in advance and can be satisfied by one or more suppliers. Suppliers can provide one or more types of products. Suppliers are considered as pickup location. Customers and the distribution centers are considered as delivery location. A fleet of vehicles of limited capacity is available and can be used with a fixed cost. It can do a mixed pickup and delivery in the same trip. The objective of this project is the design of flexible and robust efficient methods and algorithms for allocation routing problems. We will study a basic version with a mono product and will generalize it to deal with the case of multi products, and the possibility to do a mixed pickup and delivery in the same trip.
References
[1] S.S. Chiu and M.L. Brandeau. An overview of representative problems in location research. Management Science, 35:645–674, 1989.
[2] C.H. Aikens. Facility location models for distribution planning. European Journal of Operational Research, 22:263–279, 1985.
[3] Drezner, Z., (Ed). Facility Location: A survey of applications and methods. Springer Verlag, Berlin, New York, 1996.
[4] Laporte, G. A survey of Algorithms for location-routing problems. Investigacion Operativa, 1, 93-123, 1989.
[5] Tansel, B. C., Francis, R. L., and Lowe, T. J. Location on networks: A survey. Part I: The p-center an p-median problems. Management Science, 29, 482-497, 1983.
[6]Tansel, B. C., Francis, R. L., and Lowe, T. J. Location on networks: A survey. Part II: Exploiting tree network structure. Management Science, 29, 498-511, 1983.
[7] Laporte G, Nobert Y, Arpin D. An exact algorithm for solving a capacitated location-routing problem. Annals of Operations Research, 239-310, 1986.
Candidature.
Envoyez un CV, vos relevés de notes de M1 et M2, et lettres de recommandations à : oulamara@loria.fr
Équipe : ORCHIDS, LORIA UMR 7503, Nancy
Encadrants : A. Oulamara et W. Ramdane Cherif
Contacts : oulamara@loria.fr, ramdanec@loria.fr
Title : Towards efficient models and methods for allocation and routing problems
In this project, the aim is the coordination of decisions for routing and allocation of products to distribution centers. Thus the areas covered by this project are location, allocation and transportation.
Location or facility location problems and models are largely considered in the operations research literature and the number of model variants is important. Several surveys of location models exist, for instance, [1-6].
Facility location is a typical problem in which decisions (the location of the facilities) are important in the sense that they greatly affect the level of services for customers and the total logistic system cost. In fact, facility location decisions are based on customer demand, but when locations of facilities are fixed they cannot be changed again without important costs. Because of this changing, many extensions to the standard facility location problem have been proposed in order to incorporate one or more aspects of transportation or routing. One of these extensions is the location-routing problem. The location-routing problems can be defined as vehicle routing problems in which the optimal number and locations of the facilities are to be determined simultaneously with the vehicle schedules and the distribution routes so as to minimize the total system costs. Survey of location-routing problems can be found in [7]. Research on location-routing problems is quite limited, compared with the extensive literature on pure location problems, vehicle routing problems and their variants.
Despite the development of new models such as location-routing problems and significant advances in formulations and algorithms optimization, there are still many issues, which need to be addressed to enhance the optimization aspect. To the best of our knowledge, models of location - routing treated in the literature considers only one type of product to model client demands. Or, in real application the customers demand is generally composed of several types of product. Moreover, in this field, research in literature supposes that at tactical decision level the allocation of products has already fixed. In that case, the allocation of product is considered as constraint by estimating the transportation and inventory costs.
In this project we will focus on allocation routing problems combining the optimization of routing and allocation of mono or multi-products in a multilevel logistic network. We consider a set of suppliers, of distribution centers and of customers. Each customer has a request for one or several types of products, which are known in advance and can be satisfied by one or more suppliers. Suppliers can provide one or more types of products. Suppliers are considered as pickup location. Customers and the distribution centers are considered as delivery location. A fleet of vehicles of limited capacity is available and can be used with a fixed cost. It can do a mixed pickup and delivery in the same trip. The objective of this project is the design of flexible and robust efficient methods and algorithms for allocation routing problems. We will study a basic version with a mono product and will generalize it to deal with the case of multi products, and the possibility to do a mixed pickup and delivery in the same trip.
References
[1] S.S. Chiu and M.L. Brandeau. An overview of representative problems in location research. Management Science, 35:645–674, 1989.
[2] C.H. Aikens. Facility location models for distribution planning. European Journal of Operational Research, 22:263–279, 1985.
[3] Drezner, Z., (Ed). Facility Location: A survey of applications and methods. Springer Verlag, Berlin, New York, 1996.
[4] Laporte, G. A survey of Algorithms for location-routing problems. Investigacion Operativa, 1, 93-123, 1989.
[5] Tansel, B. C., Francis, R. L., and Lowe, T. J. Location on networks: A survey. Part I: The p-center an p-median problems. Management Science, 29, 482-497, 1983.
[6]Tansel, B. C., Francis, R. L., and Lowe, T. J. Location on networks: A survey. Part II: Exploiting tree network structure. Management Science, 29, 498-511, 1983.
[7] Laporte G, Nobert Y, Arpin D. An exact algorithm for solving a capacitated location-routing problem. Annals of Operations Research, 239-310, 1986.
Candidature.
Envoyez un CV, vos relevés de notes de M1 et M2, et lettres de recommandations à : oulamara@loria.fr