eprintid: 735
rev_number: 7
eprint_status: archive
userid: 17
dir: disk0/00/00/07/35
datestamp: 2018-07-22 15:40:21
lastmod: 2018-07-22 15:40:21
status_changed: 2018-07-22 15:40:21
type: report
metadata_visibility: show
creators_name: Zhou, Fen
creators_name: Wu, Haitao
creators_name: Omer, Jeremy
creators_name: Sefrioui, Imane
creators_name: Flores, Luis
creators_name: Rosa, Bruno
creators_name: Deleplanque, Samuel
creators_name: de Melo da Silva, Marcos
title: Routing and Scheduling Problem of N-Side
ispublished: pub
subjects: transport
studygroups: esgi117
companyname: N-Side
full_text_status: public
problem_statement: The N-Side company presented a vehicle routing and scheduling problem for the transportation of patients to hospital using a heterogeneous fleet of vehicles. One specificity of the problem is that the duration of the consultations is uncertain. The deterministic version of the problem is a close variant of the dial-a-ride problem (DARP), which is the subject of several recent research projects (see e.g. [1, 2, 3, 4]). The growing interest for this topic has been motivated by the great di�culty of this combinatorial optimization problem.
date: 2016
date_type: completed
citation:   Zhou, Fen and Wu, Haitao and Omer, Jeremy and Sefrioui, Imane and Flores, Luis and Rosa, Bruno and Deleplanque, Samuel and de Melo da Silva, Marcos  (2016) Routing and Scheduling Problem of N-Side.  [Study Group Report]     
document_url: http://miis.maths.ox.ac.uk/miis/735/1/Nside.pdf