Trip assignment problems with generalized upper bounds

Chih Hang Wu, Jose A. Ventura

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper, a variation of the Restricted Simplicial Decomposition (RSD) algorithm is proposed to handle nonlinear trip assignment problems with additional side constraints. The set of side constraints has a generalized upper bounding structure. The proposed algorithm alternatively solves a linear subproblem and a nonlinear master problem until the optimal point is achieved. A computational example is also presented to evaluate the performance of the algorithm.

Original languageEnglish (US)
Title of host publicationProceedings of the Industrial Engineering Research Conference
EditorsDeborah A. Mitta, Laura I. Burke, John R. English, Jennie Gallimore, Georgia-Ann Klutke, Gregory L. Tonkay
PublisherPubl by IIE
Pages313-319
Number of pages7
ISBN (Print)0898061326
StatePublished - Dec 1 1993
EventProceedings of the 2nd Industrial Engineering Research Conference - Los Angeles, CA, USA
Duration: May 26 1993May 28 1993

Publication series

NameProceedings of the Industrial Engineering Research Conference

Other

OtherProceedings of the 2nd Industrial Engineering Research Conference
CityLos Angeles, CA, USA
Period5/26/935/28/93

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Fingerprint Dive into the research topics of 'Trip assignment problems with generalized upper bounds'. Together they form a unique fingerprint.

  • Cite this

    Wu, C. H., & Ventura, J. A. (1993). Trip assignment problems with generalized upper bounds. In D. A. Mitta, L. I. Burke, J. R. English, J. Gallimore, G-A. Klutke, & G. L. Tonkay (Eds.), Proceedings of the Industrial Engineering Research Conference (pp. 313-319). (Proceedings of the Industrial Engineering Research Conference). Publ by IIE.