, similar (as can intuitively be guessed) and that guiding the optimization with the simple standard linear objective should be satisfactory even if solutions optimizing occupancy are expected. One could thus avoid relatively complex developments or use standard softwares that would not be able to manage a fractional objective

M. S. Bazaraa, H. D. Sherali, and C. M. Shetty, Nonlinear programming: Theory and Algorithms, 2006.

G. Berbeglia, J. Cordeau, I. Gribkovskaia, and G. Laporte, Static pickup and delivery problems: a classification scheme and survey, TOP, vol.15, pp.1-31, 2007.

M. A. Boschetti, A. Mingozzi, and S. Ricciardelli, A dual ascent procedure for the set partitioning problem, Discrete Optimization, vol.5, pp.735-747, 2008.

A. Charnes and W. W. Cooper, Programming with linear fractional functions, Naval research logistics quart, vol.9, pp.181-186, 1962.

J. Cordeau, A branch-and-cut algorithm for the dial-a-ride problem, Operations Research, vol.54, issue.3, pp.573-586, 2006.

J. Cordeau and G. Laporte, A tabu search heuristic algorithm for the static multi-vehicle dial-a-ride problem, Transportation Research B, vol.37, pp.579-594, 2003.

J. Cordeau and G. Laporte, The dial-a-ride problem (DARP): Variants, modeling issues and algorithms, vol.4, pp.89-101, 2003.

J. Cordeau and G. Laporte, The dial-a-ride problem: models and algorithms, Annals of Operations Research, vol.153, issue.1, pp.29-46, 2007.

T. G. Crainic and G. Laporte, Fleet Management and Logistics, 1998.

G. Desaulniers, J. Desrosiers, A. Erdmann, M. M. Solomon, and F. Soumis, VRP with pickup and delivery, The Vehicle Routing Problem, pp.225-242, 2002.
DOI : 10.1137/1.9780898718515.ch9

G. Desaulniers, J. Desrosiers, and M. M. Solomon, , 2005.

W. Dinkelbach, On nonlinear fractional programming, Management Science, vol.13, issue.7, pp.492-498, 1967.

Y. Dumas, J. Desrosiers, and F. Soumis, Large scale multi-vehicle dial-a-ride systems, GERAD, ´ Ecole des HautesÉtudesHautes´HautesÉtudes Commerciales, 1989.

D. Feillet, P. Dejax, M. Gendreau, and C. Gueguen, An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems, Networks, vol.44, issue.3, pp.216-229, 2004.

T. Garaix, D. Josselin, D. Feillet, C. Artigues, and E. Castex, Point-to-point on-demand transportation in a rural areas. A route optimisation method

. Cybergeo, A Selection of the best Articles, Article, vol.396, 2005.

T. Garaix, C. Artigues, D. Feillet, and D. Josselin, Vehicle routing problems with alternative paths: an application to on-demand transportation, European Journal of Operational Research, vol.204, issue.1, pp.62-75, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00109003

P. C. Gilmore and R. E. Gomory, A linear programming approach to the cutting stock problem-part II, Operations Research, vol.11, issue.6, pp.863-888, 1963.

B. Golden, S. Raghavan, and E. Wasil, The Vehicle Routing Problem: Latest Advances and New Challenges, vol.43, 2008.

B. Jaumard, P. Hansen, and M. Poggi-de-aragao, Column generation methods for probabilistic logic, ORSA Journal on Computing, vol.3, pp.135-148, 1991.

D. Josselin and C. Genre-grandpierre, Les transportsàtransportsà la demande pour répondre aux nouvelles formes de mobilité. le concept de modulobus, Mobilités et temporalités, pp.151-164, 2005.

L. S. Lasdon, Optimization Theory for Large Systems. Macmillan series in operations research, 1970.

H. Li and A. Lim, A metaheuristic for the pickup and delivery problem with time windows, 13th IEEE international conference on tools with artificial intelligence (ICTAI), pp.160-170, 2001.

S. N. Parragh, K. F. Doerner, and R. F. Hartl, A survey on pickup and delivery problems. part I: Transportation between customers and depot, Journal für Betriebswirtschaft, vol.58, issue.1, pp.21-51, 2008.

S. N. Parragh, K. F. Doerner, and R. F. Hartl, A survey on pickup and delivery problems. part II: Transportation between pickup and delivery locations, Journal für Betriebswirtschaft, vol.58, issue.2, pp.81-117, 2008.

S. N. Parragh, J. Cordeau, K. F. Doerner, and R. F. Hartl, Models and algorithms for the heterogeneous previous termdial-a-ridenext term problem with driver related constraints, 2009.

S. Ropke and J. Cordeau, Branch-and-cut-and-price for the pickup and delivery problem with time windows, Transportation Science, vol.43, issue.3, pp.267-286, 2009.

S. Ropke, J. Cordeau, and G. Laporte, Models and branch-and-cut algorithm for pick-up and delivery problems with time windows, Networks, vol.49, issue.4, pp.258-272, 2007.

M. W. Savelsbergh and M. Sol, DRIVE : Dynamic routing of independant vehicles, Operations Research, vol.46, pp.474-490, 1998.

M. Sol, Column generation techniques for pickup and delivery problems, 1994.