Minimal load constrained vehicle routing problems


Kara, Imdat and Bektas, Tolga (2005) Minimal load constrained vehicle routing problems. In, Sunderam, V. (ed.) Computational Science: ICCS 2005. 5th International Conference on Computer Science - ICCS 2005 Berlin, Germay, Springer-Verlag, 188-195. (Lecture Notes in Computer Science, 3514 3514). (doi:10.1007/11428831_24).

Download

Full text not available from this repository.

Original Publication URL: http://dx.doi.org/10.1007/11428831_24

Description/Abstract

In this paper, the Capacitated Vehicle Routing Problem is extended to the case where each vehicle is restricted to an additional minimal starting or returning load constraint. We refer to this extension as the Minimal Load Constrained Vehicle Routing Problem. We present integer programming formulations for single and multidepot cases. An illustrative example is also provided to show how a decision maker can use the proposed formulation as an aid in distribution planning

Item Type: Book Section
Additional Information: Series ISSN 0302-9743
ISBNs: 9783540260325 (hardback)
Related URLs:
Subjects: H Social Sciences > HD Industries. Land use. Labor > HD28 Management. Industrial Management
Divisions: University Structure - Pre August 2011 > School of Management
Item ID: 47692
Date Deposited: 08 Aug 2007
Last Modified: 10 May 2013 01:02
Contributors: Kara, Imdat (Author)
Bektas, Tolga (Author)
Sunderam, V. (Editor)
Date: May 2005
Additional Information: Series ISSN 0302-9743
Status: Published
Publisher: Springer-Verlag
URI: http://eprints.soton.ac.uk/id/eprint/47692

Actions (login required)

View Item View Item