%0 Conference Proceedings
%T The Multi Depot One-to-One Pickup and Delivery Problem with Distance Constraints: Real World Application and Heuristic Solution Approach
%+ Université de Kairouan (UNIV-K)
%+ Université de Tunis
%A Chebbi, Olfa
%A Fatnassi, Ezzeddine
%Z Part 5: Industrial Management and Other Applications
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 16th IFIP International Conference on Computer Information Systems and Industrial Management (CISIM)
%C Bialystok, Poland
%Y Khalid Saeed
%Y Władysław Homenda
%Y Rituparna Chaki
%I Springer International Publishing
%3 Computer Information Systems and Industrial Management
%V LNCS-10244
%P 391-401
%8 2017-06-16
%D 2017
%R 10.1007/978-3-319-59105-6_33
%K Vehicle routing problem
%K Multi-depot
%K Pickup and delivery requests
%K Transportation problems
%Z Computer Science [cs]
%Z Humanities and Social Sciences/Library and information sciencesConference papers
%X 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.
%G English
%Z TC 8
%2 https://inria.hal.science/hal-01656251/document
%2 https://inria.hal.science/hal-01656251/file/448933_1_En_33_Chapter.pdf
%L hal-01656251
%U https://inria.hal.science/hal-01656251
%~ SHS
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC8
%~ IFIP-CISIM
%~ IFIP-LNCS-10244