The Multi Depot One-to-One Pickup and Delivery Problem with Distance Constraints: Real World Application and Heuristic Solution Approach - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

The Multi Depot One-to-One Pickup and Delivery Problem with Distance Constraints: Real World Application and Heuristic Solution Approach

(1) , (2)
1
2
Olfa Chebbi
  • Function : Author
  • PersonId : 999183

Abstract

This paper presents the development of the multi depot one-to-one pickup and delivery problem with distance constraints problem. This problem involve routing vehicles in a multi depot network topology to satisfy a set of pickup and delivery requests subject to a maximum allowable distance constraint. A problem definition is given and a real world application is proposed for that problem. An approximate solution approach which divides the problem into several subproblems and solve them to optimality is also proposed. Computational experiments show that the proposed solution approach reach good quality solutions is a reasonable computational time.
Fichier principal
Vignette du fichier
448933_1_En_33_Chapter.pdf (852.03 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01656251 , version 1 (05-12-2017)

Licence

Attribution - CC BY 4.0

Identifiers

Cite

Olfa Chebbi, Ezzeddine Fatnassi. The Multi Depot One-to-One Pickup and Delivery Problem with Distance Constraints: Real World Application and Heuristic Solution Approach. 16th IFIP International Conference on Computer Information Systems and Industrial Management (CISIM), Jun 2017, Bialystok, Poland. pp.391-401, ⟨10.1007/978-3-319-59105-6_33⟩. ⟨hal-01656251⟩
158 View
89 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More