Trip assignment problems with generalized upper bounds

Chih Hang Wu, Jose Antonio 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 - 1993
EventProceedings of the 2nd Industrial Engineering Research Conference - Los Angeles, CA, USA
Duration: May 26 1993May 28 1993

Other

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

Fingerprint

Decomposition

All Science Journal Classification (ASJC) codes

  • Engineering(all)

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). Publ by IIE.
Wu, Chih Hang ; Ventura, Jose Antonio. / Trip assignment problems with generalized upper bounds. Proceedings of the Industrial Engineering Research Conference. editor / Deborah A. Mitta ; Laura I. Burke ; John R. English ; Jennie Gallimore ; Georgia-Ann Klutke ; Gregory L. Tonkay. Publ by IIE, 1993. pp. 313-319
@inproceedings{0aae28bde16d4a5b9ba9b8528ec84c1b,
title = "Trip assignment problems with generalized upper bounds",
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.",
author = "Wu, {Chih Hang} and Ventura, {Jose Antonio}",
year = "1993",
language = "English (US)",
isbn = "0898061326",
pages = "313--319",
editor = "Mitta, {Deborah A.} and Burke, {Laura I.} and English, {John R.} and Jennie Gallimore and Georgia-Ann Klutke and Tonkay, {Gregory L.}",
booktitle = "Proceedings of the Industrial Engineering Research Conference",
publisher = "Publ by IIE",

}

Wu, CH & Ventura, JA 1993, Trip assignment problems with generalized upper bounds. in DA Mitta, LI Burke, JR English, J Gallimore, G-A Klutke & GL Tonkay (eds), Proceedings of the Industrial Engineering Research Conference. Publ by IIE, pp. 313-319, Proceedings of the 2nd Industrial Engineering Research Conference, Los Angeles, CA, USA, 5/26/93.

Trip assignment problems with generalized upper bounds. / Wu, Chih Hang; Ventura, Jose Antonio.

Proceedings of the Industrial Engineering Research Conference. ed. / Deborah A. Mitta; Laura I. Burke; John R. English; Jennie Gallimore; Georgia-Ann Klutke; Gregory L. Tonkay. Publ by IIE, 1993. p. 313-319.

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

TY - GEN

T1 - Trip assignment problems with generalized upper bounds

AU - Wu, Chih Hang

AU - Ventura, Jose Antonio

PY - 1993

Y1 - 1993

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0027813525&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0027813525&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0027813525

SN - 0898061326

SP - 313

EP - 319

BT - Proceedings of the Industrial Engineering Research Conference

A2 - Mitta, Deborah A.

A2 - Burke, Laura I.

A2 - English, John R.

A2 - Gallimore, Jennie

A2 - Klutke, Georgia-Ann

A2 - Tonkay, Gregory L.

PB - Publ by IIE

ER -

Wu CH, Ventura JA. Trip assignment problems with generalized upper bounds. In Mitta DA, Burke LI, English JR, Gallimore J, Klutke G-A, Tonkay GL, editors, Proceedings of the Industrial Engineering Research Conference. Publ by IIE. 1993. p. 313-319