Expanding the scope of linear programming solutions for vehicle scheduling problems

Cdj Waters

Omega, 1988, vol. 16, issue 6, 577-583

Abstract: It is often suggested that zero-one linear programming can be used to tackle vehicle scheduling problems. In practice, optimal solutions can only be guaranteed for very small problems. Here an estimate is made of the size of problem which could be tackled by an 'ordinary user', particularly when using a formulation with reduced numbers of zero-one variables. Strategies for extending the scope of ILP are outlined. Changing the mode of data presentation to road networks can be useful but may introduce other difficulties. Overall, it is clear that considerable progress is still needed before ILP can be used for tackling real problems.

Date: 1988
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0305-0483(88)90031-X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:jomega:v:16:y:1988:i:6:p:577-583

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Omega is currently edited by B. Lev

More articles in Omega from Elsevier
Bibliographic data for series maintained by Catherine Liu ().