Selective vehicle routing problems in collaborative transportation
Forum 'Emplois' - Sujet créé le 2015-06-24 par Mehdi Serairi
Research work:
During the last two decades, economic globalization and increasing customer needs in terms of price, quality, service, and reactivity have pushed enterprises to improve their logistic systems in order to quickly respond to customer demand at the minimum cost. Moreover, the rapid development of e-commerce which requires delivering goods to consumers' homes further increases urban logistics flows. This evolution has significantly increase the number of vehicles traveling on the urban road, traffic congestion and air pollution. This increase reinforced by the price soaring of fuel has also a very important impact on logistic systems of the enterprises.
There are two types of collaboration in transportation, collaboration among shippers and collaboration among carriers. Shipper collaboration happens when transportation requests of multiple shippers are consolidated and served by a single carrier. On the other hand, carrier collaboration is realized by exchanging transportation requests or sharing vehicle capacities among multiple carriers.
The question is how to coordinate these systems by considering vehicle routing problems with profits or selective routing problems. Each shipper request is associated with a profit, which is the revenue that a carrier can obtain for serving this request. It is not necessary for the carrier to serve all requests. The objective is to select a subset of requests to serve as well as the routes for serving them so that the total profit obtained by serving the requests is maximized subject to vehicle capacity constraints and other constraints such as time windows for serving each request. Our objective is to develop models and effective methods for selective routing problems in the urban distribution systems with some specific constraints such as cluster management and conflicts between requests.
The PhD student will explore several paths including reformulations and the complexity of some particular cases because identifying NP-hard problems and polynomial cases should help to a better understanding of the combinatorial structures of the problem. Next we will consider the question of robustness of a solution: what is the more important randomness and what is the cost of robustness? We will consider hybrid methods based on mathematical models and other optimization techniques such as constraints programming and dynamic programming.
Location:
Laboratory Heudiasyc UMR CNRS 7253
Université de Technologie de Compiègne (UTC)
CS 60 319
60 203 Compiègne cedex, France
Contact:
• Aziz Moukrim, Professeur Heudiasyc, UMR CNRS-UTC 7253
03 44 23 49 52, aziz.moukrim@hds.utc.fr
• Mehdi Serairi, Enseignant-Chercheur, Heudiasyc, UMR CNRS-UTC 7253
03 44 23 44 75, mehdi.serairi@hds.utc.fr
During the last two decades, economic globalization and increasing customer needs in terms of price, quality, service, and reactivity have pushed enterprises to improve their logistic systems in order to quickly respond to customer demand at the minimum cost. Moreover, the rapid development of e-commerce which requires delivering goods to consumers' homes further increases urban logistics flows. This evolution has significantly increase the number of vehicles traveling on the urban road, traffic congestion and air pollution. This increase reinforced by the price soaring of fuel has also a very important impact on logistic systems of the enterprises.
There are two types of collaboration in transportation, collaboration among shippers and collaboration among carriers. Shipper collaboration happens when transportation requests of multiple shippers are consolidated and served by a single carrier. On the other hand, carrier collaboration is realized by exchanging transportation requests or sharing vehicle capacities among multiple carriers.
The question is how to coordinate these systems by considering vehicle routing problems with profits or selective routing problems. Each shipper request is associated with a profit, which is the revenue that a carrier can obtain for serving this request. It is not necessary for the carrier to serve all requests. The objective is to select a subset of requests to serve as well as the routes for serving them so that the total profit obtained by serving the requests is maximized subject to vehicle capacity constraints and other constraints such as time windows for serving each request. Our objective is to develop models and effective methods for selective routing problems in the urban distribution systems with some specific constraints such as cluster management and conflicts between requests.
The PhD student will explore several paths including reformulations and the complexity of some particular cases because identifying NP-hard problems and polynomial cases should help to a better understanding of the combinatorial structures of the problem. Next we will consider the question of robustness of a solution: what is the more important randomness and what is the cost of robustness? We will consider hybrid methods based on mathematical models and other optimization techniques such as constraints programming and dynamic programming.
Location:
Laboratory Heudiasyc UMR CNRS 7253
Université de Technologie de Compiègne (UTC)
CS 60 319
60 203 Compiègne cedex, France
Contact:
• Aziz Moukrim, Professeur Heudiasyc, UMR CNRS-UTC 7253
03 44 23 49 52, aziz.moukrim@hds.utc.fr
• Mehdi Serairi, Enseignant-Chercheur, Heudiasyc, UMR CNRS-UTC 7253
03 44 23 44 75, mehdi.serairi@hds.utc.fr