Back to results

NJIT

A bi-level programming approach for the shipper-carrier network problem

Abstract

dc:description.abstract

The Stackelberg game betweenshippers and carriers in an intermodal network is formulated as a bi-levelprogram. In this network, shippers make production, consumption, androuting decisions while carriers make pricing and routing decisions.The oligopolistic carrier pricing and routing problem, which comprisesthe upper level of the bi-level program, is formulated either as a nonlinearconstrained optimization problem or as a variational inequality problem,depending on whether the oligopolistic carriers choose to collude orcompete with each other in their pricing decision. The shippers' decisionbehavior is defined by the spatial price equilibrium principle. Forthe spatial price equilibrium problem, which is the lower level of thebi-level program, a variational inequality formulation is used to accountfor the asymmetric interactions between flows of different commoditytypes. A sensitivity analysis-based heuristic algorithm is proposedto solve the program. An example application of the bi-level programmingapproach analyzes the behavior of two marine terminal operators. Theterminal operators are considered to be under the same Port Authority.The bi-level programming approach is then used to evaluate the PortAuthority's alternative investment strategies.

Degree

thesis:*
Name thesis:degree_name
Doctor of Philosophy in Transportation - (Ph.D.)
Discipline thesis:degree_discipline
Executive Committee for the Interdisciplinary Program in Transportation
Year
2002

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Wang, Ya
Contributors dc:contributor
  • Maria P. Boilé
  • Lazar Spasovic
  • Athanassios K. Bladikas

Subjects

dc:subject × 6

Identifiers

dc:identifier.*
Repository record dc:identifier
https://digitalcommons.njit.edu/dissertations/541
OAI identifier oai:identifier
oai:digitalcommons.njit.edu:dissertations-1596

Chain of custody

source
Harvested from
NJIT
Base URL
digitalcommons.njit.edu/do/oai/
Last updated
2026-07-24
Source record
OAI-PMH GetRecord
citation

Wang, Ya. A bi-level programming approach for the shipper-carrier network problem. 2002. https://digitalcommons.njit.edu/dissertations/541